./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:23:21,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:23:21,657 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:23:21,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:23:21,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:23:21,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:23:21,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:23:21,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:23:21,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:23:21,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:23:21,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:23:21,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:23:21,701 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:23:21,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:23:21,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:23:21,703 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:23:21,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:23:21,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:23:21,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:23:21,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:23:21,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:23:21,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:23:21,715 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:23:21,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:23:21,718 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:23:21,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:23:21,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:23:21,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:23:21,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:23:21,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:23:21,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:23:21,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:23:21,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:23:21,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:23:21,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:23:21,733 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:23:21,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:23:21,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:23:21,734 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:23:21,734 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59352034a8e7fb7bc8ebfc4ca4573abd72388675e4ed8d10658bda7976c62170 [2023-11-12 02:23:22,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:23:22,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:23:22,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:23:22,098 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:23:22,099 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:23:22,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i [2023-11-12 02:23:25,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:23:25,443 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:23:25,443 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i [2023-11-12 02:23:25,454 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/data/1db93fb3e/24650ac57be94f639ff40167acce7929/FLAG81df32b34 [2023-11-12 02:23:25,469 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/data/1db93fb3e/24650ac57be94f639ff40167acce7929 [2023-11-12 02:23:25,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:23:25,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:23:25,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:23:25,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:23:25,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:23:25,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:25,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5dd5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25, skipping insertion in model container [2023-11-12 02:23:25,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:25,547 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:23:25,707 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i[916,929] [2023-11-12 02:23:25,776 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:23:25,791 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:23:25,804 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-88.i[916,929] [2023-11-12 02:23:25,836 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:23:25,858 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:23:25,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25 WrapperNode [2023-11-12 02:23:25,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:23:25,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:23:25,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:23:25,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:23:25,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:25,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:25,944 INFO L138 Inliner]: procedures = 29, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2023-11-12 02:23:25,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:23:25,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:23:25,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:23:25,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:23:25,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:25,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:25,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:25,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:25,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:25,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:25,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:25,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:26,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:23:26,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:23:26,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:23:26,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:23:26,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25" (1/1) ... [2023-11-12 02:23:26,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:23:26,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:23:26,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:23:26,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bbf2989d-bd35-483d-8158-f5cbf182f227/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:23:26,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:23:26,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-12 02:23:26,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:23:26,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-12 02:23:26,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:23:26,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-12 02:23:26,099 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:23:26,099 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:23:26,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:23:26,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:23:26,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:23:26,301 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:23:26,304 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:23:26,918 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:23:26,926 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:23:26,926 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:23:26,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:23:26 BoogieIcfgContainer [2023-11-12 02:23:26,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:23:26,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:23:26,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:23:26,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:23:26,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:23:25" (1/3) ... [2023-11-12 02:23:26,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6341d0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:23:26, skipping insertion in model container [2023-11-12 02:23:26,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:25" (2/3) ... [2023-11-12 02:23:26,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6341d0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:23:26, skipping insertion in model container [2023-11-12 02:23:26,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:23:26" (3/3) ... [2023-11-12 02:23:26,939 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-88.i [2023-11-12 02:23:26,984 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:23:26,984 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:23:27,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:23:27,059 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c6952d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:23:27,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:23:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:23:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-12 02:23:27,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:27,079 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:27,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:27,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:27,085 INFO L85 PathProgramCache]: Analyzing trace with hash -397968788, now seen corresponding path program 1 times [2023-11-12 02:23:27,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:27,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758155679] [2023-11-12 02:23:27,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:27,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:27,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:27,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758155679] [2023-11-12 02:23:27,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758155679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:27,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:27,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:23:27,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013978243] [2023-11-12 02:23:27,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:27,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:23:27,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:27,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:23:27,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:23:27,861 INFO L87 Difference]: Start difference. First operand has 117 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-12 02:23:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:27,895 INFO L93 Difference]: Finished difference Result 227 states and 357 transitions. [2023-11-12 02:23:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:23:27,899 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-11-12 02:23:27,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:27,908 INFO L225 Difference]: With dead ends: 227 [2023-11-12 02:23:27,909 INFO L226 Difference]: Without dead ends: 113 [2023-11-12 02:23:27,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:23:27,917 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:27,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:23:27,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-12 02:23:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-11-12 02:23:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:23:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2023-11-12 02:23:27,973 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 143 [2023-11-12 02:23:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:27,974 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2023-11-12 02:23:27,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-12 02:23:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2023-11-12 02:23:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-12 02:23:27,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:27,981 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:27,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:23:27,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:27,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:27,983 INFO L85 PathProgramCache]: Analyzing trace with hash 455379670, now seen corresponding path program 1 times [2023-11-12 02:23:27,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:27,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576436305] [2023-11-12 02:23:27,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:27,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:28,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:28,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576436305] [2023-11-12 02:23:28,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576436305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:28,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:28,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:23:28,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526889103] [2023-11-12 02:23:28,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:28,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:23:28,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:28,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:23:28,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:23:28,538 INFO L87 Difference]: Start difference. First operand 113 states and 166 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-12 02:23:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:28,624 INFO L93 Difference]: Finished difference Result 229 states and 338 transitions. [2023-11-12 02:23:28,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:23:28,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-11-12 02:23:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:28,632 INFO L225 Difference]: With dead ends: 229 [2023-11-12 02:23:28,632 INFO L226 Difference]: Without dead ends: 119 [2023-11-12 02:23:28,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:23:28,635 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 10 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:28,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 486 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:23:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-12 02:23:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2023-11-12 02:23:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:23:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2023-11-12 02:23:28,663 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 143 [2023-11-12 02:23:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:28,664 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2023-11-12 02:23:28,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-12 02:23:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2023-11-12 02:23:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-12 02:23:28,668 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:28,668 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:28,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:23:28,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:28,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:28,669 INFO L85 PathProgramCache]: Analyzing trace with hash -420639336, now seen corresponding path program 1 times [2023-11-12 02:23:28,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:28,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273145303] [2023-11-12 02:23:28,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:28,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:29,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:29,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273145303] [2023-11-12 02:23:29,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273145303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:29,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:29,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:23:29,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321040075] [2023-11-12 02:23:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:29,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:23:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:29,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:23:29,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:23:29,143 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:29,225 INFO L93 Difference]: Finished difference Result 239 states and 350 transitions. [2023-11-12 02:23:29,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:23:29,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2023-11-12 02:23:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:29,235 INFO L225 Difference]: With dead ends: 239 [2023-11-12 02:23:29,235 INFO L226 Difference]: Without dead ends: 127 [2023-11-12 02:23:29,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:23:29,242 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 21 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:29,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 485 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:23:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-12 02:23:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2023-11-12 02:23:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:23:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2023-11-12 02:23:29,269 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 143 [2023-11-12 02:23:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:29,270 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2023-11-12 02:23:29,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2023-11-12 02:23:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-12 02:23:29,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:29,284 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:29,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:23:29,285 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:29,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:29,285 INFO L85 PathProgramCache]: Analyzing trace with hash 259419034, now seen corresponding path program 1 times [2023-11-12 02:23:29,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:29,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969047693] [2023-11-12 02:23:29,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:29,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:29,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:29,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969047693] [2023-11-12 02:23:29,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969047693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:29,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:29,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:23:29,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334670942] [2023-11-12 02:23:29,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:29,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:23:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:29,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:23:29,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:23:29,607 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:29,645 INFO L93 Difference]: Finished difference Result 235 states and 342 transitions. [2023-11-12 02:23:29,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:23:29,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2023-11-12 02:23:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:29,653 INFO L225 Difference]: With dead ends: 235 [2023-11-12 02:23:29,654 INFO L226 Difference]: Without dead ends: 121 [2023-11-12 02:23:29,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:23:29,661 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 3 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:29,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 482 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:23:29,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-12 02:23:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2023-11-12 02:23:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:23:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2023-11-12 02:23:29,681 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 143 [2023-11-12 02:23:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:29,682 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2023-11-12 02:23:29,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2023-11-12 02:23:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-12 02:23:29,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:29,685 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:29,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:23:29,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:29,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:29,686 INFO L85 PathProgramCache]: Analyzing trace with hash 261266076, now seen corresponding path program 1 times [2023-11-12 02:23:29,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:29,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269204767] [2023-11-12 02:23:29,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:29,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:31,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:31,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:31,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:31,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:31,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:32,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:32,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:32,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:32,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:32,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:32,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:32,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:32,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:32,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269204767] [2023-11-12 02:23:32,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269204767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:32,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:32,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:23:32,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002789319] [2023-11-12 02:23:32,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:32,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:23:32,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:23:32,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:23:32,146 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:32,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:32,861 INFO L93 Difference]: Finished difference Result 326 states and 472 transitions. [2023-11-12 02:23:32,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:23:32,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2023-11-12 02:23:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:32,865 INFO L225 Difference]: With dead ends: 326 [2023-11-12 02:23:32,865 INFO L226 Difference]: Without dead ends: 210 [2023-11-12 02:23:32,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:23:32,872 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 592 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:32,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 428 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:23:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-12 02:23:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 136. [2023-11-12 02:23:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:23:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 198 transitions. [2023-11-12 02:23:32,919 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 198 transitions. Word has length 143 [2023-11-12 02:23:32,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:32,920 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 198 transitions. [2023-11-12 02:23:32,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 198 transitions. [2023-11-12 02:23:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-12 02:23:32,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:32,922 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:32,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:23:32,923 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:32,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:32,923 INFO L85 PathProgramCache]: Analyzing trace with hash 686367886, now seen corresponding path program 1 times [2023-11-12 02:23:32,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:32,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128478353] [2023-11-12 02:23:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:33,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128478353] [2023-11-12 02:23:33,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128478353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:33,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:33,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:23:33,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843778441] [2023-11-12 02:23:33,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:33,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:23:33,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:33,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:23:33,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:23:33,286 INFO L87 Difference]: Start difference. First operand 136 states and 198 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:33,387 INFO L93 Difference]: Finished difference Result 296 states and 431 transitions. [2023-11-12 02:23:33,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:23:33,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2023-11-12 02:23:33,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:33,390 INFO L225 Difference]: With dead ends: 296 [2023-11-12 02:23:33,391 INFO L226 Difference]: Without dead ends: 163 [2023-11-12 02:23:33,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:23:33,393 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 89 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:33,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 659 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:23:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-12 02:23:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2023-11-12 02:23:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 states have internal predecessors, (167), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:23:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2023-11-12 02:23:33,422 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 145 [2023-11-12 02:23:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:33,424 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2023-11-12 02:23:33,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2023-11-12 02:23:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-12 02:23:33,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:33,427 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:33,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:23:33,428 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:33,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1030224361, now seen corresponding path program 1 times [2023-11-12 02:23:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:33,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018939215] [2023-11-12 02:23:33,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:35,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:35,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018939215] [2023-11-12 02:23:35,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018939215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:35,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:35,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:23:35,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523106852] [2023-11-12 02:23:35,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:35,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:23:35,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:35,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:23:35,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:23:35,878 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:36,804 INFO L93 Difference]: Finished difference Result 370 states and 533 transitions. [2023-11-12 02:23:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:23:36,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2023-11-12 02:23:36,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:36,807 INFO L225 Difference]: With dead ends: 370 [2023-11-12 02:23:36,807 INFO L226 Difference]: Without dead ends: 234 [2023-11-12 02:23:36,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:23:36,809 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 412 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:36,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 616 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:23:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-11-12 02:23:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 141. [2023-11-12 02:23:36,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 122 states have internal predecessors, (170), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:23:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2023-11-12 02:23:36,842 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 145 [2023-11-12 02:23:36,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:36,842 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2023-11-12 02:23:36,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2023-11-12 02:23:36,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-12 02:23:36,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:36,847 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:36,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:23:36,847 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:36,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:36,848 INFO L85 PathProgramCache]: Analyzing trace with hash 877786263, now seen corresponding path program 1 times [2023-11-12 02:23:36,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:36,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918061511] [2023-11-12 02:23:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:36,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918061511] [2023-11-12 02:23:38,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918061511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:38,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:38,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:23:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868117149] [2023-11-12 02:23:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:38,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:23:38,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:38,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:23:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:23:38,937 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:39,663 INFO L93 Difference]: Finished difference Result 387 states and 559 transitions. [2023-11-12 02:23:39,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:23:39,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 145 [2023-11-12 02:23:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:39,667 INFO L225 Difference]: With dead ends: 387 [2023-11-12 02:23:39,667 INFO L226 Difference]: Without dead ends: 249 [2023-11-12 02:23:39,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:23:39,669 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 450 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:39,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 484 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:23:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-11-12 02:23:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 141. [2023-11-12 02:23:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 122 states have internal predecessors, (170), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:23:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2023-11-12 02:23:39,692 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 145 [2023-11-12 02:23:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:39,693 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2023-11-12 02:23:39,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2023-11-12 02:23:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-12 02:23:39,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:39,695 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:39,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:23:39,696 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:39,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash -929034428, now seen corresponding path program 1 times [2023-11-12 02:23:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:39,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698668560] [2023-11-12 02:23:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:41,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:41,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698668560] [2023-11-12 02:23:41,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698668560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:41,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:41,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:23:41,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173310964] [2023-11-12 02:23:41,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:41,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:23:41,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:41,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:23:41,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:23:41,662 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:42,460 INFO L93 Difference]: Finished difference Result 372 states and 535 transitions. [2023-11-12 02:23:42,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:23:42,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2023-11-12 02:23:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:42,463 INFO L225 Difference]: With dead ends: 372 [2023-11-12 02:23:42,463 INFO L226 Difference]: Without dead ends: 234 [2023-11-12 02:23:42,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:23:42,464 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 436 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:42,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 612 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:23:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-11-12 02:23:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2023-11-12 02:23:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 138 states have (on average 1.4202898550724639) internal successors, (196), 138 states have internal predecessors, (196), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:23:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 230 transitions. [2023-11-12 02:23:42,486 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 230 transitions. Word has length 146 [2023-11-12 02:23:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:42,487 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 230 transitions. [2023-11-12 02:23:42,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 230 transitions. [2023-11-12 02:23:42,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-12 02:23:42,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:42,490 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:42,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:23:42,490 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:42,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:42,491 INFO L85 PathProgramCache]: Analyzing trace with hash 533674803, now seen corresponding path program 1 times [2023-11-12 02:23:42,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:42,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385272467] [2023-11-12 02:23:42,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:42,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:43,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:43,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385272467] [2023-11-12 02:23:43,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385272467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:43,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:43,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:23:43,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388463534] [2023-11-12 02:23:43,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:43,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:23:43,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:43,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:23:43,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:23:43,504 INFO L87 Difference]: Start difference. First operand 157 states and 230 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:43,731 INFO L93 Difference]: Finished difference Result 466 states and 685 transitions. [2023-11-12 02:23:43,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:23:43,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2023-11-12 02:23:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:43,735 INFO L225 Difference]: With dead ends: 466 [2023-11-12 02:23:43,735 INFO L226 Difference]: Without dead ends: 312 [2023-11-12 02:23:43,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:23:43,736 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 122 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:43,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 404 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:23:43,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-11-12 02:23:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 254. [2023-11-12 02:23:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 217 states have (on average 1.3824884792626728) internal successors, (300), 217 states have internal predecessors, (300), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-12 02:23:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 368 transitions. [2023-11-12 02:23:43,800 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 368 transitions. Word has length 147 [2023-11-12 02:23:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:43,801 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 368 transitions. [2023-11-12 02:23:43,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 368 transitions. [2023-11-12 02:23:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-12 02:23:43,803 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:43,804 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:43,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:23:43,804 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:43,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1845295159, now seen corresponding path program 1 times [2023-11-12 02:23:43,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:43,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310635885] [2023-11-12 02:23:43,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:43,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:44,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:44,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310635885] [2023-11-12 02:23:44,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310635885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:44,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:44,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:23:44,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465563140] [2023-11-12 02:23:44,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:44,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:23:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:44,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:23:44,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:23:44,889 INFO L87 Difference]: Start difference. First operand 254 states and 368 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:45,368 INFO L93 Difference]: Finished difference Result 561 states and 808 transitions. [2023-11-12 02:23:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:23:45,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2023-11-12 02:23:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:45,378 INFO L225 Difference]: With dead ends: 561 [2023-11-12 02:23:45,378 INFO L226 Difference]: Without dead ends: 407 [2023-11-12 02:23:45,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:23:45,380 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 184 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:45,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 599 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:23:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-12 02:23:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 262. [2023-11-12 02:23:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 225 states have (on average 1.3866666666666667) internal successors, (312), 225 states have internal predecessors, (312), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-12 02:23:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 380 transitions. [2023-11-12 02:23:45,434 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 380 transitions. Word has length 149 [2023-11-12 02:23:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:45,435 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 380 transitions. [2023-11-12 02:23:45,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 380 transitions. [2023-11-12 02:23:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-12 02:23:45,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:45,438 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:45,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:23:45,438 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:45,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:45,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1626440441, now seen corresponding path program 1 times [2023-11-12 02:23:45,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:45,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260529746] [2023-11-12 02:23:45,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:45,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:46,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:46,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260529746] [2023-11-12 02:23:46,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260529746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:46,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:46,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:23:46,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640539071] [2023-11-12 02:23:46,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:46,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:23:46,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:46,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:23:46,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:23:46,419 INFO L87 Difference]: Start difference. First operand 262 states and 380 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:46,750 INFO L93 Difference]: Finished difference Result 553 states and 798 transitions. [2023-11-12 02:23:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:23:46,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2023-11-12 02:23:46,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:46,754 INFO L225 Difference]: With dead ends: 553 [2023-11-12 02:23:46,755 INFO L226 Difference]: Without dead ends: 391 [2023-11-12 02:23:46,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:23:46,756 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 261 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:46,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1037 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:23:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-12 02:23:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 268. [2023-11-12 02:23:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 231 states have (on average 1.3766233766233766) internal successors, (318), 231 states have internal predecessors, (318), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-12 02:23:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 386 transitions. [2023-11-12 02:23:46,806 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 386 transitions. Word has length 149 [2023-11-12 02:23:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:46,807 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 386 transitions. [2023-11-12 02:23:46,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 386 transitions. [2023-11-12 02:23:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-12 02:23:46,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:46,810 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:46,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:23:46,810 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:46,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash -594694468, now seen corresponding path program 1 times [2023-11-12 02:23:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639882332] [2023-11-12 02:23:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:49,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639882332] [2023-11-12 02:23:49,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639882332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:49,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:49,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:23:49,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923124633] [2023-11-12 02:23:49,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:49,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:23:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:49,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:23:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:23:49,928 INFO L87 Difference]: Start difference. First operand 268 states and 386 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:50,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:50,645 INFO L93 Difference]: Finished difference Result 467 states and 676 transitions. [2023-11-12 02:23:50,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:23:50,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2023-11-12 02:23:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:50,649 INFO L225 Difference]: With dead ends: 467 [2023-11-12 02:23:50,649 INFO L226 Difference]: Without dead ends: 305 [2023-11-12 02:23:50,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:23:50,650 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 414 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:50,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 443 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:23:50,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-11-12 02:23:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 236. [2023-11-12 02:23:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 199 states have (on average 1.35678391959799) internal successors, (270), 199 states have internal predecessors, (270), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-12 02:23:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 338 transitions. [2023-11-12 02:23:50,694 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 338 transitions. Word has length 149 [2023-11-12 02:23:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:50,695 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 338 transitions. [2023-11-12 02:23:50,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 338 transitions. [2023-11-12 02:23:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-12 02:23:50,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:50,697 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:50,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:23:50,698 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:50,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1664747180, now seen corresponding path program 1 times [2023-11-12 02:23:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:50,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545451954] [2023-11-12 02:23:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:52,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:52,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545451954] [2023-11-12 02:23:52,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545451954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:52,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:52,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:23:52,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054578523] [2023-11-12 02:23:52,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:52,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:23:52,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:52,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:23:52,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:23:52,421 INFO L87 Difference]: Start difference. First operand 236 states and 338 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:52,922 INFO L93 Difference]: Finished difference Result 473 states and 675 transitions. [2023-11-12 02:23:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:23:52,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2023-11-12 02:23:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:52,925 INFO L225 Difference]: With dead ends: 473 [2023-11-12 02:23:52,926 INFO L226 Difference]: Without dead ends: 329 [2023-11-12 02:23:52,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:23:52,927 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 315 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:52,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 598 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:23:52,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-11-12 02:23:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 289. [2023-11-12 02:23:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-12 02:23:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 412 transitions. [2023-11-12 02:23:52,978 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 412 transitions. Word has length 150 [2023-11-12 02:23:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:52,979 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 412 transitions. [2023-11-12 02:23:52,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 412 transitions. [2023-11-12 02:23:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-12 02:23:52,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:52,981 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:52,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:23:52,982 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:52,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1381471831, now seen corresponding path program 1 times [2023-11-12 02:23:52,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:52,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894365103] [2023-11-12 02:23:52,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:52,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:55,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:55,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894365103] [2023-11-12 02:23:55,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894365103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:55,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:55,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:23:55,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459554147] [2023-11-12 02:23:55,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:55,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:23:55,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:55,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:23:55,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:23:55,095 INFO L87 Difference]: Start difference. First operand 289 states and 412 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:56,069 INFO L93 Difference]: Finished difference Result 647 states and 921 transitions. [2023-11-12 02:23:56,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:23:56,070 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2023-11-12 02:23:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:56,073 INFO L225 Difference]: With dead ends: 647 [2023-11-12 02:23:56,073 INFO L226 Difference]: Without dead ends: 460 [2023-11-12 02:23:56,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2023-11-12 02:23:56,077 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 288 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:56,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 712 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:23:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-11-12 02:23:56,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 293. [2023-11-12 02:23:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 256 states have (on average 1.3671875) internal successors, (350), 256 states have internal predecessors, (350), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-12 02:23:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 418 transitions. [2023-11-12 02:23:56,129 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 418 transitions. Word has length 150 [2023-11-12 02:23:56,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:56,130 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 418 transitions. [2023-11-12 02:23:56,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 418 transitions. [2023-11-12 02:23:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-12 02:23:56,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:56,134 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:56,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:23:56,134 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:56,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1144580055, now seen corresponding path program 1 times [2023-11-12 02:23:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:56,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186703765] [2023-11-12 02:23:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:58,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:58,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186703765] [2023-11-12 02:23:58,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186703765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:58,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:58,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:23:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074302026] [2023-11-12 02:23:58,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:58,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:23:58,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:58,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:23:58,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:23:58,449 INFO L87 Difference]: Start difference. First operand 293 states and 418 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:59,534 INFO L93 Difference]: Finished difference Result 693 states and 990 transitions. [2023-11-12 02:23:59,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:23:59,535 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2023-11-12 02:23:59,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:59,538 INFO L225 Difference]: With dead ends: 693 [2023-11-12 02:23:59,538 INFO L226 Difference]: Without dead ends: 504 [2023-11-12 02:23:59,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2023-11-12 02:23:59,540 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 447 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:59,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 679 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:23:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2023-11-12 02:23:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 293. [2023-11-12 02:23:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 256 states have (on average 1.3671875) internal successors, (350), 256 states have internal predecessors, (350), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-12 02:23:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 418 transitions. [2023-11-12 02:23:59,592 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 418 transitions. Word has length 150 [2023-11-12 02:23:59,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:59,593 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 418 transitions. [2023-11-12 02:23:59,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 418 transitions. [2023-11-12 02:23:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-12 02:23:59,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:59,595 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:59,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 02:23:59,596 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:59,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:59,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2077751303, now seen corresponding path program 1 times [2023-11-12 02:23:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:59,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207694310] [2023-11-12 02:23:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:23:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:23:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:23:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:23:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:23:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:23:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:23:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:23:59,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207694310] [2023-11-12 02:23:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207694310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:59,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:23:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792563595] [2023-11-12 02:23:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:59,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:23:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:23:59,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:23:59,753 INFO L87 Difference]: Start difference. First operand 293 states and 418 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:59,816 INFO L93 Difference]: Finished difference Result 502 states and 723 transitions. [2023-11-12 02:23:59,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:23:59,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2023-11-12 02:23:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:59,819 INFO L225 Difference]: With dead ends: 502 [2023-11-12 02:23:59,820 INFO L226 Difference]: Without dead ends: 313 [2023-11-12 02:23:59,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:23:59,821 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 20 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:59,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 323 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:23:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-11-12 02:23:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 295. [2023-11-12 02:23:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 258 states have (on average 1.3643410852713178) internal successors, (352), 258 states have internal predecessors, (352), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-12 02:23:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 420 transitions. [2023-11-12 02:23:59,869 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 420 transitions. Word has length 152 [2023-11-12 02:23:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:59,871 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 420 transitions. [2023-11-12 02:23:59,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:23:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 420 transitions. [2023-11-12 02:23:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-12 02:23:59,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:59,874 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:59,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 02:23:59,874 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:59,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash -155316636, now seen corresponding path program 1 times [2023-11-12 02:23:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:59,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034255381] [2023-11-12 02:23:59,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:59,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:24:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:24:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:24:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:24:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:24:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:24:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:24:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:24:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:24:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:24:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:24:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:24:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:24:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:24:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:24:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:24:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:24:00,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:00,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034255381] [2023-11-12 02:24:00,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034255381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:00,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:00,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:24:00,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608226040] [2023-11-12 02:24:00,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:00,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:24:00,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:00,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:24:00,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:24:00,728 INFO L87 Difference]: Start difference. First operand 295 states and 420 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:24:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:01,064 INFO L93 Difference]: Finished difference Result 491 states and 706 transitions. [2023-11-12 02:24:01,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:24:01,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2023-11-12 02:24:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:01,068 INFO L225 Difference]: With dead ends: 491 [2023-11-12 02:24:01,069 INFO L226 Difference]: Without dead ends: 300 [2023-11-12 02:24:01,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:24:01,071 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 257 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:01,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 401 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:24:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-12 02:24:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2023-11-12 02:24:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 260 states have (on average 1.3615384615384616) internal successors, (354), 260 states have internal predecessors, (354), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-12 02:24:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 422 transitions. [2023-11-12 02:24:01,130 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 422 transitions. Word has length 152 [2023-11-12 02:24:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:01,131 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 422 transitions. [2023-11-12 02:24:01,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-12 02:24:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 422 transitions. [2023-11-12 02:24:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-12 02:24:01,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:01,137 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:01,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 02:24:01,137 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:01,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:01,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1932171040, now seen corresponding path program 1 times [2023-11-12 02:24:01,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:01,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914868207] [2023-11-12 02:24:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:01,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:24:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:24:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:24:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:24:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:24:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:24:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:24:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:24:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:24:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:24:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:24:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:24:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:24:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:24:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:24:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:24:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-12 02:24:03,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:03,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914868207] [2023-11-12 02:24:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914868207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:03,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-12 02:24:03,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527910849] [2023-11-12 02:24:03,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:03,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 02:24:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:03,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 02:24:03,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:24:03,933 INFO L87 Difference]: Start difference. First operand 297 states and 422 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17)