./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1 --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 64bit --witnessprinter.graph.data.programhash 6f4e95dc8a7148512bd25af62180d765cf1bfe32acfdc3f607fe13496615f0bd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:42:35,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:42:35,150 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-12-02 11:42:35,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:42:35,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:42:35,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:42:35,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:42:35,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:42:35,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:42:35,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:42:35,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:42:35,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:42:35,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:42:35,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:42:35,173 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:42:35,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:42:35,174 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:42:35,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:42:35,175 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:42:35,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:42:35,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:42:35,176 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f4e95dc8a7148512bd25af62180d765cf1bfe32acfdc3f607fe13496615f0bd [2024-12-02 11:42:35,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:42:35,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:42:35,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:42:35,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:42:35,385 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:42:35,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c [2024-12-02 11:42:38,104 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/data/59ae023ea/6b18dc27ef1d4900aeca137f87560541/FLAG448498419 [2024-12-02 11:42:38,296 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:42:38,297 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c [2024-12-02 11:42:38,306 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/data/59ae023ea/6b18dc27ef1d4900aeca137f87560541/FLAG448498419 [2024-12-02 11:42:38,318 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/data/59ae023ea/6b18dc27ef1d4900aeca137f87560541 [2024-12-02 11:42:38,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:42:38,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:42:38,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:42:38,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:42:38,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:42:38,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:38,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6c6532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38, skipping insertion in model container [2024-12-02 11:42:38,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:38,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:42:38,484 WARN L250 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_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c[1173,1186] [2024-12-02 11:42:38,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:42:38,611 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:42:38,621 WARN L250 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_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c[1173,1186] [2024-12-02 11:42:38,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:42:38,704 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:42:38,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38 WrapperNode [2024-12-02 11:42:38,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:42:38,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:42:38,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:42:38,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:42:38,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:38,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:38,928 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1644 [2024-12-02 11:42:38,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:42:38,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:42:38,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:42:38,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:42:38,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:38,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:38,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:39,024 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 11:42:39,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:39,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:39,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:39,087 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:39,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:39,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:39,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:39,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:42:39,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:42:39,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:42:39,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:42:39,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (1/1) ... [2024-12-02 11:42:39,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:42:39,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:42:39,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:42:39,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:42:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:42:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 11:42:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:42:39,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:42:39,360 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:42:39,361 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:42:41,128 INFO L? ?]: Removed 857 outVars from TransFormulas that were not future-live. [2024-12-02 11:42:41,128 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:42:41,148 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:42:41,148 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-02 11:42:41,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:42:41 BoogieIcfgContainer [2024-12-02 11:42:41,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:42:41,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:42:41,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:42:41,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:42:41,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:42:38" (1/3) ... [2024-12-02 11:42:41,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf47e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:42:41, skipping insertion in model container [2024-12-02 11:42:41,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:38" (2/3) ... [2024-12-02 11:42:41,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf47e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:42:41, skipping insertion in model container [2024-12-02 11:42:41,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:42:41" (3/3) ... [2024-12-02 11:42:41,157 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.5.prop1-func-interl.c [2024-12-02 11:42:41,168 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:42:41,169 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.5.prop1-func-interl.c that has 1 procedures, 597 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 11:42:41,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:42:41,229 INFO L333 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, 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;@73139167, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:42:41,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 11:42:41,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 597 states, 595 states have (on average 1.5025210084033613) internal successors, (894), 596 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-02 11:42:41,240 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:41,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:41,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:41,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1368434867, now seen corresponding path program 1 times [2024-12-02 11:42:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:41,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751616895] [2024-12-02 11:42:41,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:41,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:41,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751616895] [2024-12-02 11:42:41,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751616895] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:41,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:41,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:42:41,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121002072] [2024-12-02 11:42:41,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:41,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:42:41,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:41,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:42:41,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:41,706 INFO L87 Difference]: Start difference. First operand has 597 states, 595 states have (on average 1.5025210084033613) internal successors, (894), 596 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:41,804 INFO L93 Difference]: Finished difference Result 1149 states and 1724 transitions. [2024-12-02 11:42:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:42:41,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-12-02 11:42:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:41,817 INFO L225 Difference]: With dead ends: 1149 [2024-12-02 11:42:41,817 INFO L226 Difference]: Without dead ends: 594 [2024-12-02 11:42:41,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:42:41,823 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 858 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:41,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1762 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:42:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-12-02 11:42:41,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2024-12-02 11:42:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.4991568296795952) internal successors, (889), 593 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 889 transitions. [2024-12-02 11:42:41,872 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 889 transitions. Word has length 59 [2024-12-02 11:42:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:41,873 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 889 transitions. [2024-12-02 11:42:41,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 889 transitions. [2024-12-02 11:42:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-02 11:42:41,874 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:41,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:41,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 11:42:41,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:41,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:41,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1453492137, now seen corresponding path program 1 times [2024-12-02 11:42:41,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:41,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100183354] [2024-12-02 11:42:41,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:41,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:42,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:42,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100183354] [2024-12-02 11:42:42,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100183354] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:42,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:42,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:42:42,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393071117] [2024-12-02 11:42:42,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:42,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:42:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:42,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:42:42,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:42,217 INFO L87 Difference]: Start difference. First operand 594 states and 889 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:42,244 INFO L93 Difference]: Finished difference Result 598 states and 893 transitions. [2024-12-02 11:42:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:42:42,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-12-02 11:42:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:42,247 INFO L225 Difference]: With dead ends: 598 [2024-12-02 11:42:42,247 INFO L226 Difference]: Without dead ends: 596 [2024-12-02 11:42:42,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:42,248 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:42,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2655 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:42:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-12-02 11:42:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2024-12-02 11:42:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.4974789915966387) internal successors, (891), 595 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 891 transitions. [2024-12-02 11:42:42,267 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 891 transitions. Word has length 60 [2024-12-02 11:42:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:42,268 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 891 transitions. [2024-12-02 11:42:42,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 891 transitions. [2024-12-02 11:42:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-02 11:42:42,269 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:42,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:42,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 11:42:42,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:42,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2110278823, now seen corresponding path program 1 times [2024-12-02 11:42:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:42,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631361529] [2024-12-02 11:42:42,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:42,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:42,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631361529] [2024-12-02 11:42:42,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631361529] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:42,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:42,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:42:42,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824670880] [2024-12-02 11:42:42,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:42,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:42:42,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:42,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:42:42,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:42,424 INFO L87 Difference]: Start difference. First operand 596 states and 891 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:42,457 INFO L93 Difference]: Finished difference Result 1152 states and 1723 transitions. [2024-12-02 11:42:42,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:42:42,457 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-12-02 11:42:42,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:42,460 INFO L225 Difference]: With dead ends: 1152 [2024-12-02 11:42:42,460 INFO L226 Difference]: Without dead ends: 598 [2024-12-02 11:42:42,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:42,461 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:42,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2651 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:42:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-12-02 11:42:42,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2024-12-02 11:42:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.4958123953098827) internal successors, (893), 597 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 893 transitions. [2024-12-02 11:42:42,472 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 893 transitions. Word has length 61 [2024-12-02 11:42:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:42,473 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 893 transitions. [2024-12-02 11:42:42,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 893 transitions. [2024-12-02 11:42:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-02 11:42:42,474 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:42,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:42,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 11:42:42,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:42,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash -103831486, now seen corresponding path program 1 times [2024-12-02 11:42:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:42,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507141102] [2024-12-02 11:42:42,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:42,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:42,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:42,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507141102] [2024-12-02 11:42:42,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507141102] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:42,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:42,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:42:42,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793946099] [2024-12-02 11:42:42,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:42,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:42:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:42,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:42:42,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:42,617 INFO L87 Difference]: Start difference. First operand 598 states and 893 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:42,666 INFO L93 Difference]: Finished difference Result 1156 states and 1727 transitions. [2024-12-02 11:42:42,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:42:42,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-12-02 11:42:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:42,668 INFO L225 Difference]: With dead ends: 1156 [2024-12-02 11:42:42,668 INFO L226 Difference]: Without dead ends: 600 [2024-12-02 11:42:42,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:42,670 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:42,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2645 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:42:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-12-02 11:42:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-12-02 11:42:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4941569282136895) internal successors, (895), 599 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 895 transitions. [2024-12-02 11:42:42,680 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 895 transitions. Word has length 62 [2024-12-02 11:42:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:42,680 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 895 transitions. [2024-12-02 11:42:42,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 895 transitions. [2024-12-02 11:42:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-02 11:42:42,681 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:42,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:42,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 11:42:42,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:42,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:42,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1985078414, now seen corresponding path program 1 times [2024-12-02 11:42:42,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:42,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157048835] [2024-12-02 11:42:42,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:42,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:42,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157048835] [2024-12-02 11:42:42,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157048835] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:42,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:42,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:42:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256220541] [2024-12-02 11:42:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:42,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:42:42,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:42,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:42:42,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:42:42,879 INFO L87 Difference]: Start difference. First operand 600 states and 895 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:42,930 INFO L93 Difference]: Finished difference Result 1162 states and 1734 transitions. [2024-12-02 11:42:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:42:42,930 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-12-02 11:42:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:42,932 INFO L225 Difference]: With dead ends: 1162 [2024-12-02 11:42:42,932 INFO L226 Difference]: Without dead ends: 604 [2024-12-02 11:42:42,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:42:42,933 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 4 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:42,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3515 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:42:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-12-02 11:42:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2024-12-02 11:42:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.4925124792013311) internal successors, (897), 601 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 897 transitions. [2024-12-02 11:42:42,942 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 897 transitions. Word has length 63 [2024-12-02 11:42:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:42,943 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 897 transitions. [2024-12-02 11:42:42,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 897 transitions. [2024-12-02 11:42:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 11:42:42,943 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:42,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:42,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 11:42:42,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:42,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1793926481, now seen corresponding path program 1 times [2024-12-02 11:42:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:42,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333930655] [2024-12-02 11:42:42,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:43,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:43,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333930655] [2024-12-02 11:42:43,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333930655] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:43,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:43,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:42:43,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853593852] [2024-12-02 11:42:43,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:43,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:42:43,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:43,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:42:43,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:42:43,096 INFO L87 Difference]: Start difference. First operand 602 states and 897 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:43,133 INFO L93 Difference]: Finished difference Result 1189 states and 1772 transitions. [2024-12-02 11:42:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:42:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-12-02 11:42:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:43,137 INFO L225 Difference]: With dead ends: 1189 [2024-12-02 11:42:43,137 INFO L226 Difference]: Without dead ends: 629 [2024-12-02 11:42:43,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:42:43,139 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 64 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 3476 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:43,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 3476 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:42:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-12-02 11:42:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2024-12-02 11:42:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.4904458598726114) internal successors, (936), 628 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 936 transitions. [2024-12-02 11:42:43,150 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 936 transitions. Word has length 64 [2024-12-02 11:42:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:43,150 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 936 transitions. [2024-12-02 11:42:43,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 936 transitions. [2024-12-02 11:42:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-02 11:42:43,151 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:43,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:43,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 11:42:43,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:43,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1882603606, now seen corresponding path program 1 times [2024-12-02 11:42:43,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:43,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488649117] [2024-12-02 11:42:43,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:43,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:43,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488649117] [2024-12-02 11:42:43,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488649117] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:43,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:43,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:42:43,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509139990] [2024-12-02 11:42:43,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:43,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:42:43,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:43,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:42:43,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:42:43,518 INFO L87 Difference]: Start difference. First operand 629 states and 936 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:43,714 INFO L93 Difference]: Finished difference Result 1196 states and 1785 transitions. [2024-12-02 11:42:43,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:42:43,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-12-02 11:42:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:43,717 INFO L225 Difference]: With dead ends: 1196 [2024-12-02 11:42:43,717 INFO L226 Difference]: Without dead ends: 636 [2024-12-02 11:42:43,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:42:43,718 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 863 mSDsluCounter, 2499 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:43,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 3339 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:42:43,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-12-02 11:42:43,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-12-02 11:42:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4873417721518987) internal successors, (940), 632 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 940 transitions. [2024-12-02 11:42:43,729 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 940 transitions. Word has length 64 [2024-12-02 11:42:43,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:43,729 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 940 transitions. [2024-12-02 11:42:43,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 940 transitions. [2024-12-02 11:42:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:42:43,730 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:43,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:43,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 11:42:43,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:43,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:43,730 INFO L85 PathProgramCache]: Analyzing trace with hash -353009811, now seen corresponding path program 1 times [2024-12-02 11:42:43,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:43,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696195058] [2024-12-02 11:42:43,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:43,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:43,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:43,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696195058] [2024-12-02 11:42:43,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696195058] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:43,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:43,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:42:43,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476128552] [2024-12-02 11:42:43,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:43,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:42:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:43,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:42:43,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:43,870 INFO L87 Difference]: Start difference. First operand 633 states and 940 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:43,972 INFO L93 Difference]: Finished difference Result 1203 states and 1789 transitions. [2024-12-02 11:42:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:42:43,973 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-12-02 11:42:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:43,974 INFO L225 Difference]: With dead ends: 1203 [2024-12-02 11:42:43,975 INFO L226 Difference]: Without dead ends: 636 [2024-12-02 11:42:43,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:42:43,976 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 847 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:43,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1690 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:42:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-12-02 11:42:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2024-12-02 11:42:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.48503937007874) internal successors, (943), 635 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 943 transitions. [2024-12-02 11:42:43,986 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 943 transitions. Word has length 65 [2024-12-02 11:42:43,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:43,986 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 943 transitions. [2024-12-02 11:42:43,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 943 transitions. [2024-12-02 11:42:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-02 11:42:43,986 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:43,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:43,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 11:42:43,987 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:43,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:43,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1064191121, now seen corresponding path program 1 times [2024-12-02 11:42:43,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:43,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617033483] [2024-12-02 11:42:43,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:43,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:44,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:44,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617033483] [2024-12-02 11:42:44,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617033483] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:44,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:44,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:42:44,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033246609] [2024-12-02 11:42:44,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:44,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:42:44,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:44,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:42:44,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:44,122 INFO L87 Difference]: Start difference. First operand 636 states and 943 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:44,158 INFO L93 Difference]: Finished difference Result 1202 states and 1784 transitions. [2024-12-02 11:42:44,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:42:44,160 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-12-02 11:42:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:44,161 INFO L225 Difference]: With dead ends: 1202 [2024-12-02 11:42:44,161 INFO L226 Difference]: Without dead ends: 635 [2024-12-02 11:42:44,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:42:44,163 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 844 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:44,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1749 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:42:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-12-02 11:42:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2024-12-02 11:42:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4842271293375395) internal successors, (941), 634 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 941 transitions. [2024-12-02 11:42:44,174 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 941 transitions. Word has length 65 [2024-12-02 11:42:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:44,174 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 941 transitions. [2024-12-02 11:42:44,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 941 transitions. [2024-12-02 11:42:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-02 11:42:44,174 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:44,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:44,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 11:42:44,175 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:44,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:44,175 INFO L85 PathProgramCache]: Analyzing trace with hash 348639918, now seen corresponding path program 1 times [2024-12-02 11:42:44,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:44,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822791760] [2024-12-02 11:42:44,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:44,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:44,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:44,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822791760] [2024-12-02 11:42:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822791760] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:44,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:42:44,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899045704] [2024-12-02 11:42:44,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:44,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:42:44,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:44,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:42:44,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:42:44,369 INFO L87 Difference]: Start difference. First operand 635 states and 941 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:44,479 INFO L93 Difference]: Finished difference Result 1205 states and 1787 transitions. [2024-12-02 11:42:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:42:44,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-12-02 11:42:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:44,483 INFO L225 Difference]: With dead ends: 1205 [2024-12-02 11:42:44,483 INFO L226 Difference]: Without dead ends: 639 [2024-12-02 11:42:44,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:42:44,484 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 9 mSDsluCounter, 3437 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4305 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:44,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4305 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:42:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-12-02 11:42:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 636. [2024-12-02 11:42:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.4834645669291338) internal successors, (942), 635 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 942 transitions. [2024-12-02 11:42:44,494 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 942 transitions. Word has length 66 [2024-12-02 11:42:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:44,494 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 942 transitions. [2024-12-02 11:42:44,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 942 transitions. [2024-12-02 11:42:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-02 11:42:44,495 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:44,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:44,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 11:42:44,495 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:44,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1969752466, now seen corresponding path program 1 times [2024-12-02 11:42:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:44,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544729484] [2024-12-02 11:42:44,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:44,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:44,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:44,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544729484] [2024-12-02 11:42:44,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544729484] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:44,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:44,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 11:42:44,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273916480] [2024-12-02 11:42:44,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:44,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:42:44,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:44,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:42:44,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:42:44,965 INFO L87 Difference]: Start difference. First operand 636 states and 942 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:45,206 INFO L93 Difference]: Finished difference Result 1214 states and 1798 transitions. [2024-12-02 11:42:45,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 11:42:45,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-12-02 11:42:45,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:45,208 INFO L225 Difference]: With dead ends: 1214 [2024-12-02 11:42:45,208 INFO L226 Difference]: Without dead ends: 647 [2024-12-02 11:42:45,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-12-02 11:42:45,209 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 870 mSDsluCounter, 5084 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 5943 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:45,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 5943 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:42:45,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-12-02 11:42:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 643. [2024-12-02 11:42:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.4781931464174456) internal successors, (949), 642 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 949 transitions. [2024-12-02 11:42:45,221 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 949 transitions. Word has length 66 [2024-12-02 11:42:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:45,221 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 949 transitions. [2024-12-02 11:42:45,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 949 transitions. [2024-12-02 11:42:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-02 11:42:45,221 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:45,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:45,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 11:42:45,222 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:45,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash 423924778, now seen corresponding path program 1 times [2024-12-02 11:42:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:45,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092787972] [2024-12-02 11:42:45,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:45,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:45,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:45,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092787972] [2024-12-02 11:42:45,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092787972] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:45,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:45,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 11:42:45,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79559373] [2024-12-02 11:42:45,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:45,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 11:42:45,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:45,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 11:42:45,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:42:45,626 INFO L87 Difference]: Start difference. First operand 643 states and 949 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:45,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:45,872 INFO L93 Difference]: Finished difference Result 1227 states and 1811 transitions. [2024-12-02 11:42:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 11:42:45,872 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-12-02 11:42:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:45,874 INFO L225 Difference]: With dead ends: 1227 [2024-12-02 11:42:45,874 INFO L226 Difference]: Without dead ends: 653 [2024-12-02 11:42:45,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-12-02 11:42:45,875 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 870 mSDsluCounter, 5102 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 5968 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:45,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 5968 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:42:45,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-12-02 11:42:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 645. [2024-12-02 11:42:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.4782608695652173) internal successors, (952), 644 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 952 transitions. [2024-12-02 11:42:45,885 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 952 transitions. Word has length 67 [2024-12-02 11:42:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:45,885 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 952 transitions. [2024-12-02 11:42:45,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 952 transitions. [2024-12-02 11:42:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 11:42:45,886 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:45,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:45,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 11:42:45,886 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:45,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:45,887 INFO L85 PathProgramCache]: Analyzing trace with hash 565617738, now seen corresponding path program 1 times [2024-12-02 11:42:45,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:45,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961848577] [2024-12-02 11:42:45,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:45,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:46,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:46,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961848577] [2024-12-02 11:42:46,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961848577] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:46,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:46,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 11:42:46,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617138467] [2024-12-02 11:42:46,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:46,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 11:42:46,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:46,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 11:42:46,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:42:46,116 INFO L87 Difference]: Start difference. First operand 645 states and 952 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:46,259 INFO L93 Difference]: Finished difference Result 1230 states and 1814 transitions. [2024-12-02 11:42:46,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:42:46,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-12-02 11:42:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:46,262 INFO L225 Difference]: With dead ends: 1230 [2024-12-02 11:42:46,262 INFO L226 Difference]: Without dead ends: 654 [2024-12-02 11:42:46,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:42:46,263 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 6 mSDsluCounter, 5138 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5998 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:46,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5998 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:42:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-12-02 11:42:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2024-12-02 11:42:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 1.4746543778801844) internal successors, (960), 651 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 960 transitions. [2024-12-02 11:42:46,274 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 960 transitions. Word has length 68 [2024-12-02 11:42:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:46,274 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 960 transitions. [2024-12-02 11:42:46,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 960 transitions. [2024-12-02 11:42:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-02 11:42:46,274 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:46,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:46,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 11:42:46,275 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:46,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1988327780, now seen corresponding path program 1 times [2024-12-02 11:42:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420555156] [2024-12-02 11:42:46,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:46,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:46,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:46,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420555156] [2024-12-02 11:42:46,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420555156] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:46,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:46,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:42:46,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368690124] [2024-12-02 11:42:46,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:46,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:42:46,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:46,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:42:46,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:42:46,475 INFO L87 Difference]: Start difference. First operand 652 states and 960 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:47,267 INFO L93 Difference]: Finished difference Result 1760 states and 2592 transitions. [2024-12-02 11:42:47,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:42:47,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-12-02 11:42:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:47,270 INFO L225 Difference]: With dead ends: 1760 [2024-12-02 11:42:47,270 INFO L226 Difference]: Without dead ends: 1177 [2024-12-02 11:42:47,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:42:47,271 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 797 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:47,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2569 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-12-02 11:42:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2024-12-02 11:42:47,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 702. [2024-12-02 11:42:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 1.4593437945791725) internal successors, (1023), 701 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1023 transitions. [2024-12-02 11:42:47,288 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1023 transitions. Word has length 68 [2024-12-02 11:42:47,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:47,288 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1023 transitions. [2024-12-02 11:42:47,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1023 transitions. [2024-12-02 11:42:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-02 11:42:47,289 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:47,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:47,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 11:42:47,289 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:47,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:47,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1189272367, now seen corresponding path program 1 times [2024-12-02 11:42:47,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:47,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508092500] [2024-12-02 11:42:47,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:47,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:47,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:47,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508092500] [2024-12-02 11:42:47,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508092500] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:47,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:47,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 11:42:47,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109317067] [2024-12-02 11:42:47,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:47,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 11:42:47,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:47,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 11:42:47,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:42:47,569 INFO L87 Difference]: Start difference. First operand 702 states and 1023 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:47,652 INFO L93 Difference]: Finished difference Result 1296 states and 1896 transitions. [2024-12-02 11:42:47,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:42:47,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-12-02 11:42:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:47,655 INFO L225 Difference]: With dead ends: 1296 [2024-12-02 11:42:47,655 INFO L226 Difference]: Without dead ends: 713 [2024-12-02 11:42:47,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:42:47,656 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 835 mSDsluCounter, 3484 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 4362 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:47,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 4362 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:42:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-12-02 11:42:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 709. [2024-12-02 11:42:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.4576271186440677) internal successors, (1032), 708 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1032 transitions. [2024-12-02 11:42:47,668 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1032 transitions. Word has length 69 [2024-12-02 11:42:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:47,669 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1032 transitions. [2024-12-02 11:42:47,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1032 transitions. [2024-12-02 11:42:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-02 11:42:47,669 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:47,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:47,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 11:42:47,670 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:47,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash 977059328, now seen corresponding path program 1 times [2024-12-02 11:42:47,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:47,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901597889] [2024-12-02 11:42:47,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:47,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:47,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:47,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901597889] [2024-12-02 11:42:47,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901597889] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:47,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:47,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 11:42:47,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350548246] [2024-12-02 11:42:47,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:47,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 11:42:47,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:47,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 11:42:47,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:42:47,958 INFO L87 Difference]: Start difference. First operand 709 states and 1032 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:48,304 INFO L93 Difference]: Finished difference Result 1331 states and 1949 transitions. [2024-12-02 11:42:48,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:42:48,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-12-02 11:42:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:48,307 INFO L225 Difference]: With dead ends: 1331 [2024-12-02 11:42:48,307 INFO L226 Difference]: Without dead ends: 725 [2024-12-02 11:42:48,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-12-02 11:42:48,308 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 845 mSDsluCounter, 4130 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:48,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 4965 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:42:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-12-02 11:42:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2024-12-02 11:42:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4530386740331491) internal successors, (1052), 724 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1052 transitions. [2024-12-02 11:42:48,326 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1052 transitions. Word has length 70 [2024-12-02 11:42:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:48,326 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1052 transitions. [2024-12-02 11:42:48,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1052 transitions. [2024-12-02 11:42:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 11:42:48,327 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:48,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:48,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 11:42:48,328 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:48,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1977496067, now seen corresponding path program 1 times [2024-12-02 11:42:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:48,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30021297] [2024-12-02 11:42:48,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:48,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:48,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30021297] [2024-12-02 11:42:48,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30021297] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:48,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:48,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 11:42:48,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189283387] [2024-12-02 11:42:48,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:48,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 11:42:48,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:48,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 11:42:48,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:42:48,619 INFO L87 Difference]: Start difference. First operand 725 states and 1052 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:48,929 INFO L93 Difference]: Finished difference Result 1359 states and 1976 transitions. [2024-12-02 11:42:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:42:48,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-12-02 11:42:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:48,932 INFO L225 Difference]: With dead ends: 1359 [2024-12-02 11:42:48,932 INFO L226 Difference]: Without dead ends: 735 [2024-12-02 11:42:48,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-12-02 11:42:48,933 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 873 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:48,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 4978 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:42:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-12-02 11:42:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 728. [2024-12-02 11:42:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.4497936726272351) internal successors, (1054), 727 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1054 transitions. [2024-12-02 11:42:48,943 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1054 transitions. Word has length 71 [2024-12-02 11:42:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:48,943 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1054 transitions. [2024-12-02 11:42:48,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1054 transitions. [2024-12-02 11:42:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 11:42:48,944 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:48,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:48,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 11:42:48,944 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:48,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1277851670, now seen corresponding path program 1 times [2024-12-02 11:42:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:48,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376697515] [2024-12-02 11:42:48,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:49,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:49,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376697515] [2024-12-02 11:42:49,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376697515] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:49,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:49,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 11:42:49,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033851582] [2024-12-02 11:42:49,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:49,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 11:42:49,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:49,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 11:42:49,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:42:49,126 INFO L87 Difference]: Start difference. First operand 728 states and 1054 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:49,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:49,258 INFO L93 Difference]: Finished difference Result 1344 states and 1956 transitions. [2024-12-02 11:42:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 11:42:49,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-12-02 11:42:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:49,260 INFO L225 Difference]: With dead ends: 1344 [2024-12-02 11:42:49,260 INFO L226 Difference]: Without dead ends: 735 [2024-12-02 11:42:49,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-12-02 11:42:49,261 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 5 mSDsluCounter, 5148 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6010 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:49,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6010 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:42:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-12-02 11:42:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 718. [2024-12-02 11:42:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4560669456066946) internal successors, (1044), 717 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1044 transitions. [2024-12-02 11:42:49,271 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1044 transitions. Word has length 71 [2024-12-02 11:42:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:49,272 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1044 transitions. [2024-12-02 11:42:49,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1044 transitions. [2024-12-02 11:42:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-02 11:42:49,272 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:49,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:49,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 11:42:49,273 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:49,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:49,273 INFO L85 PathProgramCache]: Analyzing trace with hash -668387598, now seen corresponding path program 1 times [2024-12-02 11:42:49,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:49,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696347475] [2024-12-02 11:42:49,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:49,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:49,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:49,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696347475] [2024-12-02 11:42:49,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696347475] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:49,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:49,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 11:42:49,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504486958] [2024-12-02 11:42:49,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:49,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 11:42:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:49,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 11:42:49,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:42:49,548 INFO L87 Difference]: Start difference. First operand 718 states and 1044 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:49,764 INFO L93 Difference]: Finished difference Result 1323 states and 1932 transitions. [2024-12-02 11:42:49,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:42:49,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-12-02 11:42:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:49,767 INFO L225 Difference]: With dead ends: 1323 [2024-12-02 11:42:49,767 INFO L226 Difference]: Without dead ends: 729 [2024-12-02 11:42:49,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-12-02 11:42:49,768 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 826 mSDsluCounter, 3356 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 4206 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:49,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 4206 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:42:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-12-02 11:42:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 718. [2024-12-02 11:42:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4560669456066946) internal successors, (1044), 717 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1044 transitions. [2024-12-02 11:42:49,779 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1044 transitions. Word has length 71 [2024-12-02 11:42:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:49,779 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1044 transitions. [2024-12-02 11:42:49,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1044 transitions. [2024-12-02 11:42:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-02 11:42:49,780 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:49,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:49,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 11:42:49,780 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:49,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:49,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1572057892, now seen corresponding path program 1 times [2024-12-02 11:42:49,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:49,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137581499] [2024-12-02 11:42:49,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:49,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:49,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137581499] [2024-12-02 11:42:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137581499] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:49,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:49,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:42:49,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2538942] [2024-12-02 11:42:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:49,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:42:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:49,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:42:49,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:49,898 INFO L87 Difference]: Start difference. First operand 718 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:49,981 INFO L93 Difference]: Finished difference Result 1329 states and 1941 transitions. [2024-12-02 11:42:49,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:42:49,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-12-02 11:42:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:49,983 INFO L225 Difference]: With dead ends: 1329 [2024-12-02 11:42:49,983 INFO L226 Difference]: Without dead ends: 718 [2024-12-02 11:42:49,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:49,984 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 879 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:49,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1680 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:42:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-12-02 11:42:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2024-12-02 11:42:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4532775453277544) internal successors, (1042), 717 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1042 transitions. [2024-12-02 11:42:49,998 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1042 transitions. Word has length 72 [2024-12-02 11:42:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:49,998 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1042 transitions. [2024-12-02 11:42:49,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1042 transitions. [2024-12-02 11:42:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 11:42:49,999 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:49,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:49,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-02 11:42:49,999 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:49,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash 410843117, now seen corresponding path program 1 times [2024-12-02 11:42:49,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:49,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380452733] [2024-12-02 11:42:49,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:50,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:50,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:50,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380452733] [2024-12-02 11:42:50,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380452733] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:50,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:50,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 11:42:50,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168394432] [2024-12-02 11:42:50,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:50,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 11:42:50,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:50,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 11:42:50,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:42:50,219 INFO L87 Difference]: Start difference. First operand 718 states and 1042 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:50,395 INFO L93 Difference]: Finished difference Result 1336 states and 1946 transitions. [2024-12-02 11:42:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:42:50,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-12-02 11:42:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:50,397 INFO L225 Difference]: With dead ends: 1336 [2024-12-02 11:42:50,397 INFO L226 Difference]: Without dead ends: 716 [2024-12-02 11:42:50,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:42:50,399 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 1693 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:50,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 3332 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:42:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-12-02 11:42:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 715. [2024-12-02 11:42:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.4509803921568627) internal successors, (1036), 714 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1036 transitions. [2024-12-02 11:42:50,413 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1036 transitions. Word has length 73 [2024-12-02 11:42:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:50,413 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1036 transitions. [2024-12-02 11:42:50,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1036 transitions. [2024-12-02 11:42:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 11:42:50,414 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:50,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:50,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 11:42:50,414 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:50,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash 228712370, now seen corresponding path program 1 times [2024-12-02 11:42:50,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:50,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436333360] [2024-12-02 11:42:50,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:50,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:50,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:42:50,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436333360] [2024-12-02 11:42:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436333360] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:50,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:50,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:42:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886427768] [2024-12-02 11:42:50,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:50,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:42:50,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:42:50,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:42:50,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:50,532 INFO L87 Difference]: Start difference. First operand 715 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:50,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:50,610 INFO L93 Difference]: Finished difference Result 1319 states and 1921 transitions. [2024-12-02 11:42:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:42:50,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-12-02 11:42:50,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:50,613 INFO L225 Difference]: With dead ends: 1319 [2024-12-02 11:42:50,613 INFO L226 Difference]: Without dead ends: 717 [2024-12-02 11:42:50,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:42:50,615 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 826 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:50,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1697 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:42:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-12-02 11:42:50,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 707. [2024-12-02 11:42:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.453257790368272) internal successors, (1026), 706 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1026 transitions. [2024-12-02 11:42:50,629 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1026 transitions. Word has length 73 [2024-12-02 11:42:50,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:50,629 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1026 transitions. [2024-12-02 11:42:50,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1026 transitions. [2024-12-02 11:42:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 11:42:50,630 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:50,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:50,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-02 11:42:50,630 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:50,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:50,631 INFO L85 PathProgramCache]: Analyzing trace with hash 420694957, now seen corresponding path program 1 times [2024-12-02 11:42:50,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:42:50,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038307129] [2024-12-02 11:42:50,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:50,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:42:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:42:50,666 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:42:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:42:50,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 11:42:50,721 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:42:50,721 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-02 11:42:50,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-02 11:42:50,725 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:50,767 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 11:42:50,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:42:50 BoogieIcfgContainer [2024-12-02 11:42:50,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 11:42:50,770 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 11:42:50,770 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 11:42:50,770 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 11:42:50,771 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:42:41" (3/4) ... [2024-12-02 11:42:50,772 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 11:42:50,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 11:42:50,773 INFO L158 Benchmark]: Toolchain (without parser) took 12451.47ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 92.3MB in the beginning and 333.9MB in the end (delta: -241.6MB). Peak memory consumption was 149.2MB. Max. memory is 16.1GB. [2024-12-02 11:42:50,773 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 72.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:42:50,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.04ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 65.5MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 11:42:50,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 222.54ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 69.7MB in the end (delta: -4.2MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-12-02 11:42:50,774 INFO L158 Benchmark]: Boogie Preprocessor took 233.48ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 53.1MB in the end (delta: 16.7MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-12-02 11:42:50,775 INFO L158 Benchmark]: RCFGBuilder took 1986.13ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 53.1MB in the beginning and 190.5MB in the end (delta: -137.4MB). Peak memory consumption was 140.9MB. Max. memory is 16.1GB. [2024-12-02 11:42:50,775 INFO L158 Benchmark]: TraceAbstraction took 9618.88ms. Allocated memory was 285.2MB in the beginning and 503.3MB in the end (delta: 218.1MB). Free memory was 190.5MB in the beginning and 334.0MB in the end (delta: -143.5MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2024-12-02 11:42:50,775 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 503.3MB. Free memory was 334.0MB in the beginning and 333.9MB in the end (delta: 35.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 11:42:50,777 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 72.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.04ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 65.5MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 222.54ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 69.7MB in the end (delta: -4.2MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 233.48ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 53.1MB in the end (delta: 16.7MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1986.13ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 53.1MB in the beginning and 190.5MB in the end (delta: -137.4MB). Peak memory consumption was 140.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9618.88ms. Allocated memory was 285.2MB in the beginning and 503.3MB in the end (delta: 218.1MB). Free memory was 190.5MB in the beginning and 334.0MB in the end (delta: -143.5MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 503.3MB. Free memory was 334.0MB in the beginning and 333.9MB in the end (delta: 35.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 109, overapproximation of bitwiseAnd at line 107, overapproximation of bitwiseAnd at line 111, overapproximation of bitwiseAnd at line 116, overapproximation of bitwiseAnd at line 110. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 849; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 500; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=849, var_28=1, var_30=0, var_32=16, var_5=0, var_79=500] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [input_37=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [input_37=0, input_38=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_79=500] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_30=0, var_32=16, var_79=500] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_79=500] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_79=500] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=500] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=500] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=500] [L107] EXPR var_33_arg_0 | ~mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_79=500] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_79=500] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=500] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=500] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33=849, var_33_arg_1=16, var_79=500] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=500] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=500] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33=849, var_33_arg_1=16, var_34=1, var_35_arg_0=-1, var_79=500] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33=849, var_33_arg_1=16, var_34=1, var_79=500] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33=849, var_33_arg_1=16, var_35_arg_0=1, var_35_arg_1=1, var_79=500] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33=849, var_33_arg_1=16, var_79=500] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=849, var_28=1, var_29=1, var_30=0, var_32=16, var_33=849, var_33_arg_1=16, var_79=500] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 597 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12814 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12814 mSDsluCounter, 79495 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60715 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3405 IncrementalHoareTripleChecker+Invalid, 3428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 18780 mSDtfsCounter, 3405 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=728occurred in iteration=17, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 547 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1541 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1446 ConstructedInterpolants, 0 QuantifiedInterpolants, 4939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-12-02 11:42:50,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1 --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 64bit --witnessprinter.graph.data.programhash 6f4e95dc8a7148512bd25af62180d765cf1bfe32acfdc3f607fe13496615f0bd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:42:52,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:42:52,804 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-12-02 11:42:52,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:42:52,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:42:52,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:42:52,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:42:52,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:42:52,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:42:52,834 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:42:52,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:42:52,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:42:52,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:42:52,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:42:52,834 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:42:52,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:42:52,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:42:52,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:42:52,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:42:52,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:42:52,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:42:52,835 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 11:42:52,835 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 11:42:52,835 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 11:42:52,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:42:52,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:42:52,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:42:52,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:42:52,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:42:52,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:42:52,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:42:52,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:42:52,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:42:52,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:42:52,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:42:52,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:42:52,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:42:52,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:42:52,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:42:52,837 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:42:52,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:42:52,837 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 11:42:52,837 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 11:42:52,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:42:52,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:42:52,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:42:52,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:42:52,837 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f4e95dc8a7148512bd25af62180d765cf1bfe32acfdc3f607fe13496615f0bd [2024-12-02 11:42:53,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:42:53,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:42:53,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:42:53,081 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:42:53,082 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:42:53,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c [2024-12-02 11:42:55,733 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/data/54161d888/15cadc58c8e14ae1a82cc04143107e11/FLAG74a6d866e [2024-12-02 11:42:55,935 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:42:55,936 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c [2024-12-02 11:42:55,946 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/data/54161d888/15cadc58c8e14ae1a82cc04143107e11/FLAG74a6d866e [2024-12-02 11:42:56,283 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/data/54161d888/15cadc58c8e14ae1a82cc04143107e11 [2024-12-02 11:42:56,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:42:56,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:42:56,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:42:56,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:42:56,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:42:56,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61098a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56, skipping insertion in model container [2024-12-02 11:42:56,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:42:56,437 WARN L250 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_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c[1173,1186] [2024-12-02 11:42:56,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:42:56,530 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:42:56,540 WARN L250 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_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.5.prop1-func-interl.c[1173,1186] [2024-12-02 11:42:56,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:42:56,612 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:42:56,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56 WrapperNode [2024-12-02 11:42:56,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:42:56,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:42:56,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:42:56,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:42:56,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,661 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 452 [2024-12-02 11:42:56,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:42:56,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:42:56,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:42:56,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:42:56,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,696 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-12-02 11:42:56,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,708 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:42:56,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:42:56,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:42:56,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:42:56,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (1/1) ... [2024-12-02 11:42:56,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:42:56,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:42:56,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:42:56,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:42:56,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:42:56,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 11:42:56,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:42:56,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:42:56,908 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:42:56,910 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:42:57,269 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-12-02 11:42:57,269 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:42:57,275 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:42:57,275 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-02 11:42:57,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:42:57 BoogieIcfgContainer [2024-12-02 11:42:57,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:42:57,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:42:57,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:42:57,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:42:57,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:42:56" (1/3) ... [2024-12-02 11:42:57,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f47848d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:42:57, skipping insertion in model container [2024-12-02 11:42:57,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:42:56" (2/3) ... [2024-12-02 11:42:57,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f47848d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:42:57, skipping insertion in model container [2024-12-02 11:42:57,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:42:57" (3/3) ... [2024-12-02 11:42:57,283 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.5.prop1-func-interl.c [2024-12-02 11:42:57,294 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:42:57,295 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.5.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-12-02 11:42:57,329 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:42:57,338 INFO L333 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, 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;@63067371, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:42:57,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 11:42:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:57,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-02 11:42:57,346 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:57,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-12-02 11:42:57,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-12-02 11:42:57,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:42:57,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378590329] [2024-12-02 11:42:57,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:57,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:42:57,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:42:57,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:42:57,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 11:42:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:57,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-12-02 11:42:57,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:42:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:42:57,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 11:42:57,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:42:57,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378590329] [2024-12-02 11:42:57,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378590329] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:42:57,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:42:57,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:42:57,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884724602] [2024-12-02 11:42:57,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:42:57,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:42:57,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:42:57,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:42:57,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:57,890 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:42:57,937 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-12-02 11:42:57,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:42:57,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-12-02 11:42:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:42:57,944 INFO L225 Difference]: With dead ends: 17 [2024-12-02 11:42:57,944 INFO L226 Difference]: Without dead ends: 9 [2024-12-02 11:42:57,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:42:57,948 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:42:57,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:42:57,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-12-02 11:42:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-12-02 11:42:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-12-02 11:42:57,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-12-02 11:42:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:42:57,970 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-12-02 11:42:57,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:42:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-12-02 11:42:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-02 11:42:57,970 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:42:57,971 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-12-02 11:42:57,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 11:42:58,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:42:58,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 11:42:58,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:42:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-12-02 11:42:58,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 11:42:58,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1714068985] [2024-12-02 11:42:58,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:42:58,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:42:58,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:42:58,174 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 11:42:58,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 11:42:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:42:58,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-12-02 11:42:58,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 11:43:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:43:11,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 11:43:30,349 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 (_ bv255 32))))) (.cse10 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_17~0#1|))) (let ((.cse119 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_4~0#1| |c_ULTIMATE.start_main_~var_32~0#1|))) (.cse121 (bvnot |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse118 ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_28~0#1|)) (.cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse22 .cse10)))) (.cse74 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 (_ bv254 32))))) (.cse24 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|))) (let ((.cse3 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse249 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse242 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse230 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse232 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse236 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse238 ((_ zero_extend 24) .cse249))) (let ((.cse237 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse238))))))) (.cse241 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse236))))))) (.cse234 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse232))))))) (.cse233 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse230))))))) (.cse240 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse242))))))) (.cse231 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse235 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse239 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse243 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse224 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse241 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse242 .cse243))))))) (.cse225 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse238 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse239 .cse240)))))))) (let ((.cse222 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse236 .cse24))) .cse237)))) (.cse223 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse224 .cse225))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse222 .cse223))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse224 .cse225)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse226 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse234 .cse235))))))) (.cse227 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse231 .cse232))) .cse233))))) (let ((.cse228 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse230 .cse10))))))) (.cse229 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse226 .cse227))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse226 .cse227))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse228 .cse229))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse228 .cse229))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse222 .cse223)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse246 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse232 .cse230)))))))) (let ((.cse245 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse242 .cse246))))) (let ((.cse244 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse236 .cse245))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse244 .cse238))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse236 .cse245))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse242 .cse246))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse232 .cse230))) (_ bv0 32))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse244 .cse238))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse237 .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse241 .cse243))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse234 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse235 .cse74)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse231 .cse233))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse240 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse239 .cse74)))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse247 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse239 .cse243))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse239 .cse243))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse247 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse248 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse231 .cse235))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse248 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse231 .cse235)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse248 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse247 .cse24)))))))))))))))))))))))))))))) (_ bv1 32)))))) (_ bv0 8)) (= (_ bv0 8) .cse249))))) (.cse125 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse220 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|)))) (.cse221 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse198 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse204 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse196 ((_ zero_extend 24) .cse221)) (.cse201 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse200 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse202 ((_ zero_extend 24) .cse220))) (let ((.cse208 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse202))))))) (.cse209 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse200))))))) (.cse195 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse194 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse210 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse201))))))) (.cse206 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse196))))))) (.cse190 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse211 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse204))))))) (.cse207 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse198))))))) (.cse191 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse192 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse190 .cse191))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse190 .cse191))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse192 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse193 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse194 .cse195))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse193 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse194 .cse195)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse193 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse192 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse203 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse200 .cse201))))) (let ((.cse205 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse202 .cse203))))) (let ((.cse199 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse204 .cse205))))) (let ((.cse197 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse198 .cse199))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse196 .cse197))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse198 .cse199))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse200 .cse201))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse202 .cse203)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse204 .cse205)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse206 .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse207 .cse191))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse208))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse209 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse195 .cse74)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse194 .cse210))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse211 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse190 .cse74))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse196 .cse197)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse218 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse207 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse204 .cse191))))))) (.cse219 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse196 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse190 .cse211)))))))) (let ((.cse216 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse198 .cse24))) .cse206)))) (.cse217 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse218 .cse219))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse214 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse194 .cse200))) .cse210)))) (.cse215 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse202 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse209 .cse195)))))))) (let ((.cse212 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse214 .cse215)))) (.cse213 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse201 .cse10))) .cse208))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse212 .cse213))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse214 .cse215))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse212 .cse213))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse216 .cse217))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse218 .cse219))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse216 .cse217))))))))))))))))))))))))))))))))) (_ bv0 8)) (= (_ bv0 8) .cse220) (= (_ bv0 8) .cse221))))) (.cse1 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse189 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse118))) .cse118))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse119 (bvashr (bvor .cse189 .cse121) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse189) (_ bv0 32)))))) (.cse127 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse157 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|)))) (.cse188 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) .cse157) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse176 ((_ zero_extend 24) .cse188)) (.cse164 ((_ zero_extend 24) .cse157)) (.cse162 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse168 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse180 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse174 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse179 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse174))))))) (.cse178 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse180))))))) (.cse165 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse168))))))) (.cse169 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse162))))))) (.cse163 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse164))))))) (.cse175 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse176))))))) (.cse167 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse166 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse177 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse181 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse172 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse179 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse180 .cse181))))))) (.cse173 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse176 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse177 .cse178)))))))) (let ((.cse170 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse174 .cse24))) .cse175)))) (.cse171 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse172 .cse173))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse160 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse167 .cse168))) .cse169)))) (.cse161 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse164 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse165 .cse166)))))))) (let ((.cse158 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse160 .cse161)))) (.cse159 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse162 .cse10))) .cse163))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse158 .cse159))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse160 .cse161))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse158 .cse159))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse170 .cse171))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse172 .cse173))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse170 .cse171)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse184 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse168 .cse162))))) (let ((.cse185 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse164 .cse184))))) (let ((.cse183 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse180 .cse185))))) (let ((.cse182 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse174 .cse183))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse176 .cse182))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse174 .cse183))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse168 .cse162))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse164 .cse184)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse180 .cse185)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse176 .cse182))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse179 .cse181))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse177 .cse22))) .cse178))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse166 .cse22))) .cse165))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse167 .cse169)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse163)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse175 .cse24)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse186 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse177 .cse181))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse177 .cse181))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse186 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse187 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse167 .cse166))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse187 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse167 .cse166)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse187 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse186 .cse24)))))))))))))))))))))))))))))))))))) (= (_ bv0 8) .cse188))))) (.cse0 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse129 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|))))) (or (= (_ bv0 8) .cse129) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse146 ((_ zero_extend 24) .cse129)) (.cse138 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse140 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse150 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse144 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse149 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse144))))))) (.cse151 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse147 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse148 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse150))))))) (.cse143 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse142 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse140))))))) (.cse139 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse141 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse138))))))) (.cse145 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse146)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse132 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse149 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse150 .cse151))))))) (.cse133 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse146 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse147 .cse148)))))))) (let ((.cse130 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse144 .cse24))) .cse145)))) (.cse131 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse132 .cse133))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse130 .cse131))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse132 .cse133)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse134 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse142 .cse143))))))) (.cse135 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse139 .cse140))) .cse141))))) (let ((.cse136 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse138 .cse10))))))) (.cse137 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse134 .cse135))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse134 .cse135))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse136 .cse137))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse136 .cse137))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse130 .cse131)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse152 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse147 .cse151))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse147 .cse151))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse152 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse153 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse139 .cse143))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse153 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse139 .cse143)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse153 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse152 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse156 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse140 .cse138)))))))) (let ((.cse155 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse150 .cse156))))) (let ((.cse154 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse144 .cse155))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse149 .cse151))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse147 .cse22))) .cse148))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse143 .cse22))) .cse142))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse139 .cse141)))))) .cse62))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse145 .cse24)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse154 .cse146)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse154 .cse146))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse144 .cse155))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse150 .cse156))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse140 .cse138))) (_ bv0 32))))))))))))))))))))))))))))))))))))))))))))) .cse4))) (_ bv1 32))))))))))) (.cse2 (forall ((|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))))) (.cse126 (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16)) (|ULTIMATE.start_main_~state_10~0#1| (_ BitVec 16))) (let ((.cse128 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_10~0#1|))) .cse118))) .cse118))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand (bvashr (bvand .cse128 |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_32~0#1|) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|))) (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse128) (_ bv0 32)))))))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse1 .cse2) (or (forall ((|v_ULTIMATE.start_main_#t~nondet14#1_10| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet14#1_10|)))))) (let ((.cse38 (let ((.cse123 (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor .cse118 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_6~0#1|) .cse118)))))))))) .cse118))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse122 (bvor .cse123 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse122) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~var_27~0#1|)) (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse122)))))) (forall ((|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse124 (bvor .cse123 ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse124)) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvor .cse119 (bvashr (bvor .cse121 .cse124) |c_ULTIMATE.start_main_~var_32~0#1|))) |c_ULTIMATE.start_main_~var_27~0#1|)))))))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse22 .cse24)))) (.cse37 (and (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse117 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse118))) .cse118))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse117))) (not (= |c_ULTIMATE.start_main_~var_27~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_4~0#1| .cse117) |c_ULTIMATE.start_main_~var_32~0#1|))))))) (forall ((|ULTIMATE.start_main_~state_8~0#1| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_31_arg_1~0#1_10| (_ BitVec 16))) (let ((.cse120 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) (bvxor ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~state_8~0#1|))))) .cse118))) .cse118))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_31_arg_1~0#1_10|)))) (or (not (= (bvand (bvor .cse119 (bvashr (bvor .cse120 .cse121) |c_ULTIMATE.start_main_~var_32~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|) |c_ULTIMATE.start_main_~var_27~0#1|)) (= (_ bv0 32) (bvand |c_ULTIMATE.start_main_~msb_SORT_4~0#1| .cse120)))))))) (and (or (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse36 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse12 ((_ zero_extend 24) .cse36)) (.cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse23))))))) (.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse26))))))) (.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse16))))))) (.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse9))))))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse12)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse29))))))) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse27)))))))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse18 .cse19)))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse23 .cse24)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse16))) .cse17)))) (.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 .cse14)))))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse7 .cse8)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 .cse10))) .cse11))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse5 .cse6))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse8))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse6))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse21))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse20 .cse21)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse28 .cse27))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse27))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse14))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse31 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse14)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse31 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse30 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse16 .cse9))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 .cse34))))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse35))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse23 .cse32)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse27))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse22))) .cse29))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 .cse22))) .cse13))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse17)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse11)))))))))))) .cse33)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse32))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse9))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse34)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse35)))))))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))))))))))))))))))))) .cse4))) (= (_ bv0 8) .cse36)))) .cse37) (or .cse38 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse47 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse49 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse55 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse53 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse54 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse53))))))) (.cse56 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse58 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse55))))))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse49))))))) (.cse48 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse50 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse47)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse58))))))) (.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse54 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse55 .cse56)))))))) (let ((.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse41 .cse42)))) (.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse53 .cse24)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse39 .cse40))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse42))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse39 .cse40)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 .cse52))))))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 .cse49))) .cse50))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse47 .cse10))))))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse43 .cse44))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse43 .cse44))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse46))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse45 .cse46)))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse57 .cse56))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse59 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse60 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 .cse52))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse60 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 .cse52)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse60 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse59 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse63 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse49 .cse47)))))))) (let ((.cse61 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse55 .cse63))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse53 .cse61))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse54 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse22))) .cse58))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse52 .cse22))) .cse51))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse48 .cse50)))))) .cse62))))))))) .cse33)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse53 .cse61))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse55 .cse63))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse49 .cse47))) (_ bv0 32)))))))))))))))))))))))))))))))))))))))))))) .cse4))) (_ bv1 32)))))))) .cse2) (or .cse38 (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse77 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse70 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|)) (.cse79 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse80 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|))) (let ((.cse68 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse75 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse80))))))) (.cse73 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse79))))))) (.cse69 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse70))))))) (.cse65 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|)) (.cse64 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse77)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse66 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse64 .cse65))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse64 .cse65))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse66 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse67 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse68 .cse69))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse67 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse68 .cse69)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse67 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse66 .cse24))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse78 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse79 .cse80)))))))) (let ((.cse71 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse77 .cse78))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse70 .cse71))) (_ bv0 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse72 .cse65))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse73 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse69 .cse74)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse68 .cse75))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse64 .cse74)))))))))))) .cse33)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse70 .cse71))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse77 .cse78))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse79 .cse80))) (_ bv0 32))))))))))))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse83 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse64 .cse76))))))) (.cse84 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse72 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse77 .cse65)))))))) (let ((.cse81 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse83 .cse84)))) (.cse82 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse70 .cse24)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse81 .cse82))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse83 .cse84))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse81 .cse82)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse85 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse73 .cse69))))))) (.cse86 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse68 .cse79))) .cse75))))) (let ((.cse87 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse80 .cse10))))))) (.cse88 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse85 .cse86))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse85 .cse86))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse87 .cse88))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse87 .cse88))))))))))))))))))))))))))))))))))))))))))) .cse2) (or (forall ((|ULTIMATE.start_main_~input_43~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_25~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_48~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_21~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet15#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~input_57~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_52~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_15~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_19~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_13~0#1| (_ BitVec 8))) (let ((.cse89 ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet15#1_10|))))) (or (= (_ bv0 8) .cse89) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_25~0#1|))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse108 ((_ zero_extend 24) |ULTIMATE.start_main_~input_57~0#1|)) (.cse94 ((_ zero_extend 24) |ULTIMATE.start_main_~input_43~0#1|)) (.cse100 ((_ zero_extend 24) |ULTIMATE.start_main_~input_48~0#1|)) (.cse96 ((_ zero_extend 24) .cse89)) (.cse106 ((_ zero_extend 24) |ULTIMATE.start_main_~input_52~0#1|))) (let ((.cse107 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse106))))))) (.cse95 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse96))))))) (.cse97 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse100))))))) (.cse101 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse94))))))) (.cse111 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse108))))))) (.cse99 ((_ zero_extend 24) |ULTIMATE.start_main_~state_15~0#1|)) (.cse98 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_13~0#1|)))) .cse4)))) (.cse110 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_19~0#1|)))))))) (.cse109 ((_ zero_extend 24) |ULTIMATE.start_main_~state_21~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse102 ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse110 .cse111))))))) (.cse103 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse107 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse108 .cse109)))))))) (let ((.cse104 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse102 .cse103)))) (.cse105 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse106 .cse24)))))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse92 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse99 .cse100))) .cse101)))) (.cse93 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse96 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse97 .cse98)))))))) (let ((.cse90 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse92 .cse93)))) (.cse91 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse94 .cse10))) .cse95))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse90 .cse91))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse92 .cse93))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse90 .cse91))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse102 .cse103))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse104 .cse105))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse104 .cse105)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse113 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse100 .cse94))))) (let ((.cse114 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse96 .cse113))))) (let ((.cse112 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse108 .cse114))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse106 .cse112))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse100 .cse94))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse96 .cse113)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse108 .cse114)))))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse107 .cse109))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse10 .cse95))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse97 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse98 .cse74)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse99 .cse101))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse111 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse110 .cse74)))))))))))) .cse33))) ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse106 .cse112))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse115 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse110 .cse109))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse110 .cse109))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse115 .cse24))))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse116 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse99 .cse98))))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse116 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse99 .cse98)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse116 .cse10)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse115 .cse24))))))))))))))))))))) .cse4)))))))))))))))))) .cse37)))) (or .cse1 .cse125) (or .cse3 .cse2 .cse126) (or .cse125 .cse126) (or .cse127 .cse126) (or .cse1 .cse127) (or .cse0 .cse2 .cse126)))))) is different from false [2024-12-02 11:43:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-12-02 11:43:30,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 11:43:30,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714068985] [2024-12-02 11:43:30,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714068985] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 11:43:30,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 11:43:30,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-12-02 11:43:30,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672040391] [2024-12-02 11:43:30,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 11:43:30,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 11:43:30,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 11:43:30,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 11:43:30,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=81, Unknown=3, NotChecked=18, Total=132 [2024-12-02 11:43:30,751 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 11:43:33,253 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-12-02 11:43:33,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-12-02 11:43:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 11:43:33,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=30, Invalid=81, Unknown=3, NotChecked=18, Total=132 [2024-12-02 11:43:33,254 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:43:33,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:43:33,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 11:43:33,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 11:43:33,456 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2024-12-02 11:43:33,460 INFO L158 Benchmark]: Toolchain (without parser) took 37174.31ms. Allocated memory was 92.3MB in the beginning and 293.6MB in the end (delta: 201.3MB). Free memory was 69.4MB in the beginning and 154.4MB in the end (delta: -84.9MB). Peak memory consumption was 178.4MB. Max. memory is 16.1GB. [2024-12-02 11:43:33,460 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:43:33,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.68ms. Allocated memory is still 92.3MB. Free memory was 69.2MB in the beginning and 47.4MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 11:43:33,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.38ms. Allocated memory is still 92.3MB. Free memory was 47.4MB in the beginning and 43.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:43:33,461 INFO L158 Benchmark]: Boogie Preprocessor took 66.28ms. Allocated memory is still 92.3MB. Free memory was 43.5MB in the beginning and 68.0MB in the end (delta: -24.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-12-02 11:43:33,461 INFO L158 Benchmark]: RCFGBuilder took 547.49ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 38.7MB in the end (delta: 29.3MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2024-12-02 11:43:33,461 INFO L158 Benchmark]: TraceAbstraction took 36181.88ms. Allocated memory was 92.3MB in the beginning and 293.6MB in the end (delta: 201.3MB). Free memory was 38.3MB in the beginning and 154.4MB in the end (delta: -116.1MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. [2024-12-02 11:43:33,463 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.68ms. Allocated memory is still 92.3MB. Free memory was 69.2MB in the beginning and 47.4MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.38ms. Allocated memory is still 92.3MB. Free memory was 47.4MB in the beginning and 43.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.28ms. Allocated memory is still 92.3MB. Free memory was 43.5MB in the beginning and 68.0MB in the end (delta: -24.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * RCFGBuilder took 547.49ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 38.7MB in the end (delta: 29.3MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * TraceAbstraction took 36181.88ms. Allocated memory was 92.3MB in the beginning and 293.6MB in the end (delta: 201.3MB). Free memory was 38.3MB in the beginning and 154.4MB in the end (delta: -116.1MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9ea2cdd-da5a-4b61-848f-d5b66fa8c51a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")