./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.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_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB --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 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:25:52,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:25:52,766 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-27 23:25:52,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:25:52,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:25:52,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:25:52,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:25:52,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:25:52,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:25:52,812 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:25:52,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:25:52,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:25:52,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:25:52,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:25:52,813 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:25:52,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:25:52,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:25:52,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:25:52,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:25:52,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:25:52,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:25:52,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:25:52,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:25:52,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:25:52,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:25:52,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:25:52,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:25:52,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:25:52,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:25:52,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:25:52,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:25:52,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:25:52,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:25:52,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:25:52,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:25:52,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:25:52,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:25:52,819 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:25:52,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:25:52,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:25:52,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:25:52,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:25:52,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:25:52,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:25:52,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:25:52,820 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_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 [2024-11-27 23:25:53,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:25:53,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:25:53,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:25:53,215 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:25:53,215 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:25:53,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2024-11-27 23:25:56,479 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/data/dfabd1f74/9a5141fe3f2249cd88e1df757f184085/FLAGdf3ed7bce [2024-11-27 23:25:56,826 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:25:56,827 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2024-11-27 23:25:56,851 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/data/dfabd1f74/9a5141fe3f2249cd88e1df757f184085/FLAGdf3ed7bce [2024-11-27 23:25:57,061 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/data/dfabd1f74/9a5141fe3f2249cd88e1df757f184085 [2024-11-27 23:25:57,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:25:57,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:25:57,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:25:57,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:25:57,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:25:57,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3df3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57, skipping insertion in model container [2024-11-27 23:25:57,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:25:57,304 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_f214bf2e-aace-4962-b5ee-ea5f890e4053/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c[1266,1279] [2024-11-27 23:25:57,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:25:57,487 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:25:57,497 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_f214bf2e-aace-4962-b5ee-ea5f890e4053/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c[1266,1279] [2024-11-27 23:25:57,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:25:57,590 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:25:57,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57 WrapperNode [2024-11-27 23:25:57,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:25:57,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:25:57,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:25:57,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:25:57,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,729 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 705 [2024-11-27 23:25:57,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:25:57,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:25:57,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:25:57,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:25:57,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,771 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,839 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-11-27 23:25:57,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:25:57,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:25:57,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:25:57,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:25:57,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (1/1) ... [2024-11-27 23:25:57,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:25:57,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:25:58,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:25:58,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:25:58,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:25:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:25:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:25:58,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:25:58,279 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:25:58,281 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:25:59,577 INFO L? ?]: Removed 342 outVars from TransFormulas that were not future-live. [2024-11-27 23:25:59,577 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:25:59,597 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:25:59,600 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 23:25:59,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:25:59 BoogieIcfgContainer [2024-11-27 23:25:59,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:25:59,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:25:59,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:25:59,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:25:59,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:25:57" (1/3) ... [2024-11-27 23:25:59,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e21881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:25:59, skipping insertion in model container [2024-11-27 23:25:59,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:25:57" (2/3) ... [2024-11-27 23:25:59,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e21881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:25:59, skipping insertion in model container [2024-11-27 23:25:59,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:25:59" (3/3) ... [2024-11-27 23:25:59,616 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2024-11-27 23:25:59,637 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:25:59,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c that has 1 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 23:25:59,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:25:59,727 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;@33b756d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:25:59,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:25:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.4926470588235294) internal successors, (203), 137 states have internal predecessors, (203), 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-11-27 23:25:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 23:25:59,738 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:25:59,739 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] [2024-11-27 23:25:59,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:25:59,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:25:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1381663579, now seen corresponding path program 1 times [2024-11-27 23:25:59,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:25:59,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019044851] [2024-11-27 23:25:59,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:25:59,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:26:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:26:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:26:00,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:26:00,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019044851] [2024-11-27 23:26:00,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019044851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:26:00,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:26:00,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:26:00,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472478002] [2024-11-27 23:26:00,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:26:00,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:26:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:26:00,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:26:00,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:26:00,776 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.4926470588235294) internal successors, (203), 137 states have internal predecessors, (203), 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 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-11-27 23:26:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:26:00,861 INFO L93 Difference]: Finished difference Result 225 states and 333 transitions. [2024-11-27 23:26:00,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:26:00,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2024-11-27 23:26:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:26:00,880 INFO L225 Difference]: With dead ends: 225 [2024-11-27 23:26:00,880 INFO L226 Difference]: Without dead ends: 137 [2024-11-27 23:26:00,884 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-11-27 23:26:00,891 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 585 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-11-27 23:26:00,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 585 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:26:00,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-27 23:26:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-27 23:26:00,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.4779411764705883) internal successors, (201), 136 states have internal predecessors, (201), 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-11-27 23:26:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2024-11-27 23:26:00,949 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 201 transitions. Word has length 39 [2024-11-27 23:26:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:26:00,949 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 201 transitions. [2024-11-27 23:26:00,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-11-27 23:26:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2024-11-27 23:26:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-27 23:26:00,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:26:00,952 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] [2024-11-27 23:26:00,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:26:00,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:26:00,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:26:00,953 INFO L85 PathProgramCache]: Analyzing trace with hash -116406637, now seen corresponding path program 1 times [2024-11-27 23:26:00,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:26:00,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560880974] [2024-11-27 23:26:00,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:26:00,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:26:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:26:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:26:01,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:26:01,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560880974] [2024-11-27 23:26:01,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560880974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:26:01,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:26:01,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:26:01,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639996937] [2024-11-27 23:26:01,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:26:01,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:26:01,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:26:01,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:26:01,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:26:01,408 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-11-27 23:26:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:26:02,086 INFO L93 Difference]: Finished difference Result 331 states and 482 transitions. [2024-11-27 23:26:02,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:26:02,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 40 [2024-11-27 23:26:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:26:02,089 INFO L225 Difference]: With dead ends: 331 [2024-11-27 23:26:02,089 INFO L226 Difference]: Without dead ends: 172 [2024-11-27 23:26:02,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:26:02,094 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 457 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 23:26:02,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 558 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 23:26:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-27 23:26:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 143. [2024-11-27 23:26:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.471830985915493) internal successors, (209), 142 states have internal predecessors, (209), 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-11-27 23:26:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2024-11-27 23:26:02,119 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 40 [2024-11-27 23:26:02,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:26:02,119 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2024-11-27 23:26:02,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-11-27 23:26:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2024-11-27 23:26:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-27 23:26:02,121 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:26:02,124 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] [2024-11-27 23:26:02,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:26:02,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:26:02,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:26:02,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1458931238, now seen corresponding path program 1 times [2024-11-27 23:26:02,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:26:02,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478960873] [2024-11-27 23:26:02,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:26:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:26:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:26:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:26:02,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:26:02,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478960873] [2024-11-27 23:26:02,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478960873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:26:02,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:26:02,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:26:02,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488752098] [2024-11-27 23:26:02,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:26:02,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:26:02,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:26:02,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:26:02,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:26:02,411 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-11-27 23:26:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:26:02,452 INFO L93 Difference]: Finished difference Result 232 states and 339 transitions. [2024-11-27 23:26:02,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:26:02,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-11-27 23:26:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:26:02,454 INFO L225 Difference]: With dead ends: 232 [2024-11-27 23:26:02,455 INFO L226 Difference]: Without dead ends: 145 [2024-11-27 23:26:02,455 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-11-27 23:26:02,456 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 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-11-27 23:26:02,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:26:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-27 23:26:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-27 23:26:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 144 states have internal predecessors, (211), 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-11-27 23:26:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2024-11-27 23:26:02,468 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 41 [2024-11-27 23:26:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:26:02,469 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2024-11-27 23:26:02,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-11-27 23:26:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2024-11-27 23:26:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-27 23:26:02,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:26:02,471 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] [2024-11-27 23:26:02,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:26:02,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:26:02,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:26:02,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1179229697, now seen corresponding path program 1 times [2024-11-27 23:26:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:26:02,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624812385] [2024-11-27 23:26:02,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:26:02,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:26:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:26:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:26:03,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:26:03,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624812385] [2024-11-27 23:26:03,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624812385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:26:03,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:26:03,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:26:03,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398574688] [2024-11-27 23:26:03,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:26:03,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:26:03,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:26:03,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:26:03,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:26:03,107 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-11-27 23:26:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:26:03,139 INFO L93 Difference]: Finished difference Result 234 states and 340 transitions. [2024-11-27 23:26:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:26:03,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2024-11-27 23:26:03,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:26:03,142 INFO L225 Difference]: With dead ends: 234 [2024-11-27 23:26:03,142 INFO L226 Difference]: Without dead ends: 145 [2024-11-27 23:26:03,142 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-11-27 23:26:03,145 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 5 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:26:03,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 569 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:26:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-27 23:26:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-27 23:26:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4583333333333333) internal successors, (210), 144 states have internal predecessors, (210), 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-11-27 23:26:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2024-11-27 23:26:03,160 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 42 [2024-11-27 23:26:03,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:26:03,161 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2024-11-27 23:26:03,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-11-27 23:26:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2024-11-27 23:26:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-27 23:26:03,165 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:26:03,165 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] [2024-11-27 23:26:03,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 23:26:03,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:26:03,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:26:03,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1189698035, now seen corresponding path program 1 times [2024-11-27 23:26:03,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:26:03,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024092692] [2024-11-27 23:26:03,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:26:03,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:26:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:26:03,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-11-27 23:26:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:26:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024092692] [2024-11-27 23:26:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024092692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:26:03,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:26:03,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 23:26:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550566782] [2024-11-27 23:26:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:26:03,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:26:03,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:26:03,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:26:03,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:26:03,957 INFO L87 Difference]: Start difference. First operand 145 states and 210 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-11-27 23:26:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:26:04,147 INFO L93 Difference]: Finished difference Result 246 states and 354 transitions. [2024-11-27 23:26:04,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:26:04,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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 43 [2024-11-27 23:26:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:26:04,149 INFO L225 Difference]: With dead ends: 246 [2024-11-27 23:26:04,149 INFO L226 Difference]: Without dead ends: 157 [2024-11-27 23:26:04,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-27 23:26:04,151 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 187 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:26:04,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1129 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:26:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-27 23:26:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2024-11-27 23:26:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4451612903225806) internal successors, (224), 155 states have internal predecessors, (224), 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-11-27 23:26:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 224 transitions. [2024-11-27 23:26:04,159 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 224 transitions. Word has length 43 [2024-11-27 23:26:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:26:04,159 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 224 transitions. [2024-11-27 23:26:04,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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-11-27 23:26:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 224 transitions. [2024-11-27 23:26:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-27 23:26:04,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:26:04,161 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] [2024-11-27 23:26:04,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:26:04,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:26:04,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:26:04,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2093413086, now seen corresponding path program 1 times [2024-11-27 23:26:04,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:26:04,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619246946] [2024-11-27 23:26:04,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:26:04,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:26:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:26:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:26:05,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:26:05,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619246946] [2024-11-27 23:26:05,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619246946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:26:05,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:26:05,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 23:26:05,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443048558] [2024-11-27 23:26:05,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:26:05,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 23:26:05,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:26:05,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 23:26:05,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:26:05,232 INFO L87 Difference]: Start difference. First operand 156 states and 224 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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-11-27 23:26:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:26:05,661 INFO L93 Difference]: Finished difference Result 259 states and 371 transitions. [2024-11-27 23:26:05,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:26:05,662 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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 44 [2024-11-27 23:26:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:26:05,663 INFO L225 Difference]: With dead ends: 259 [2024-11-27 23:26:05,663 INFO L226 Difference]: Without dead ends: 161 [2024-11-27 23:26:05,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-27 23:26:05,664 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 192 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:26:05,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1216 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:26:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-27 23:26:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2024-11-27 23:26:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.440251572327044) internal successors, (229), 159 states have internal predecessors, (229), 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-11-27 23:26:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 229 transitions. [2024-11-27 23:26:05,682 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 229 transitions. Word has length 44 [2024-11-27 23:26:05,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:26:05,682 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 229 transitions. [2024-11-27 23:26:05,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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-11-27 23:26:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 229 transitions. [2024-11-27 23:26:05,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-27 23:26:05,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:26:05,689 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] [2024-11-27 23:26:05,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 23:26:05,690 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:26:05,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:26:05,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1157382943, now seen corresponding path program 1 times [2024-11-27 23:26:05,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:26:05,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159676902] [2024-11-27 23:26:05,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:26:05,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:26:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:26:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:26:05,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:26:05,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159676902] [2024-11-27 23:26:05,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159676902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:26:05,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:26:05,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:26:05,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016992894] [2024-11-27 23:26:05,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:26:05,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:26:05,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:26:05,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:26:05,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:26:05,900 INFO L87 Difference]: Start difference. First operand 160 states and 229 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-11-27 23:26:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:26:06,018 INFO L93 Difference]: Finished difference Result 335 states and 476 transitions. [2024-11-27 23:26:06,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:26:06,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 44 [2024-11-27 23:26:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:26:06,021 INFO L225 Difference]: With dead ends: 335 [2024-11-27 23:26:06,021 INFO L226 Difference]: Without dead ends: 229 [2024-11-27 23:26:06,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:26:06,022 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 372 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:26:06,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 555 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:26:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-27 23:26:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 156. [2024-11-27 23:26:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4387096774193548) internal successors, (223), 155 states have internal predecessors, (223), 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-11-27 23:26:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 223 transitions. [2024-11-27 23:26:06,031 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 223 transitions. Word has length 44 [2024-11-27 23:26:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:26:06,031 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 223 transitions. [2024-11-27 23:26:06,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-11-27 23:26:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 223 transitions. [2024-11-27 23:26:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-27 23:26:06,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:26:06,033 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] [2024-11-27 23:26:06,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 23:26:06,034 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:26:06,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:26:06,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2035841548, now seen corresponding path program 1 times [2024-11-27 23:26:06,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:26:06,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331713347] [2024-11-27 23:26:06,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:26:06,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:26:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:26:06,083 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 23:26:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:26:06,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 23:26:06,173 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 23:26:06,174 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 23:26:06,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 23:26:06,179 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:26:06,235 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:26:06,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:26:06 BoogieIcfgContainer [2024-11-27 23:26:06,242 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:26:06,243 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:26:06,243 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:26:06,243 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:26:06,244 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:25:59" (3/4) ... [2024-11-27 23:26:06,247 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 23:26:06,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:26:06,248 INFO L158 Benchmark]: Toolchain (without parser) took 9184.06ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 94.8MB in the beginning and 224.2MB in the end (delta: -129.4MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. [2024-11-27 23:26:06,250 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 142.6MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:26:06,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.52ms. Allocated memory is still 117.4MB. Free memory was 94.5MB in the beginning and 73.8MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:26:06,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.94ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 60.7MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:26:06,251 INFO L158 Benchmark]: Boogie Preprocessor took 229.46ms. Allocated memory is still 117.4MB. Free memory was 60.7MB in the beginning and 52.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:26:06,251 INFO L158 Benchmark]: RCFGBuilder took 1640.60ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 52.3MB in the beginning and 300.2MB in the end (delta: -248.0MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2024-11-27 23:26:06,251 INFO L158 Benchmark]: TraceAbstraction took 6638.72ms. Allocated memory is still 352.3MB. Free memory was 299.7MB in the beginning and 224.2MB in the end (delta: 75.4MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2024-11-27 23:26:06,251 INFO L158 Benchmark]: Witness Printer took 4.73ms. Allocated memory is still 352.3MB. Free memory was 224.2MB in the beginning and 224.2MB in the end (delta: 46.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:26:06,255 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.24ms. Allocated memory is still 142.6MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.52ms. Allocated memory is still 117.4MB. Free memory was 94.5MB in the beginning and 73.8MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 135.94ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 60.7MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 229.46ms. Allocated memory is still 117.4MB. Free memory was 60.7MB in the beginning and 52.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1640.60ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 52.3MB in the beginning and 300.2MB in the end (delta: -248.0MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6638.72ms. Allocated memory is still 352.3MB. Free memory was 299.7MB in the beginning and 224.2MB in the end (delta: 75.4MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. * Witness Printer took 4.73ms. Allocated memory is still 352.3MB. Free memory was 224.2MB in the beginning and 224.2MB in the end (delta: 46.8kB). 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 bitwiseOr at line 162, overapproximation of bitwiseAnd at line 167. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_18 mask_SORT_18 = (SORT_18)-1 >> (sizeof(SORT_18) * 8 - 4); [L36] const SORT_18 msb_SORT_18 = (SORT_18)1 << (4 - 1); [L38] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 10); [L39] const SORT_71 msb_SORT_71 = (SORT_71)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 1; [L43] const SORT_1 var_15 = 1; [L44] const SORT_18 var_20 = 1; [L45] const SORT_71 var_72 = 0; [L46] const SORT_10 var_81 = 104; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_32; [L53] SORT_18 input_34; [L54] SORT_1 input_36; [L55] SORT_18 input_38; [L56] SORT_1 input_40; [L57] SORT_1 input_42; [L58] SORT_1 input_48; [L59] SORT_1 input_50; [L60] SORT_1 input_52; [L61] SORT_3 input_54; [L62] SORT_1 input_57; [L63] SORT_1 input_67; [L64] SORT_1 input_75; [L65] SORT_1 input_76; [L66] SORT_1 input_77; [L67] SORT_1 input_89; [L68] SORT_1 input_90; [L69] SORT_1 input_91; [L70] SORT_1 input_102; [L71] SORT_1 input_108; [L72] SORT_1 input_114; [L73] SORT_1 input_125; [L74] SORT_1 input_127; [L75] SORT_71 input_142; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L77] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L78] SORT_1 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L79] SORT_1 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L80] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L81] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L82] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L83] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L84] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L85] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L86] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L87] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_ushort() & mask_SORT_71 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L88] SORT_71 state_73 = __VERIFIER_nondet_ushort() & mask_SORT_71; [L90] SORT_1 init_9_arg_1 = var_7; [L91] state_8 = init_9_arg_1 [L92] SORT_1 init_17_arg_1 = var_15; [L93] state_16 = init_17_arg_1 [L94] SORT_1 init_29_arg_1 = var_7; [L95] state_28 = init_29_arg_1 [L96] SORT_1 init_31_arg_1 = var_7; [L97] state_30 = init_31_arg_1 [L98] SORT_1 init_45_arg_1 = var_7; [L99] state_44 = init_45_arg_1 [L100] SORT_1 init_47_arg_1 = var_7; [L101] state_46 = init_47_arg_1 [L102] SORT_1 init_60_arg_1 = var_7; [L103] state_59 = init_60_arg_1 [L104] SORT_1 init_62_arg_1 = var_7; [L105] state_61 = init_62_arg_1 [L106] SORT_1 init_64_arg_1 = var_7; [L107] state_63 = init_64_arg_1 [L108] SORT_1 init_66_arg_1 = var_7; [L109] state_65 = init_66_arg_1 [L110] SORT_1 init_70_arg_1 = var_7; [L111] state_69 = init_70_arg_1 [L112] SORT_71 init_74_arg_1 = var_72; [L113] state_73 = init_74_arg_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L116] input_2 = __VERIFIER_nondet_uchar() [L117] input_4 = __VERIFIER_nondet_uchar() [L118] input_5 = __VERIFIER_nondet_uchar() [L119] input_6 = __VERIFIER_nondet_uchar() [L120] input_32 = __VERIFIER_nondet_uchar() [L121] input_34 = __VERIFIER_nondet_uchar() [L122] input_36 = __VERIFIER_nondet_uchar() [L123] input_38 = __VERIFIER_nondet_uchar() [L124] input_40 = __VERIFIER_nondet_uchar() [L125] input_42 = __VERIFIER_nondet_uchar() [L126] input_48 = __VERIFIER_nondet_uchar() [L127] input_50 = __VERIFIER_nondet_uchar() [L128] input_52 = __VERIFIER_nondet_uchar() [L129] input_54 = __VERIFIER_nondet_uchar() [L130] input_57 = __VERIFIER_nondet_uchar() [L131] input_67 = __VERIFIER_nondet_uchar() [L132] input_75 = __VERIFIER_nondet_uchar() [L133] input_76 = __VERIFIER_nondet_uchar() [L134] input_77 = __VERIFIER_nondet_uchar() [L135] input_89 = __VERIFIER_nondet_uchar() [L136] input_90 = __VERIFIER_nondet_uchar() [L137] input_91 = __VERIFIER_nondet_uchar() [L138] input_102 = __VERIFIER_nondet_uchar() [L139] input_108 = __VERIFIER_nondet_uchar() [L140] input_114 = __VERIFIER_nondet_uchar() [L141] input_125 = __VERIFIER_nondet_uchar() [L142] input_127 = __VERIFIER_nondet_uchar() [L143] input_142 = __VERIFIER_nondet_ushort() [L146] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_11_arg_0=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L147] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L147] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L148] SORT_10 var_11 = var_11_arg_0; [L149] SORT_10 var_13_arg_0 = var_11; [L150] SORT_10 var_13_arg_1 = var_12; [L151] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L152] SORT_1 var_14_arg_0 = var_13; [L153] SORT_1 var_14 = ~var_14_arg_0; [L154] SORT_1 var_19_arg_0 = state_16; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_14=-1, var_15=1, var_19_arg_0=1, var_20=1, var_72=0, var_7=0, var_81=104] [L155] EXPR var_19_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_14=-1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L155] var_19_arg_0 = var_19_arg_0 & mask_SORT_1 [L156] SORT_18 var_19 = var_19_arg_0; [L157] SORT_18 var_21_arg_0 = var_19; [L158] SORT_18 var_21_arg_1 = var_20; [L159] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L160] SORT_1 var_22_arg_0 = var_14; [L161] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_22_arg_0=-1, var_22_arg_1=1, var_72=0, var_7=0, var_81=104] [L162] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L162] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L163] SORT_1 var_25_arg_0 = var_22; [L164] SORT_1 var_25 = ~var_25_arg_0; [L165] SORT_1 var_26_arg_0 = var_15; [L166] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_26_arg_0=1, var_26_arg_1=-1, var_72=0, var_7=0, var_81=104] [L167] EXPR var_26_arg_0 & var_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L167] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L168] EXPR var_26 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L168] var_26 = var_26 & mask_SORT_1 [L169] SORT_1 bad_27_arg_0 = var_26; [L170] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1213 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1213 mSDsluCounter, 5193 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3885 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 557 IncrementalHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 1308 mSDtfsCounter, 557 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 104 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-11-27 23:26:06,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/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_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB --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 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:26:09,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:26:09,586 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-27 23:26:09,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:26:09,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:26:09,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:26:09,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:26:09,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:26:09,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:26:09,653 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:26:09,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:26:09,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:26:09,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:26:09,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:26:09,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:26:09,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:26:09,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:26:09,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:26:09,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:26:09,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:26:09,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:26:09,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 23:26:09,658 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 23:26:09,659 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 23:26:09,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:26:09,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:26:09,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:26:09,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:26:09,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:26:09,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:26:09,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:26:09,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:26:09,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:26:09,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:26:09,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:26:09,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:26:09,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:26:09,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:26:09,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:26:09,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:26:09,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:26:09,663 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 23:26:09,664 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 23:26:09,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:26:09,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:26:09,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:26:09,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:26:09,664 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_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 [2024-11-27 23:26:10,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:26:10,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:26:10,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:26:10,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:26:10,098 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:26:10,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2024-11-27 23:26:13,461 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/data/44cf02755/513388946fcd4f199483ca92dc16414e/FLAG35ef4e679 [2024-11-27 23:26:13,834 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:26:13,835 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2024-11-27 23:26:13,852 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/data/44cf02755/513388946fcd4f199483ca92dc16414e/FLAG35ef4e679 [2024-11-27 23:26:14,040 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/data/44cf02755/513388946fcd4f199483ca92dc16414e [2024-11-27 23:26:14,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:26:14,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:26:14,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:26:14,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:26:14,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:26:14,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19711a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14, skipping insertion in model container [2024-11-27 23:26:14,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:26:14,266 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_f214bf2e-aace-4962-b5ee-ea5f890e4053/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c[1266,1279] [2024-11-27 23:26:14,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:26:14,420 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:26:14,432 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_f214bf2e-aace-4962-b5ee-ea5f890e4053/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c[1266,1279] [2024-11-27 23:26:14,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:26:14,573 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:26:14,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14 WrapperNode [2024-11-27 23:26:14,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:26:14,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:26:14,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:26:14,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:26:14,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,630 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 449 [2024-11-27 23:26:14,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:26:14,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:26:14,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:26:14,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:26:14,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,665 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-11-27 23:26:14,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:26:14,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:26:14,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:26:14,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:26:14,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (1/1) ... [2024-11-27 23:26:14,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:26:14,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:26:14,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:26:14,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:26:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:26:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 23:26:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:26:14,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:26:14,996 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:26:14,998 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:26:15,635 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-27 23:26:15,635 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:26:15,648 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:26:15,648 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 23:26:15,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:26:15 BoogieIcfgContainer [2024-11-27 23:26:15,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:26:15,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:26:15,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:26:15,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:26:15,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:26:14" (1/3) ... [2024-11-27 23:26:15,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a4848e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:26:15, skipping insertion in model container [2024-11-27 23:26:15,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:26:14" (2/3) ... [2024-11-27 23:26:15,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a4848e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:26:15, skipping insertion in model container [2024-11-27 23:26:15,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:26:15" (3/3) ... [2024-11-27 23:26:15,666 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2024-11-27 23:26:15,685 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:26:15,687 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 23:26:15,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:26:15,748 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;@7f4474a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:26:15,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:26:15,752 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-11-27 23:26:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 23:26:15,757 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:26:15,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 23:26:15,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:26:15,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:26:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-27 23:26:15,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:26:15,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861580106] [2024-11-27 23:26:15,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:26:15,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:26:15,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:26:15,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:26:15,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:26:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:26:16,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-27 23:26:16,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:26:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:26:16,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:26:16,369 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:26:16,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861580106] [2024-11-27 23:26:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861580106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:26:16,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:26:16,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:26:16,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692250302] [2024-11-27 23:26:16,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:26:16,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:26:16,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:26:16,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:26:16,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:26:16,402 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-11-27 23:26:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:26:16,466 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-27 23:26:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:26:16,471 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-11-27 23:26:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:26:16,478 INFO L225 Difference]: With dead ends: 18 [2024-11-27 23:26:16,479 INFO L226 Difference]: Without dead ends: 10 [2024-11-27 23:26:16,482 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-11-27 23:26:16,485 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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-11-27 23:26:16,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:26:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-27 23:26:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-27 23:26:16,511 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-11-27 23:26:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-27 23:26:16,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-27 23:26:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:26:16,518 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-27 23:26:16,518 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-11-27 23:26:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-27 23:26:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-27 23:26:16,519 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:26:16,519 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-27 23:26:16,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 23:26:16,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:26:16,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:26:16,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:26:16,728 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-27 23:26:16,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:26:16,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812923699] [2024-11-27 23:26:16,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:26:16,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:26:16,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:26:16,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:26:16,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 23:26:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:26:16,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-27 23:26:16,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:26:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:26:17,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:26:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:26:18,400 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:26:18,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812923699] [2024-11-27 23:26:18,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812923699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:26:18,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:26:18,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-27 23:26:18,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088203509] [2024-11-27 23:26:18,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:26:18,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 23:26:18,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:26:18,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 23:26:18,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:26:18,406 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-11-27 23:26:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:26:18,704 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-27 23:26:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:26:18,705 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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) Word has length 8 [2024-11-27 23:26:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:26:18,706 INFO L225 Difference]: With dead ends: 18 [2024-11-27 23:26:18,706 INFO L226 Difference]: Without dead ends: 16 [2024-11-27 23:26:18,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-27 23:26:18,707 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:26:18,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:26:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-27 23:26:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-27 23:26:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-11-27 23:26:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-27 23:26:18,713 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-27 23:26:18,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:26:18,714 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-27 23:26:18,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-11-27 23:26:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-27 23:26:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-27 23:26:18,715 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:26:18,715 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-27 23:26:18,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 23:26:18,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:26:18,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:26:18,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:26:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-27 23:26:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:26:18,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599821624] [2024-11-27 23:26:18,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:26:18,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:26:18,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:26:18,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:26:18,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 23:26:19,281 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:26:19,281 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:26:19,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-27 23:26:19,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:26:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:26:21,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:27:22,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse32 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse67 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_15~0#1|))))))))) (let ((.cse121 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse67))))))))))) (let ((.cse76 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_20~0#1|)) (.cse85 ((_ zero_extend 16) |c_ULTIMATE.start_main_~mask_SORT_71~0#1|)) (.cse119 ((_ zero_extend 24) ((_ extract 7 0) .cse121))) (.cse116 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_16~0#1|))))) (let ((.cse95 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse116)))))) (.cse80 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse119 .cse32)))) (.cse86 ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~var_72~0#1|))))))) .cse85)))) (.cse75 (forall ((|v_ULTIMATE.start_main_~var_22_arg_0~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_26_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_22_arg_0~0#1_17|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_26_arg_0~0#1_17|))))))))) (.cse120 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse121))))) (.cse74 (forall ((|v_ULTIMATE.start_main_~var_22_arg_0~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_26_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_22_arg_0~0#1_17|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_26_arg_0~0#1_17|)))))))))) (let ((.cse70 (or .cse120 .cse74)) (.cse72 (or (not .cse120) .cse75)) (.cse78 (bvugt .cse86 |c_ULTIMATE.start_main_~var_81~0#1|)) (.cse118 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse80 .cse32))))) (.cse94 ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_73~0#1|)) (.cse99 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse95))))))) (let ((.cse115 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse99)))))))) (.cse114 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_63~0#1|)))))) (.cse101 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse94 .cse85)))) (.cse81 (or .cse118 .cse74)) (.cse68 (not .cse78)) (.cse88 (and .cse70 .cse72)) (.cse89 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse119)))))))) (.cse82 (or (not .cse118) .cse75))) (let ((.cse18 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 .cse67)))) (.cse19 (and .cse81 (or .cse68 .cse88) (or (let ((.cse117 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse89 .cse32)))))) (and (or .cse117 .cse74) (or (not .cse117) .cse75))) .cse78) .cse82)) (.cse105 (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse85 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse101)))))))))))) |c_ULTIMATE.start_main_~var_81~0#1|))) (.cse107 (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (not (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse85 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse101)))))))))))) |c_ULTIMATE.start_main_~var_81~0#1|)))) (.cse108 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse116)))))))))) (.cse37 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse114 .cse32)))) (.cse21 (bvugt .cse101 |c_ULTIMATE.start_main_~var_81~0#1|)) (.cse96 (or .cse115 .cse74)) (.cse98 (or (not .cse115) .cse75))) (let ((.cse48 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse114)))))))) (.cse20 (and .cse96 .cse98 .cse70 .cse72)) (.cse17 (not .cse21)) (.cse9 (= |c_ULTIMATE.start_main_~state_63~0#1| (_ bv0 8))) (.cse39 (not .cse37)) (.cse46 (let ((.cse112 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse108))))))) (let ((.cse113 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse112))))))))) (let ((.cse109 (or (not .cse113) .cse75)) (.cse110 (or .cse113 .cse74))) (and (or (let ((.cse111 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse112)))))))))) .cse76))) (and .cse109 .cse110 (or .cse111 .cse74) (or (not .cse111) .cse75))) .cse105) (or .cse107 (and .cse109 .cse70 .cse110 .cse72))))))) (.cse45 (let ((.cse103 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse108))))))))))) (let ((.cse106 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse103))))))))) (and (or (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (let ((.cse100 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse85 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse101)))))))))))))) (or (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse100 |ULTIMATE.start_main_~var_12~0#1|))))))))) .cse85))) |c_ULTIMATE.start_main_~var_81~0#1|) (bvugt .cse100 |c_ULTIMATE.start_main_~var_81~0#1|)))) (let ((.cse102 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse103)))) .cse32))))))))) (and (or (not .cse102) .cse75) (or .cse74 .cse102)))) (or .cse88 (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (let ((.cse104 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse85 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse101)))))))))))))) (or (bvugt .cse104 |c_ULTIMATE.start_main_~var_81~0#1|) (not (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse104 |ULTIMATE.start_main_~var_12~0#1|))))))))) .cse85))) |c_ULTIMATE.start_main_~var_81~0#1|)))))) (or .cse105 .cse74 .cse106) (or .cse105 (not .cse106) .cse75) (or .cse107 .cse19))))) (.cse63 (not .cse18)) (.cse23 (let ((.cse97 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse99))))))))))))) (and .cse96 (or .cse75 (not .cse97)) (or .cse97 .cse74) .cse98))) (.cse52 (let ((.cse92 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse95))))))))))) (let ((.cse93 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse92 .cse32)))))))) (.cse90 ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) .cse94)) .cse85))))) (and (or (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse90))))))))) .cse85))) |c_ULTIMATE.start_main_~var_81~0#1|)) (let ((.cse91 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse92))))))))))))) (and (or (not .cse91) .cse75) (or .cse91 .cse74)))) (or .cse93 .cse74) (or (not .cse93) .cse75) (or (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (not (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse90))))))))) .cse85))) |c_ULTIMATE.start_main_~var_81~0#1|))) .cse88)))))) (let ((.cse5 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_59~0#1|)) (.cse22 (and (or .cse63 .cse23) (or .cse18 .cse52))) (.cse41 (and (or .cse63 .cse46) (or .cse18 .cse45))) (.cse42 (and (or .cse37 .cse45) (or .cse39 .cse46))) (.cse10 (not .cse9)) (.cse11 (and (or .cse23 .cse21) (or .cse20 .cse17))) (.cse38 (and (or (and .cse81 .cse70 .cse82 .cse72) .cse68) (or (let ((.cse84 ((_ zero_extend 24) ((_ extract 7 0) .cse89)))) (let ((.cse87 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse84))) .cse32)))))) (and (or (let ((.cse83 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse84))))))))))))) (and (or .cse83 .cse74) (or (not .cse83) .cse75))) (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse85 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse86)))))))))))) |c_ULTIMATE.start_main_~var_81~0#1|))) (or .cse74 .cse87) (or (not .cse87) .cse75) (or (forall ((|ULTIMATE.start_main_~var_12~0#1| (_ BitVec 32))) (not (bvugt ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse85 ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (bvadd |ULTIMATE.start_main_~var_12~0#1| .cse86)))))))))))) |c_ULTIMATE.start_main_~var_81~0#1|))) .cse88)))) .cse78))) (.cse47 (not .cse48)) (.cse40 (let ((.cse77 ((_ zero_extend 24) ((_ extract 7 0) .cse80)))) (let ((.cse79 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse77))))))))) (let ((.cse69 (or .cse79 .cse74)) (.cse71 (or (not .cse79) .cse75))) (and (or .cse68 (and .cse69 .cse70 .cse71 .cse72)) (or (let ((.cse73 (= .cse76 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse77))))))))))))) (and (or .cse73 .cse74) .cse69 (or (not .cse73) .cse75) .cse71)) .cse78))))))) (let ((.cse14 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_8~0#1|)) (.cse7 (and (or .cse21 (and (or .cse48 .cse45) (or .cse46 .cse47))) (or (and (or .cse48 .cse38) (or .cse47 .cse40)) .cse17))) (.cse56 (or .cse10 .cse11)) (.cse8 (and (or .cse42 .cse21) (or (and (or .cse39 .cse40) (or .cse37 .cse38)) .cse17))) (.cse16 (and (or (and (or .cse63 .cse40) (or .cse18 .cse38)) .cse17) (or .cse41 .cse21))) (.cse24 (and (or .cse22 .cse21) (or .cse17 (and (or .cse63 .cse20) (or .cse18 .cse19))))) (.cse3 (not .cse5)) (.cse55 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_7~0#1|)))))) (.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse67))))) (let ((.cse13 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse66 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_69~0#1|)))))))) .cse66))) .cse32)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse66 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_127~0#1|))))))))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse66))))))))))) (.cse1 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse65 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_69~0#1|)))))))) .cse65))) .cse32)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse65 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_127~0#1|))))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse65)))))))))) (.cse26 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse64 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_69~0#1|)))))))) .cse64))) .cse32)))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse64 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_127~0#1|)))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse64)))))))))) (.cse12 (let ((.cse62 (= ((_ extract 7 0) (bvand .cse32 .cse55)) (_ bv0 8)))) (let ((.cse60 (and (or (not .cse62) .cse3) (or .cse63 .cse5))) (.cse61 (and (or .cse62 .cse3) (or .cse18 .cse5)))) (and (or .cse10 (and (or (and (or .cse60 .cse23) (or .cse61 .cse52)) .cse21) (or (and (or .cse61 .cse19) (or .cse60 .cse20)) .cse17))) (or (and (or .cse21 (and (or .cse60 .cse46) (or .cse61 .cse45))) (or .cse17 (and (or .cse60 .cse40) (or .cse61 .cse38)))) .cse9))))) (.cse15 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_69~0#1|)))))))) .cse59))) .cse32)))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_127~0#1|)))))))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse59))))))))))) (.cse6 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse58 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse58 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_127~0#1|)))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_69~0#1|)))))))) .cse58))) .cse32))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse58))))))))))) (.cse4 (and (or .cse16 .cse9) (or .cse10 .cse24))) (.cse27 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_127~0#1|))))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_69~0#1|)))))))) .cse57))) .cse32))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse57))))))))))) (.cse2 (and .cse56 (or .cse9 .cse8))) (.cse28 (forall ((|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_69~0#1|)))))))) (_ bv0 8)))) (.cse29 (and .cse56 (or .cse7 .cse9))) (.cse0 (not .cse14)) (.cse25 (let ((.cse53 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse55))))))))) (let ((.cse54 (not .cse53))) (and (or (and (or .cse21 (and (or .cse52 .cse53) (or .cse54 .cse23))) (or (and (or .cse53 .cse19) (or .cse54 .cse20)) .cse17)) .cse10) (or (and (or .cse17 (and (or .cse54 .cse40) (or .cse53 .cse38))) (or .cse21 (and (or .cse53 .cse45) (or .cse54 .cse46)))) .cse9)))))) (and (or .cse0 (and (or .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5))) (or .cse0 (and (or (and (or .cse6 .cse7 .cse5) (or .cse6 .cse3 .cse8)) .cse9) (or .cse10 (and (or .cse6 .cse11 .cse5) (or .cse6 .cse11 .cse3))))) (or .cse12 .cse13 .cse14) (or .cse0 (and (or (and (or .cse15 .cse3 .cse8) (or .cse15 .cse16 .cse5)) .cse9) (or .cse10 (and (or .cse17 (and (or .cse15 .cse18 .cse5 .cse19) (or .cse15 .cse20 .cse3))) (or .cse21 (and (or .cse15 .cse22 .cse5) (or .cse15 .cse23 .cse3))))))) (or .cse6 .cse12 .cse14) (or (and (or (and (or .cse16 .cse5 .cse13) (or .cse3 .cse13 .cse8)) .cse9) (or .cse10 (and (or .cse24 .cse5 .cse13) (or .cse11 .cse3 .cse13)))) .cse0) (or .cse25 .cse26 .cse14) (or .cse12 .cse27 .cse14) (or .cse1 .cse25 .cse14) (or .cse0 (let ((.cse31 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_69~0#1|))))) (or (not (= ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse35))))) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse35))))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))) .cse32))))))) (.cse30 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_127~0#1|)))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse33))))))))))) (and (or (and (or .cse28 .cse29 .cse30) (or .cse31 .cse29)) .cse5) (or (and (or (and (or .cse28 .cse11 .cse30) (or .cse11 .cse31)) .cse10) (or .cse9 (and (or .cse31 .cse8) (or .cse28 .cse30 .cse8)))) .cse3)))) (or (and (or .cse4 .cse5 .cse26) (or .cse2 .cse3 .cse26)) .cse0) (or .cse12 .cse15 .cse14) (or .cse25 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_127~0#1|))))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_69~0#1|)))))))) .cse36))) .cse32))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse36))))))))) .cse14) (or (and (or .cse10 (and (or .cse21 (and (or .cse6 .cse22 .cse5) (or .cse6 .cse23 .cse3))) (or (and (or .cse6 .cse20 .cse3) (or .cse6 .cse18 .cse5 .cse19)) .cse17))) (or (and (or (and (or (and (or .cse6 .cse18 .cse5) (or .cse6 .cse37 .cse3)) .cse38) (or .cse6 .cse39 .cse3 .cse40)) .cse17) (or .cse21 (and (or .cse6 .cse41 .cse5) (or .cse6 .cse42 .cse3)))) .cse9)) .cse0) (or .cse0 (and (or .cse27 .cse4 .cse5) (or .cse27 .cse2 .cse3))) (or (and (or (let ((.cse44 (and (or .cse27 .cse48 .cse5) (or .cse27 .cse37 .cse3))) (.cse43 (and (or .cse27 .cse47 .cse5) (or .cse27 .cse39 .cse3)))) (and (or (and (or .cse43 .cse40) (or .cse44 .cse38)) .cse17) (or (and (or .cse44 .cse45) (or .cse43 .cse46)) .cse21))) .cse9) (or .cse10 (and (or (and (or .cse27 .cse5) (or .cse27 .cse3)) .cse20 .cse17) (or .cse21 (and (or .cse27 .cse23 .cse3) (or .cse27 .cse23 .cse5)))))) .cse0) (or (let ((.cse49 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8))) (let ((.cse50 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse50 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_127~0#1|))))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse50))))))))))) (and (or .cse28 .cse2 .cse3 .cse49) (or .cse28 .cse29 .cse5 .cse49))) .cse0) (or .cse25 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_127~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_69~0#1| (_ BitVec 8))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_127~0#1|)))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_69~0#1|)))))))) .cse51))) .cse32))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse34 .cse51))))))))) .cse14))))))))))))) is different from false [2024-11-27 23:28:53,157 WARN L286 SmtUtils]: Spent 48.52s on a formula simplification. DAG size of input: 763 DAG size of output: 767 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:30:01,969 WARN L286 SmtUtils]: Spent 22.62s on a formula simplification that was a NOOP. DAG size: 764 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:30:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-27 23:30:04,092 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:30:04,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599821624] [2024-11-27 23:30:04,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599821624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:30:04,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:30:04,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-11-27 23:30:04,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826781067] [2024-11-27 23:30:04,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:30:04,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-27 23:30:04,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:30:04,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 23:30:04,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=123, Unknown=2, NotChecked=24, Total=210 [2024-11-27 23:30:04,094 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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-11-27 23:30:17,755 WARN L286 SmtUtils]: Spent 13.09s on a formula simplification. DAG size of input: 826 DAG size of output: 497 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:30:31,054 WARN L286 SmtUtils]: Spent 13.10s on a formula simplification. DAG size of input: 828 DAG size of output: 492 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:30:32,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:32,252 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-27 23:30:32,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 23:30:32,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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 14 [2024-11-27 23:30:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:32,254 INFO L225 Difference]: With dead ends: 30 [2024-11-27 23:30:32,254 INFO L226 Difference]: Without dead ends: 28 [2024-11-27 23:30:32,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 108.7s TimeCoverageRelationStatistics Valid=199, Invalid=355, Unknown=2, NotChecked=44, Total=600 [2024-11-27 23:30:32,256 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:32,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 20 Unchecked, 0.4s Time] [2024-11-27 23:30:32,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-27 23:30:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-27 23:30:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-11-27 23:30:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-27 23:30:32,266 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-27 23:30:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:32,266 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-27 23:30:32,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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-11-27 23:30:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-27 23:30:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-27 23:30:32,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:30:32,267 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-27 23:30:32,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 23:30:32,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:32,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:30:32,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:30:32,468 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-27 23:30:32,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 23:30:32,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931059337] [2024-11-27 23:30:32,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:30:32,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:32,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:30:32,474 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:30:32,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 23:30:32,782 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-27 23:30:32,782 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:30:32,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-27 23:30:32,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:30:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-27 23:30:33,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:30:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-27 23:30:34,197 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 23:30:34,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931059337] [2024-11-27 23:30:34,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931059337] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:30:34,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:30:34,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-27 23:30:34,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070398984] [2024-11-27 23:30:34,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 23:30:34,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:30:34,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 23:30:34,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:30:34,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:30:34,199 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-11-27 23:30:34,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:30:34,262 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-11-27 23:30:34,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:30:34,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 26 [2024-11-27 23:30:34,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:30:34,264 INFO L225 Difference]: With dead ends: 27 [2024-11-27 23:30:34,264 INFO L226 Difference]: Without dead ends: 0 [2024-11-27 23:30:34,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:30:34,265 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:30:34,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:30:34,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-27 23:30:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-27 23:30:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-11-27 23:30:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-27 23:30:34,267 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-27 23:30:34,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:30:34,267 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-27 23:30:34,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-11-27 23:30:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-27 23:30:34,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-27 23:30:34,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 23:30:34,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 23:30:34,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:30:34,476 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-27 23:30:34,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-27 23:30:40,611 WARN L286 SmtUtils]: Spent 5.76s on a formula simplification. DAG size of input: 428 DAG size of output: 15 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-27 23:30:40,615 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:30:40,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:30:40 BoogieIcfgContainer [2024-11-27 23:30:40,626 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:30:40,627 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:30:40,627 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:30:40,627 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:30:40,628 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:26:15" (3/4) ... [2024-11-27 23:30:40,630 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-27 23:30:40,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-27 23:30:40,643 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-27 23:30:40,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-27 23:30:40,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-27 23:30:40,748 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 23:30:40,749 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 23:30:40,749 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:30:40,750 INFO L158 Benchmark]: Toolchain (without parser) took 266702.01ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 92.2MB in the beginning and 1.0GB in the end (delta: -916.7MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2024-11-27 23:30:40,750 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 83.9MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:30:40,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.55ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 72.3MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:30:40,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.19ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 68.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:30:40,751 INFO L158 Benchmark]: Boogie Preprocessor took 64.52ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 65.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:30:40,751 INFO L158 Benchmark]: RCFGBuilder took 953.60ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 81.8MB in the end (delta: -16.2MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-11-27 23:30:40,754 INFO L158 Benchmark]: TraceAbstraction took 264973.58ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 81.0MB in the beginning and 1.0GB in the end (delta: -936.2MB). Peak memory consumption was 640.4MB. Max. memory is 16.1GB. [2024-11-27 23:30:40,754 INFO L158 Benchmark]: Witness Printer took 122.02ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:30:40,756 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.46ms. Allocated memory is still 83.9MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.55ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 72.3MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.19ms. Allocated memory is still 117.4MB. Free memory was 72.3MB in the beginning and 68.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.52ms. Allocated memory is still 117.4MB. Free memory was 68.9MB in the beginning and 65.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 953.60ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 81.8MB in the end (delta: -16.2MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * TraceAbstraction took 264973.58ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 81.0MB in the beginning and 1.0GB in the end (delta: -936.2MB). Peak memory consumption was 640.4MB. Max. memory is 16.1GB. * Witness Printer took 122.02ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 8.3MB). 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 258.8s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 20 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 14 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 109.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 228.0s InterpolantComputationTime, 53 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 94 ConstructedInterpolants, 36 QuantifiedInterpolants, 321954 SizeOfPredicates, 37 NumberOfNonLiveVariables, 488 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 126/188 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((104 == var_81) && (0 == var_7)) && (0 == state_8)) && (1 == var_12)) && (1 == mask_SORT_1)) RESULT: Ultimate proved your program to be correct! [2024-11-27 23:30:40,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f214bf2e-aace-4962-b5ee-ea5f890e4053/bin/uautomizer-verify-aQ6SnzHsRB/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 Writing output log to file Ultimate.log Result: TRUE