./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/num_conversion_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:53:25,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:53:26,022 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:53:26,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:53:26,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:53:26,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:53:26,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:53:26,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:53:26,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:53:26,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:53:26,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:53:26,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:53:26,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:53:26,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:53:26,054 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:53:26,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:53:26,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:53:26,054 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:53:26,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:53:26,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:53:26,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:53:26,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:53:26,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:53:26,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:53:26,055 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:53:26,056 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:53:26,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:53:26,056 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:53:26,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:53:26,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:53:26,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:53:26,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:53:26,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:53:26,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:53:26,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:53:26,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:53:26,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:53:26,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:53:26,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:53:26,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:53:26,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:53:26,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:53:26,058 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_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 [2024-11-13 14:53:26,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:53:26,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:53:26,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:53:26,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:53:26,385 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:53:26,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/bitvector/num_conversion_2.c Unable to find full path for "g++" [2024-11-13 14:53:28,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:53:28,566 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:53:28,567 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/sv-benchmarks/c/bitvector/num_conversion_2.c [2024-11-13 14:53:28,586 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/data/72ce185c6/67f0d269ff4c492a8505a667f26d96c5/FLAG981629f36 [2024-11-13 14:53:28,852 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/data/72ce185c6/67f0d269ff4c492a8505a667f26d96c5 [2024-11-13 14:53:28,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:53:28,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:53:28,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:53:28,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:53:28,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:53:28,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:53:28" (1/1) ... [2024-11-13 14:53:28,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3676a870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:28, skipping insertion in model container [2024-11-13 14:53:28,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:53:28" (1/1) ... [2024-11-13 14:53:28,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:53:29,025 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_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/sv-benchmarks/c/bitvector/num_conversion_2.c[685,698] [2024-11-13 14:53:29,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:53:29,064 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:53:29,075 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_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/sv-benchmarks/c/bitvector/num_conversion_2.c[685,698] [2024-11-13 14:53:29,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:53:29,104 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:53:29,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29 WrapperNode [2024-11-13 14:53:29,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:53:29,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:53:29,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:53:29,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:53:29,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (1/1) ... [2024-11-13 14:53:29,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (1/1) ... [2024-11-13 14:53:29,148 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2024-11-13 14:53:29,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:53:29,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:53:29,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:53:29,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:53:29,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (1/1) ... [2024-11-13 14:53:29,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (1/1) ... [2024-11-13 14:53:29,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (1/1) ... [2024-11-13 14:53:29,176 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-13 14:53:29,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (1/1) ... [2024-11-13 14:53:29,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (1/1) ... [2024-11-13 14:53:29,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (1/1) ... [2024-11-13 14:53:29,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (1/1) ... [2024-11-13 14:53:29,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (1/1) ... [2024-11-13 14:53:29,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (1/1) ... [2024-11-13 14:53:29,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:53:29,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:53:29,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:53:29,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:53:29,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (1/1) ... [2024-11-13 14:53:29,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:53:29,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:29,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:53:29,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:53:29,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:53:29,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:53:29,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:53:29,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:53:29,342 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:53:29,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:53:29,536 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-13 14:53:29,536 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:53:29,545 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:53:29,545 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:53:29,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:53:29 BoogieIcfgContainer [2024-11-13 14:53:29,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:53:29,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:53:29,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:53:29,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:53:29,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:53:28" (1/3) ... [2024-11-13 14:53:29,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443bd8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:53:29, skipping insertion in model container [2024-11-13 14:53:29,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:29" (2/3) ... [2024-11-13 14:53:29,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443bd8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:53:29, skipping insertion in model container [2024-11-13 14:53:29,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:53:29" (3/3) ... [2024-11-13 14:53:29,556 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2024-11-13 14:53:29,572 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:53:29,576 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG num_conversion_2.c that has 1 procedures, 20 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:53:29,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:53:29,662 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;@3f0f1819, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:53:29,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:53:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 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-13 14:53:29,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 14:53:29,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:29,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 14:53:29,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:29,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash 889630855, now seen corresponding path program 1 times [2024-11-13 14:53:29,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:29,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308146432] [2024-11-13 14:53:29,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:29,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:29,951 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-13 14:53:29,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308146432] [2024-11-13 14:53:29,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308146432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:29,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:29,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:53:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112078118] [2024-11-13 14:53:29,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:29,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:53:29,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:29,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:53:29,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:53:29,983 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-13 14:53:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:30,022 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2024-11-13 14:53:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:53:30,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-13 14:53:30,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:30,030 INFO L225 Difference]: With dead ends: 47 [2024-11-13 14:53:30,031 INFO L226 Difference]: Without dead ends: 25 [2024-11-13 14:53:30,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:53:30,037 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:30,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 38 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:53:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-13 14:53:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2024-11-13 14:53:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-13 14:53:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-13 14:53:30,067 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 6 [2024-11-13 14:53:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:30,067 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-13 14:53:30,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-13 14:53:30,068 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-13 14:53:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 14:53:30,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:30,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:30,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:53:30,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:30,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:30,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1070268354, now seen corresponding path program 1 times [2024-11-13 14:53:30,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:30,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042535837] [2024-11-13 14:53:30,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:30,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:30,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:30,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042535837] [2024-11-13 14:53:30,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042535837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:30,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:30,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:53:30,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066680004] [2024-11-13 14:53:30,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:30,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:53:30,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:30,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:53:30,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:53:30,312 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-13 14:53:30,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:30,357 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-11-13 14:53:30,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:53:30,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-13 14:53:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:30,361 INFO L225 Difference]: With dead ends: 34 [2024-11-13 14:53:30,361 INFO L226 Difference]: Without dead ends: 20 [2024-11-13 14:53:30,362 INFO L431 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-13 14:53:30,363 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:30,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:53:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-13 14:53:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-13 14:53:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-13 14:53:30,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-13 14:53:30,373 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2024-11-13 14:53:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:30,373 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-13 14:53:30,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-13 14:53:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-13 14:53:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 14:53:30,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:30,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:30,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:53:30,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:30,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:30,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1013010052, now seen corresponding path program 1 times [2024-11-13 14:53:30,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:30,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726075075] [2024-11-13 14:53:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:30,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:30,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726075075] [2024-11-13 14:53:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726075075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:53:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156583337] [2024-11-13 14:53:30,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:30,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:30,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:30,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:30,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:53:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:30,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 14:53:30,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:30,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:53:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:31,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156583337] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:53:31,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:53:31,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 7] total 15 [2024-11-13 14:53:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455482968] [2024-11-13 14:53:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:31,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:53:31,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:31,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:53:31,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:53:31,182 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-13 14:53:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:31,500 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-13 14:53:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:53:31,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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 13 [2024-11-13 14:53:31,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:31,504 INFO L225 Difference]: With dead ends: 36 [2024-11-13 14:53:31,504 INFO L226 Difference]: Without dead ends: 32 [2024-11-13 14:53:31,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:53:31,505 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:31,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 42 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:53:31,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-13 14:53:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-13 14:53:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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-13 14:53:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-13 14:53:31,514 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2024-11-13 14:53:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:31,514 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-13 14:53:31,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-13 14:53:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-13 14:53:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 14:53:31,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:31,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:31,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:53:31,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:31,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:31,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:31,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1012977128, now seen corresponding path program 1 times [2024-11-13 14:53:31,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:31,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896235439] [2024-11-13 14:53:31,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:31,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:31,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:31,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896235439] [2024-11-13 14:53:31,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896235439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:53:31,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210095080] [2024-11-13 14:53:31,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:31,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:31,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:31,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:31,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:53:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:31,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 14:53:31,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:32,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:53:32,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210095080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:32,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:53:32,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2024-11-13 14:53:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157284272] [2024-11-13 14:53:32,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:32,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:53:32,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:32,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:53:32,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:53:32,026 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-13 14:53:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:32,096 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-11-13 14:53:32,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:53:32,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 14 [2024-11-13 14:53:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:32,098 INFO L225 Difference]: With dead ends: 69 [2024-11-13 14:53:32,098 INFO L226 Difference]: Without dead ends: 43 [2024-11-13 14:53:32,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:53:32,099 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:32,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 41 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:53:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-13 14:53:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2024-11-13 14:53:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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-13 14:53:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-13 14:53:32,110 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 14 [2024-11-13 14:53:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:32,111 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-13 14:53:32,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-13 14:53:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-13 14:53:32,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 14:53:32,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:32,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:32,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 14:53:32,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:32,312 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:32,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2006554415, now seen corresponding path program 1 times [2024-11-13 14:53:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:32,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327767193] [2024-11-13 14:53:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:32,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:32,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:32,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327767193] [2024-11-13 14:53:32,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327767193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:53:32,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572925602] [2024-11-13 14:53:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:32,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:32,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:32,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:32,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:53:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:32,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 14:53:32,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:32,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:53:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:33,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572925602] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:53:33,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:53:33,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 18 [2024-11-13 14:53:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819838049] [2024-11-13 14:53:33,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:53:33,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:53:33,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:33,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:53:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:53:33,133 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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-13 14:53:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:33,755 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2024-11-13 14:53:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 14:53:33,755 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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 21 [2024-11-13 14:53:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:33,756 INFO L225 Difference]: With dead ends: 165 [2024-11-13 14:53:33,756 INFO L226 Difference]: Without dead ends: 101 [2024-11-13 14:53:33,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2024-11-13 14:53:33,758 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 222 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:33,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 93 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:53:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-13 14:53:33,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2024-11-13 14:53:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 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-13 14:53:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 115 transitions. [2024-11-13 14:53:33,770 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 115 transitions. Word has length 21 [2024-11-13 14:53:33,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:33,770 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 115 transitions. [2024-11-13 14:53:33,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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-13 14:53:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2024-11-13 14:53:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 14:53:33,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:33,772 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:33,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:53:33,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:33,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:33,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:33,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1958944130, now seen corresponding path program 1 times [2024-11-13 14:53:33,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:33,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733954304] [2024-11-13 14:53:33,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:33,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:34,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:34,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733954304] [2024-11-13 14:53:34,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733954304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:53:34,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221529386] [2024-11-13 14:53:34,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:34,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:34,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:34,166 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:34,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:53:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:34,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 14:53:34,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 14:53:34,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:53:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 14:53:35,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221529386] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:53:35,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:53:35,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 16 [2024-11-13 14:53:35,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639140079] [2024-11-13 14:53:35,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:53:35,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 14:53:35,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:35,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 14:53:35,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:53:35,141 INFO L87 Difference]: Start difference. First operand 89 states and 115 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:53:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:36,380 INFO L93 Difference]: Finished difference Result 397 states and 521 transitions. [2024-11-13 14:53:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-13 14:53:36,380 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-13 14:53:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:36,388 INFO L225 Difference]: With dead ends: 397 [2024-11-13 14:53:36,388 INFO L226 Difference]: Without dead ends: 342 [2024-11-13 14:53:36,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2024-11-13 14:53:36,390 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 316 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:36,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 258 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:53:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-13 14:53:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 231. [2024-11-13 14:53:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.3130434782608695) internal successors, (302), 230 states have internal predecessors, (302), 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-13 14:53:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 302 transitions. [2024-11-13 14:53:36,417 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 302 transitions. Word has length 30 [2024-11-13 14:53:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:36,417 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 302 transitions. [2024-11-13 14:53:36,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:53:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 302 transitions. [2024-11-13 14:53:36,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 14:53:36,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:36,419 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:36,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:53:36,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:36,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:36,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:36,620 INFO L85 PathProgramCache]: Analyzing trace with hash 72940911, now seen corresponding path program 1 times [2024-11-13 14:53:36,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:36,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422094427] [2024-11-13 14:53:36,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:36,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 14:53:36,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:36,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422094427] [2024-11-13 14:53:36,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422094427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:36,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:36,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:53:36,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486192280] [2024-11-13 14:53:36,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:36,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:53:36,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:36,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:53:36,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:53:36,879 INFO L87 Difference]: Start difference. First operand 231 states and 302 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-13 14:53:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:36,929 INFO L93 Difference]: Finished difference Result 446 states and 589 transitions. [2024-11-13 14:53:36,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:53:36,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 38 [2024-11-13 14:53:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:36,932 INFO L225 Difference]: With dead ends: 446 [2024-11-13 14:53:36,932 INFO L226 Difference]: Without dead ends: 251 [2024-11-13 14:53:36,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:53:36,933 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:36,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:53:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-13 14:53:36,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2024-11-13 14:53:36,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.2735042735042734) internal successors, (298), 234 states have internal predecessors, (298), 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-13 14:53:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 298 transitions. [2024-11-13 14:53:36,980 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 298 transitions. Word has length 38 [2024-11-13 14:53:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:36,981 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 298 transitions. [2024-11-13 14:53:36,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-13 14:53:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 298 transitions. [2024-11-13 14:53:36,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 14:53:36,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:36,983 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:36,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:53:36,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:36,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1885131779, now seen corresponding path program 2 times [2024-11-13 14:53:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601645475] [2024-11-13 14:53:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:37,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:53:37,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601645475] [2024-11-13 14:53:37,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601645475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:53:37,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725041562] [2024-11-13 14:53:37,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:53:37,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:37,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:37,253 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:37,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:53:37,341 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:53:37,341 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:53:37,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:53:37,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:37,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:53:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:37,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725041562] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:53:37,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:53:37,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2024-11-13 14:53:37,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199581789] [2024-11-13 14:53:37,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:53:37,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 14:53:37,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:53:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 14:53:37,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:53:37,871 INFO L87 Difference]: Start difference. First operand 235 states and 298 transitions. Second operand has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 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-13 14:53:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:38,179 INFO L93 Difference]: Finished difference Result 640 states and 834 transitions. [2024-11-13 14:53:38,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:53:38,180 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 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-13 14:53:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:38,185 INFO L225 Difference]: With dead ends: 640 [2024-11-13 14:53:38,195 INFO L226 Difference]: Without dead ends: 534 [2024-11-13 14:53:38,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=354, Unknown=0, NotChecked=0, Total=552 [2024-11-13 14:53:38,197 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 236 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:38,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 385 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:53:38,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-13 14:53:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 398. [2024-11-13 14:53:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.2745591939546599) internal successors, (506), 397 states have internal predecessors, (506), 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-13 14:53:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 506 transitions. [2024-11-13 14:53:38,234 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 506 transitions. Word has length 39 [2024-11-13 14:53:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:38,235 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 506 transitions. [2024-11-13 14:53:38,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 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-13 14:53:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 506 transitions. [2024-11-13 14:53:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 14:53:38,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:38,238 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:38,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:53:38,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:38,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:38,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash -587744073, now seen corresponding path program 3 times [2024-11-13 14:53:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:53:38,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30738654] [2024-11-13 14:53:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:38,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:53:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:53:38,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:53:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:53:38,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:53:38,564 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:53:38,565 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:53:38,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:53:38,570 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:38,601 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:53:38,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:53:38 BoogieIcfgContainer [2024-11-13 14:53:38,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:53:38,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:53:38,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:53:38,606 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:53:38,607 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:53:29" (3/4) ... [2024-11-13 14:53:38,609 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:53:38,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:53:38,611 INFO L158 Benchmark]: Toolchain (without parser) took 9755.09ms. Allocated memory is still 117.4MB. Free memory was 94.5MB in the beginning and 66.1MB in the end (delta: 28.4MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-13 14:53:38,611 INFO L158 Benchmark]: CDTParser took 1.67ms. Allocated memory is still 167.8MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:53:38,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.37ms. Allocated memory is still 117.4MB. Free memory was 94.5MB in the beginning and 83.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:53:38,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.60ms. Allocated memory is still 117.4MB. Free memory was 83.3MB in the beginning and 81.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:53:38,612 INFO L158 Benchmark]: Boogie Preprocessor took 49.92ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 80.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:53:38,612 INFO L158 Benchmark]: RCFGBuilder took 345.96ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 69.4MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:53:38,613 INFO L158 Benchmark]: TraceAbstraction took 9057.24ms. Allocated memory is still 117.4MB. Free memory was 68.7MB in the beginning and 66.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:53:38,613 INFO L158 Benchmark]: Witness Printer took 4.58ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 66.1MB in the end (delta: 490.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:53:38,615 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.67ms. Allocated memory is still 167.8MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.37ms. Allocated memory is still 117.4MB. Free memory was 94.5MB in the beginning and 83.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.60ms. Allocated memory is still 117.4MB. Free memory was 83.3MB in the beginning and 81.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.92ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 80.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 345.96ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 69.4MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9057.24ms. Allocated memory is still 117.4MB. Free memory was 68.7MB in the beginning and 66.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.58ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 66.1MB in the end (delta: 490.7kB). There was no memory consumed. 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: 16]: 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 shiftLeft at line 31. Possible FailurePath: [L24] unsigned char x = __VERIFIER_nondet_uchar(); [L25] unsigned char y; [L26] unsigned char c; [L28] y = 0 [L29] c = 0 VAL [c=0, y=0] [L30] COND TRUE c < (unsigned char)8 VAL [c=0, y=0] [L31] EXPR ((unsigned char)1) << c VAL [c=0, y=0] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=0, i=1, x=1, y=0] [L32] unsigned char bit = x & i; [L33] COND TRUE bit != (unsigned char)0 [L34] y = y + i VAL [c=0, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=1, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=1, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=1, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=1, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=2, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=2, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=2, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=2, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=3, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=3, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=3, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=3, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=4, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=4, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=4, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=4, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=5, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=5, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=5, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=5, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=6, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=6, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=6, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=6, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=7, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=7, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=7, i=257, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND TRUE bit != (unsigned char)0 [L34] y = y + i VAL [c=7, x=1, y=2] [L36] c = c + ((unsigned char)1) [L30] COND FALSE !(c < (unsigned char)8) VAL [x=1, y=2] [L38] CALL __VERIFIER_assert(x == y) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 866 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 866 mSDsluCounter, 940 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 759 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1030 IncrementalHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 181 mSDtfsCounter, 1030 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 179 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred in iteration=8, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 296 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 377 ConstructedInterpolants, 0 QuantifiedInterpolants, 2334 SizeOfPredicates, 14 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 94/307 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:53:38,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/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_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:53:41,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:53:41,741 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:53:41,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:53:41,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:53:41,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:53:41,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:53:41,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:53:41,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:53:41,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:53:41,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:53:41,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:53:41,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:53:41,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:53:41,775 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:53:41,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:53:41,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:53:41,776 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:53:41,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:53:41,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:53:41,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:53:41,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:53:41,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:53:41,777 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:53:41,777 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:53:41,777 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:53:41,777 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:53:41,777 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:53:41,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:53:41,777 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:53:41,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:53:41,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:53:41,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:53:41,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:53:41,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:53:41,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:53:41,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:53:41,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:53:41,779 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:53:41,779 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:53:41,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:53:41,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:53:41,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:53:41,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:53:41,780 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_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 [2024-11-13 14:53:42,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:53:42,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:53:42,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:53:42,184 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:53:42,185 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:53:42,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/bitvector/num_conversion_2.c Unable to find full path for "g++" [2024-11-13 14:53:44,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:53:44,365 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:53:44,366 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/sv-benchmarks/c/bitvector/num_conversion_2.c [2024-11-13 14:53:44,376 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/data/9b713a79d/3d0c50805fb9402c83df9974f3800875/FLAG62763917d [2024-11-13 14:53:44,663 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/data/9b713a79d/3d0c50805fb9402c83df9974f3800875 [2024-11-13 14:53:44,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:53:44,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:53:44,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:53:44,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:53:44,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:53:44,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3086cb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44, skipping insertion in model container [2024-11-13 14:53:44,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:53:44,820 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_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/sv-benchmarks/c/bitvector/num_conversion_2.c[685,698] [2024-11-13 14:53:44,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:53:44,851 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:53:44,862 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_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/sv-benchmarks/c/bitvector/num_conversion_2.c[685,698] [2024-11-13 14:53:44,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:53:44,882 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:53:44,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44 WrapperNode [2024-11-13 14:53:44,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:53:44,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:53:44,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:53:44,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:53:44,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,914 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2024-11-13 14:53:44,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:53:44,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:53:44,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:53:44,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:53:44,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,937 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-13 14:53:44,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:53:44,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:53:44,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:53:44,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:53:44,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (1/1) ... [2024-11-13 14:53:44,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:53:44,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:44,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:53:44,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:53:45,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:53:45,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:53:45,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:53:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:53:45,098 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:53:45,100 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:53:45,216 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-13 14:53:45,216 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:53:45,230 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:53:45,230 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:53:45,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:53:45 BoogieIcfgContainer [2024-11-13 14:53:45,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:53:45,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:53:45,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:53:45,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:53:45,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:53:44" (1/3) ... [2024-11-13 14:53:45,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@decbf4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:53:45, skipping insertion in model container [2024-11-13 14:53:45,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:53:44" (2/3) ... [2024-11-13 14:53:45,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@decbf4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:53:45, skipping insertion in model container [2024-11-13 14:53:45,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:53:45" (3/3) ... [2024-11-13 14:53:45,245 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2024-11-13 14:53:45,261 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:53:45,263 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG num_conversion_2.c that has 1 procedures, 13 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:53:45,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:53:45,337 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;@38ae3ec7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:53:45,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:53:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-13 14:53:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 14:53:45,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:45,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 14:53:45,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:45,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:45,354 INFO L85 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2024-11-13 14:53:45,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:53:45,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592729171] [2024-11-13 14:53:45,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:45,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:45,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:45,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:45,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:53:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:45,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:53:45,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:45,466 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-13 14:53:45,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:53:45,467 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:53:45,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592729171] [2024-11-13 14:53:45,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592729171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:45,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:45,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:53:45,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354963011] [2024-11-13 14:53:45,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:45,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:53:45,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:53:45,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:53:45,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:53:45,501 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-13 14:53:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:45,515 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-13 14:53:45,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:53:45,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-13 14:53:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:45,526 INFO L225 Difference]: With dead ends: 21 [2024-11-13 14:53:45,526 INFO L226 Difference]: Without dead ends: 9 [2024-11-13 14:53:45,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:53:45,534 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:45,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:53:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-13 14:53:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-13 14:53:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-13 14:53:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-13 14:53:45,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2024-11-13 14:53:45,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:45,575 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-13 14:53:45,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-13 14:53:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-11-13 14:53:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 14:53:45,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:45,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 14:53:45,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:53:45,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:45,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:45,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:45,783 INFO L85 PathProgramCache]: Analyzing trace with hash 889610002, now seen corresponding path program 1 times [2024-11-13 14:53:45,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:53:45,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2051821464] [2024-11-13 14:53:45,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:45,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:45,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:45,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:45,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:53:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:45,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:53:45,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:45,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-13 14:53:45,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:53:45,897 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:53:45,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051821464] [2024-11-13 14:53:45,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051821464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:53:45,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:53:45,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:53:45,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62918900] [2024-11-13 14:53:45,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:53:45,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:53:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:53:45,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:53:45,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:53:45,900 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-13 14:53:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:45,919 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-13 14:53:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:53:45,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-13 14:53:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:45,920 INFO L225 Difference]: With dead ends: 16 [2024-11-13 14:53:45,920 INFO L226 Difference]: Without dead ends: 12 [2024-11-13 14:53:45,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:53:45,921 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:45,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:53:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-13 14:53:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2024-11-13 14:53:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) 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-13 14:53:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-11-13 14:53:45,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2024-11-13 14:53:45,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:45,925 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-13 14:53:45,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-13 14:53:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2024-11-13 14:53:45,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 14:53:45,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:45,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:45,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:53:46,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:46,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:46,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:46,127 INFO L85 PathProgramCache]: Analyzing trace with hash -332619814, now seen corresponding path program 1 times [2024-11-13 14:53:46,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:53:46,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794409654] [2024-11-13 14:53:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:53:46,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:46,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:46,130 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:46,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:53:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:53:46,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:53:46,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:46,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:53:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:46,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:53:46,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794409654] [2024-11-13 14:53:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794409654] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:53:46,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:53:46,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2024-11-13 14:53:46,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166683228] [2024-11-13 14:53:46,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:53:46,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:53:46,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:53:46,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:53:46,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:53:46,329 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-13 14:53:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:46,394 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2024-11-13 14:53:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:53:46,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 9 [2024-11-13 14:53:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:46,395 INFO L225 Difference]: With dead ends: 23 [2024-11-13 14:53:46,395 INFO L226 Difference]: Without dead ends: 19 [2024-11-13 14:53:46,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:53:46,396 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:46,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 32 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:53:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-13 14:53:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-13 14:53:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-13 14:53:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-13 14:53:46,402 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2024-11-13 14:53:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:46,402 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-13 14:53:46,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-13 14:53:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-13 14:53:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 14:53:46,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:46,403 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:46,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:53:46,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:46,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:46,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:46,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2024803054, now seen corresponding path program 2 times [2024-11-13 14:53:46,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:53:46,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867157566] [2024-11-13 14:53:46,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:53:46,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:46,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:46,610 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:46,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:53:46,686 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:53:46,686 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:53:46,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 14:53:46,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:46,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:53:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:47,087 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:53:47,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867157566] [2024-11-13 14:53:47,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867157566] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:53:47,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:53:47,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2024-11-13 14:53:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088683599] [2024-11-13 14:53:47,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:53:47,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 14:53:47,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:53:47,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 14:53:47,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:53:47,090 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-13 14:53:47,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:47,324 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2024-11-13 14:53:47,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:53:47,326 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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 18 [2024-11-13 14:53:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:47,327 INFO L225 Difference]: With dead ends: 41 [2024-11-13 14:53:47,328 INFO L226 Difference]: Without dead ends: 37 [2024-11-13 14:53:47,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:53:47,329 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:47,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 81 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:53:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-13 14:53:47,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-13 14:53:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 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-13 14:53:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-13 14:53:47,347 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 18 [2024-11-13 14:53:47,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:47,347 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-13 14:53:47,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-13 14:53:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-13 14:53:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 14:53:47,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:47,349 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:47,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:53:47,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:47,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:47,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:47,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2045283090, now seen corresponding path program 3 times [2024-11-13 14:53:47,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:53:47,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975793622] [2024-11-13 14:53:47,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:53:47,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:53:47,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:53:47,555 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:53:47,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:53:47,636 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-13 14:53:47,636 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:53:47,639 WARN L253 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-13 14:53:47,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:53:50,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:54:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:54:08,292 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:54:08,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975793622] [2024-11-13 14:54:08,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975793622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:54:08,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:54:08,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2024-11-13 14:54:08,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767125301] [2024-11-13 14:54:08,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:54:08,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-13 14:54:08,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:54:08,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-13 14:54:08,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=711, Invalid=2367, Unknown=2, NotChecked=0, Total=3080 [2024-11-13 14:54:08,298 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 56 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 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-13 14:54:19,903 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse39 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse39))))) (let ((.cse50 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse39)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 (_ bv1 32))))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse27)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse47)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse26)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse50)))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse51))))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse26)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse26)))) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse51)))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse6))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse37)))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse30)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 .cse30))))) (let ((.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse22)))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49)))) (.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse38)))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse28))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 .cse35)))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49)))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse41)))) (.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse44)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse42))))) (let ((.cse1 (bvslt .cse53 (_ bv8 32))) (.cse19 (bvslt .cse52 (_ bv8 32))) (.cse21 (bvslt .cse51 (_ bv8 32))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 .cse20)))) (.cse8 (= .cse50 .cse2)) (.cse33 (bvslt .cse49 (_ bv8 32))) (.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse12))))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse25)))) (.cse14 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse44))) (_ bv8 32))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse11)))) (.cse13 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse25))) (_ bv0 32))) (.cse15 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse28))))) (.cse17 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse11))) (_ bv0 32))) (.cse40 (bvslt .cse48 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse27))))) (.cse16 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse30))))) (.cse18 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse2))) (_ bv0 32))) (.cse4 (bvslt .cse47 (_ bv8 32))) (.cse0 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse7 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26)))))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse4 .cse5 (= .cse2 .cse6) .cse7) (or .cse8 .cse1) (or .cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))) .cse12))) .cse2) .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18) (or .cse19 (= .cse2 .cse20) .cse15 .cse16 .cse7 .cse18) (or .cse21 .cse16 (= .cse2 .cse22) .cse7) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse24)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse24)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse24)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse24))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse11)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse27))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse24))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse12))) .cse24) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse30))))))) (or .cse5 .cse1 (= .cse2 .cse31)) (or .cse19 .cse0 .cse15 .cse16 (= .cse32 .cse2) .cse7 .cse18) (or .cse33 (= .cse34 .cse2) .cse5 .cse13 .cse15 .cse16 .cse7 .cse18) (or .cse19 .cse5 (= .cse2 .cse35) .cse15 .cse16 .cse7 .cse18) (or .cse4 (= .cse2 .cse36) .cse7) (or .cse21 .cse5 (= .cse2 .cse37) .cse16 .cse7) (or .cse21 .cse0 (= .cse2 .cse38) .cse16 .cse7) (or (= .cse2 .cse10) .cse33 .cse13 .cse15 .cse16 .cse7 .cse18) (or (bvslt .cse39 (_ bv8 32)) .cse8) (or .cse40 .cse0 .cse16 (= .cse2 .cse41) .cse7 .cse18) (or .cse40 .cse16 (= .cse2 .cse42) .cse7 .cse18) (or .cse33 .cse0 .cse13 (= .cse2 .cse43) .cse15 .cse16 .cse7 .cse18) (or .cse9 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse43 .cse11))))))) .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse7 .cse18) (or .cse5 (= .cse29 .cse2) .cse13 .cse15 (bvslt .cse44 (_ bv8 32)) .cse16 .cse17 .cse7 .cse18) (or .cse40 (= .cse45 .cse2) .cse5 .cse16 .cse7 .cse18) (or (= .cse2 .cse46) .cse4 .cse0 .cse7)))))))))))) is different from false [2024-11-13 14:54:29,203 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:54:49,448 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse41 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse41))))) (let ((.cse50 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse41)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 (_ bv1 32))))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse27)))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse47)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse25)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse50)))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse51))))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse25)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse25)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse51)))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse6))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse38)))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse30)))) (.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse37 .cse30))))) (let ((.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse21)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse34)))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse39)))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse28))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse36)))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse43)))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse44)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse34))))) (let ((.cse1 (bvslt .cse53 (_ bv8 32))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse19))) .cse26)))) (.cse18 (bvslt .cse52 (_ bv8 32))) (.cse20 (bvslt .cse51 (_ bv8 32))) (.cse8 (= .cse50 .cse2)) (.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse11))))) (.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse24))) .cse26)))) (.cse13 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49))) (_ bv8 32))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse26)))) (.cse12 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse24))) (_ bv0 32))) (.cse14 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse28))))) (.cse33 (bvslt .cse49 (_ bv8 32))) (.cse16 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26))) (_ bv0 32))) (.cse42 (bvslt .cse48 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse27))))) (.cse15 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse30))))) (.cse17 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse2))) (_ bv0 32))) (.cse4 (bvslt .cse47 (_ bv8 32))) (.cse0 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse7 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse25)))))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse4 .cse5 (= .cse2 .cse6) .cse7) (or .cse8 .cse1) (or .cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))) .cse2) .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse18 (= .cse2 .cse19) .cse14 .cse15 .cse7 .cse17) (or .cse20 .cse15 (= .cse2 .cse21) .cse7) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse23)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse23)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse23))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse26)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse27))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse23))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse11))) .cse23) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse30))))))) (or .cse5 .cse1 (= .cse2 .cse31)) (or .cse18 .cse0 .cse14 .cse15 (= .cse32 .cse2) .cse7 .cse17) (or (= .cse10 .cse2) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or (bvslt .cse34 (_ bv8 32)) (= .cse35 .cse2) .cse5 .cse12 .cse14 .cse15 .cse7 .cse17) (or .cse18 .cse5 (= .cse2 .cse36) .cse14 .cse15 .cse7 .cse17) (or .cse4 (= .cse2 .cse37) .cse7) (or .cse20 .cse5 (= .cse2 .cse38) .cse15 .cse7) (or .cse20 .cse0 (= .cse2 .cse39) .cse15 .cse7) (or .cse0 (= .cse2 .cse40) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or (bvslt .cse41 (_ bv8 32)) .cse8) (or .cse42 .cse0 .cse15 (= .cse2 .cse43) .cse7 .cse17) (or .cse42 .cse15 (= .cse2 .cse44) .cse7 .cse17) (or .cse9 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse40)))) .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse5 (= .cse29 .cse2) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or .cse42 (= .cse45 .cse2) .cse5 .cse15 .cse7 .cse17) (or (= .cse2 .cse46) .cse4 .cse0 .cse7)))))))))))) is different from false [2024-11-13 14:55:09,272 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:55:27,022 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse40 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse40))))) (let ((.cse51 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse40)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))) (let ((.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 (_ bv1 32))))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse51 .cse25)))) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53))))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse47)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse23)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse51)))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse51 .cse23)))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse23)))) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse6))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse36)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse28)))) (.cse50 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse33)))) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse28))))) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse19)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse50)))) (.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse37)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse33)))) (.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse26))))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse34)))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse42))) .cse22)))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse43))))))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse50))))) (let ((.cse1 (bvslt .cse53 (_ bv8 32))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse39 .cse24)))) (.cse18 (bvslt .cse52 (_ bv8 32))) (.cse8 (= .cse51 .cse2)) (.cse31 (bvslt .cse50 (_ bv8 32))) (.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse11))))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse44 .cse24)))) (.cse13 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49))) (_ bv8 32))) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse24)))) (.cse12 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse22))) (_ bv0 32))) (.cse14 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26))))) (.cse30 (bvslt .cse49 (_ bv8 32))) (.cse16 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse24))) (_ bv0 32))) (.cse41 (bvslt .cse48 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse25))))) (.cse15 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse28))))) (.cse17 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse2))) (_ bv0 32))) (.cse4 (bvslt .cse47 (_ bv8 32))) (.cse0 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse7 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse23)))))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse4 .cse5 (= .cse2 .cse6) .cse7) (or .cse8 .cse1) (or .cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))) .cse2) .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse18 .cse15 (= .cse2 .cse19) .cse7) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse21)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse21)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse21)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse21))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse24)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse25))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse21))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 .cse11))) .cse21) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse28))))))) (or .cse5 .cse1 (= .cse2 .cse29)) (or (= .cse10 .cse2) .cse12 .cse14 .cse30 .cse15 .cse16 .cse7 .cse17) (or .cse31 (= .cse32 .cse2) .cse5 .cse12 .cse14 .cse15 .cse7 .cse17) (or (bvslt .cse33 (_ bv8 32)) .cse5 (= .cse2 .cse34) .cse14 .cse15 .cse7 .cse17) (or .cse4 (= .cse2 .cse35) .cse7) (or .cse18 .cse5 (= .cse2 .cse36) .cse15 .cse7) (or .cse18 .cse0 (= .cse2 .cse37) .cse15 .cse7) (or .cse0 (= .cse2 .cse38) .cse12 .cse14 .cse30 .cse15 .cse16 .cse7 .cse17) (or (= .cse2 .cse39) .cse31 .cse12 .cse14 .cse15 .cse7 .cse17) (or (bvslt .cse40 (_ bv8 32)) .cse8) (or .cse41 .cse0 .cse15 (= .cse2 .cse42) .cse7 .cse17) (or .cse41 .cse15 (= .cse2 .cse43) .cse7 .cse17) (or .cse31 .cse0 .cse12 (= .cse2 .cse44) .cse14 .cse15 .cse7 .cse17) (or .cse9 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse38)))) .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse5 (= .cse27 .cse2) .cse12 .cse14 .cse30 .cse15 .cse16 .cse7 .cse17) (or .cse41 (= .cse45 .cse2) .cse5 .cse15 .cse7 .cse17) (or (= .cse2 .cse46) .cse4 .cse0 .cse7)))))))))))) is different from false [2024-11-13 14:55:41,966 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 139 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:55:50,654 WARN L286 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 144 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:56:07,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse42 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse42))))) (let ((.cse50 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse42)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 (_ bv1 32))))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse27)))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse47)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse25)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse50)))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse51))))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse25)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse44)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse25)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse51)))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse6))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse38)))) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse30)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse44)))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse37 .cse30))))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse21))))))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49)))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse39))))))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse28))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse36)))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse24)))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse19)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49))))) (let ((.cse1 (bvslt .cse53 (_ bv8 32))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse41 .cse26)))) (.cse18 (bvslt .cse52 (_ bv8 32))) (.cse20 (bvslt .cse51 (_ bv8 32))) (.cse8 (= .cse50 .cse2)) (.cse34 (bvslt .cse49 (_ bv8 32))) (.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse11))))) (.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse43 .cse26)))) (.cse13 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48))) (_ bv8 32))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse26)))) (.cse12 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse24))) (_ bv0 32))) (.cse14 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse28))))) (.cse33 (bvslt .cse48 (_ bv8 32))) (.cse16 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26))) (_ bv0 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse27))))) (.cse15 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse30))))) (.cse17 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse2))) (_ bv0 32))) (.cse4 (bvslt .cse47 (_ bv8 32))) (.cse0 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse7 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse25)))))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse4 .cse5 (= .cse2 .cse6) .cse7) (or .cse8 .cse1) (or .cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))) .cse2) .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse18 (= .cse2 .cse19) .cse14 .cse15 .cse7 .cse17) (or .cse20 .cse15 (= .cse2 .cse21) .cse7) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse23)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse23)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse23))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse26)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse27))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse23))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse11))) .cse23) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse30))))))) (or .cse5 .cse1 (= .cse2 .cse31)) (or .cse18 .cse0 .cse14 .cse15 (= .cse32 .cse2) .cse7 .cse17) (or (= .cse10 .cse2) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or .cse34 (= .cse35 .cse2) .cse5 .cse12 .cse14 .cse15 .cse7 .cse17) (or .cse18 .cse5 (= .cse2 .cse36) .cse14 .cse15 .cse7 .cse17) (or .cse4 (= .cse2 .cse37) .cse7) (or .cse20 .cse5 (= .cse2 .cse38) .cse15 .cse7) (or .cse20 .cse0 (= .cse2 .cse39) .cse15 .cse7) (or .cse0 (= .cse2 .cse40) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or (= .cse2 .cse41) .cse34 .cse12 .cse14 .cse15 .cse7 .cse17) (or (bvslt .cse42 (_ bv8 32)) .cse8) (or .cse34 .cse0 .cse12 (= .cse2 .cse43) .cse14 .cse15 .cse7 .cse17) (or .cse9 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse40)))) .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse5 (= .cse29 .cse2) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or (bvslt .cse44 (_ bv8 32)) (= .cse45 .cse2) .cse5 .cse15 .cse7 .cse17) (or (= .cse2 .cse46) .cse4 .cse0 .cse7)))))))))))) is different from false [2024-11-13 14:56:20,114 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:56:35,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse40 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse40))))) (let ((.cse51 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse40)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 (_ bv1 32))))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse51 .cse25)))) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53))))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse47)))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse23)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse51)))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse36))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse51 .cse23)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse23)))) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse36)))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse6))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse37)))) (.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse28))))))) (.cse50 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse28)))))))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse43)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse50)))) (.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse42)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse26))))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse34)))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse22)))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse19)))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse50))))) (let ((.cse1 (bvslt .cse53 (_ bv8 32))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse39 .cse24)))) (.cse18 (bvslt .cse52 (_ bv8 32))) (.cse8 (= .cse51 .cse2)) (.cse32 (bvslt .cse50 (_ bv8 32))) (.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse11))))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse44 .cse24)))) (.cse13 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49))) (_ bv8 32))) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse33 .cse24)))) (.cse12 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse22))) (_ bv0 32))) (.cse14 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26))))) (.cse31 (bvslt .cse49 (_ bv8 32))) (.cse16 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse24))) (_ bv0 32))) (.cse41 (bvslt .cse48 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse25))))) (.cse15 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse28))))) (.cse17 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse2))) (_ bv0 32))) (.cse4 (bvslt .cse47 (_ bv8 32))) (.cse0 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse7 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse23)))))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse4 .cse5 (= .cse2 .cse6) .cse7) (or .cse8 .cse1) (or .cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))) .cse2) .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse18 (= .cse2 .cse19) .cse14 .cse15 .cse7 .cse17) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse21)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse21)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse21)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse21))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse24)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse25))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse21))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 .cse11))) .cse21) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse28))))))) (or .cse5 .cse1 (= .cse2 .cse29)) (or .cse18 .cse0 .cse14 .cse15 (= .cse30 .cse2) .cse7 .cse17) (or (= .cse10 .cse2) .cse12 .cse14 .cse31 .cse15 .cse16 .cse7 .cse17) (or .cse32 (= .cse33 .cse2) .cse5 .cse12 .cse14 .cse15 .cse7 .cse17) (or .cse18 .cse5 (= .cse2 .cse34) .cse14 .cse15 .cse7 .cse17) (or .cse4 (= .cse2 .cse35) .cse7) (or (bvslt .cse36 (_ bv8 32)) .cse5 (= .cse2 .cse37) .cse15 .cse7) (or .cse0 (= .cse2 .cse38) .cse12 .cse14 .cse31 .cse15 .cse16 .cse7 .cse17) (or (= .cse2 .cse39) .cse32 .cse12 .cse14 .cse15 .cse7 .cse17) (or (bvslt .cse40 (_ bv8 32)) .cse8) (or .cse41 .cse0 .cse15 (= .cse2 .cse42) .cse7 .cse17) (or .cse41 .cse15 (= .cse2 .cse43) .cse7 .cse17) (or .cse32 .cse0 .cse12 (= .cse2 .cse44) .cse14 .cse15 .cse7 .cse17) (or .cse9 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse38)))) .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse5 (= .cse27 .cse2) .cse12 .cse14 .cse31 .cse15 .cse16 .cse7 .cse17) (or .cse41 (= .cse45 .cse2) .cse5 .cse15 .cse7 .cse17) (or (= .cse2 .cse46) .cse4 .cse0 .cse7)))))))))))) is different from false [2024-11-13 14:57:00,985 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse41 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse41))))) (let ((.cse50 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse41)))) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 (_ bv1 32))))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse27)))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53))))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse25)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse50)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse51)))) (.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse4))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse50 .cse25))) .cse30)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse47)))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse25))) .cse30)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse51)))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse6))))) (let ((.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse37)))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse38)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse47)))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 .cse21))))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse44)))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49)))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse43)))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse28))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse36)))) (.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 .cse24)))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse19)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49))))) (let ((.cse1 (bvslt .cse53 (_ bv8 32))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse40 .cse26)))) (.cse18 (bvslt .cse52 (_ bv8 32))) (.cse20 (bvslt .cse51 (_ bv8 32))) (.cse8 (= .cse50 .cse2)) (.cse34 (bvslt .cse49 (_ bv8 32))) (.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse11))))) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse26)))) (.cse0 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse13 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48))) (_ bv8 32))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse26)))) (.cse12 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse24))) (_ bv0 32))) (.cse14 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse28))))) (.cse33 (bvslt .cse48 (_ bv8 32))) (.cse16 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26))) (_ bv0 32))) (.cse42 (bvslt .cse47 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse27))))) (.cse15 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse30))))) (.cse7 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse25))))) (.cse17 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse2))) (_ bv0 32)))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or (bvslt .cse4 (_ bv8 32)) .cse5 (= .cse2 .cse6) .cse7) (or .cse8 .cse1) (or .cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 .cse11))) .cse2) .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse18 (= .cse2 .cse19) .cse14 .cse15 .cse7 .cse17) (or .cse20 .cse15 (= .cse2 .cse21) .cse7) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse23)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse23)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse23))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse26)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse27))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse23))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse11))) .cse23) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse30))))))) (or .cse5 .cse1 (= .cse2 .cse31)) (or .cse18 .cse0 .cse14 .cse15 (= .cse32 .cse2) .cse7 .cse17) (or (= .cse10 .cse2) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or .cse34 (= .cse35 .cse2) .cse5 .cse12 .cse14 .cse15 .cse7 .cse17) (or .cse18 .cse5 (= .cse2 .cse36) .cse14 .cse15 .cse7 .cse17) (or .cse20 .cse5 (= .cse2 .cse37) .cse15 .cse7) (or .cse20 .cse0 (= .cse2 .cse38) .cse15 .cse7) (or .cse0 (= .cse2 .cse39) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or (= .cse2 .cse40) .cse34 .cse12 .cse14 .cse15 .cse7 .cse17) (or (bvslt .cse41 (_ bv8 32)) .cse8) (or .cse42 .cse0 .cse15 (= .cse2 .cse43) .cse7 .cse17) (or .cse42 .cse15 (= .cse2 .cse44) .cse7 .cse17) (or .cse34 .cse0 .cse12 (= .cse2 .cse45) .cse14 .cse15 .cse7 .cse17) (or .cse9 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse39)))) .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse7 .cse17) (or .cse5 (= .cse29 .cse2) .cse12 .cse14 .cse33 .cse15 .cse16 .cse7 .cse17) (or .cse42 (= .cse46 .cse2) .cse5 .cse15 .cse7 .cse17)))))))))))) is different from false [2024-11-13 14:57:23,599 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse40 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse40))))) (let ((.cse41 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse40)))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse27))))) (let ((.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse48 (_ bv1 32))))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse41 .cse23)))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse27))))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse21)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse41))) .cse21)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse41 .cse21)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48))))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse26)))) (.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49)))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 .cse26)))) (.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse3))))) (let ((.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 .cse36)))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 .cse37)))) (.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53)))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49)))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 .cse17))))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse44)))) (.cse50 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse51)))) (.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse43)))) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53)))) (.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse24))))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse34)))) (.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 .cse20)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse50)))) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse15)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse51))))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse39 .cse22)))) (.cse14 (bvslt .cse53 (_ bv8 32))) (.cse16 (bvslt .cse52 (_ bv8 32))) (.cse32 (bvslt .cse51 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse7))))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse22)))) (.cse9 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse50))) (_ bv8 32))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse33 .cse22)))) (.cse8 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse20))) (_ bv0 32))) (.cse10 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse24))))) (.cse31 (bvslt .cse50 (_ bv8 32))) (.cse12 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse22))) (_ bv0 32))) (.cse42 (bvslt .cse49 (_ bv8 32))) (.cse1 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse23))))) (.cse11 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26))))) (.cse13 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse2))) (_ bv0 32))) (.cse0 (bvslt .cse48 (_ bv8 32))) (.cse29 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse4 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse21)))))) (and (or .cse0 .cse1 (= .cse2 .cse3) .cse4) (or .cse5 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 .cse7))) .cse2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse4 .cse13) (or .cse14 (= .cse2 .cse15) .cse10 .cse11 .cse4 .cse13) (or .cse16 .cse11 (= .cse2 .cse17) .cse4) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse19)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse19)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse19)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse19))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse22)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse23))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse19))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 .cse7))) .cse19) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse26))))))) (or .cse1 (bvslt .cse27 (_ bv8 32)) (= .cse2 .cse28)) (or .cse14 .cse29 .cse10 .cse11 (= .cse30 .cse2) .cse4 .cse13) (or (= .cse6 .cse2) .cse8 .cse10 .cse31 .cse11 .cse12 .cse4 .cse13) (or .cse32 (= .cse33 .cse2) .cse1 .cse8 .cse10 .cse11 .cse4 .cse13) (or .cse14 .cse1 (= .cse2 .cse34) .cse10 .cse11 .cse4 .cse13) (or .cse0 (= .cse2 .cse35) .cse4) (or .cse16 .cse1 (= .cse2 .cse36) .cse11 .cse4) (or .cse16 .cse29 (= .cse2 .cse37) .cse11 .cse4) (or .cse29 (= .cse2 .cse38) .cse8 .cse10 .cse31 .cse11 .cse12 .cse4 .cse13) (or (= .cse2 .cse39) .cse32 .cse8 .cse10 .cse11 .cse4 .cse13) (or (bvslt .cse40 (_ bv8 32)) (= .cse41 .cse2)) (or .cse42 .cse29 .cse11 (= .cse2 .cse43) .cse4 .cse13) (or .cse42 .cse11 (= .cse2 .cse44) .cse4 .cse13) (or .cse32 .cse29 .cse8 (= .cse2 .cse45) .cse10 .cse11 .cse4 .cse13) (or .cse5 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 .cse38)))) .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse4 .cse13) (or .cse1 (= .cse25 .cse2) .cse8 .cse10 .cse31 .cse11 .cse12 .cse4 .cse13) (or .cse42 (= .cse46 .cse2) .cse1 .cse11 .cse4 .cse13) (or (= .cse2 .cse47) .cse0 .cse29 .cse4)))))))))))) is different from false [2024-11-13 14:57:45,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse53 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse53))))) (let ((.cse27 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse53)))) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse28))))) (let ((.cse51 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse47 (_ bv1 32))))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 .cse23)))) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse28))))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse21)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse27))) .cse21)))) (.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse51)))) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 .cse21)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse47))))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse36 .cse26)))) (.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse48)))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse46 .cse26)))) (.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse51)))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse3))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 .cse37)))) (.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 .cse38)))) (.cse50 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse52)))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse48)))) (.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 .cse17))))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse43)))) (.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse50)))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 .cse42)))) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse52)))) (.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse24))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse35)))) (.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 .cse20)))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse49)))) (.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse15)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse50))))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse40 .cse22)))) (.cse14 (bvslt .cse52 (_ bv8 32))) (.cse16 (bvslt .cse51 (_ bv8 32))) (.cse33 (bvslt .cse50 (_ bv8 32))) (.cse5 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse7))))) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse44 .cse22)))) (.cse9 (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse49))) (_ bv8 32))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse22)))) (.cse8 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse20))) (_ bv0 32))) (.cse10 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse24))))) (.cse32 (bvslt .cse49 (_ bv8 32))) (.cse12 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse22))) (_ bv0 32))) (.cse41 (bvslt .cse48 (_ bv8 32))) (.cse1 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse23))))) (.cse11 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse26))))) (.cse13 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse2))) (_ bv0 32))) (.cse0 (bvslt .cse47 (_ bv8 32))) (.cse30 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse4 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse21)))))) (and (or .cse0 .cse1 (= .cse2 .cse3) .cse4) (or .cse5 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 .cse7))) .cse2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse4 .cse13) (or .cse14 (= .cse2 .cse15) .cse10 .cse11 .cse4 .cse13) (or .cse16 .cse11 (= .cse2 .cse17) .cse4) (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse19)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse19)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse19)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse19))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse22)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse23))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse24 .cse19))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 .cse7))) .cse19) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse26))))))) (= .cse27 .cse2) (or .cse1 (bvslt .cse28 (_ bv8 32)) (= .cse2 .cse29)) (or .cse14 .cse30 .cse10 .cse11 (= .cse31 .cse2) .cse4 .cse13) (or (= .cse6 .cse2) .cse8 .cse10 .cse32 .cse11 .cse12 .cse4 .cse13) (or .cse33 (= .cse34 .cse2) .cse1 .cse8 .cse10 .cse11 .cse4 .cse13) (or .cse14 .cse1 (= .cse2 .cse35) .cse10 .cse11 .cse4 .cse13) (or .cse0 (= .cse2 .cse36) .cse4) (or .cse16 .cse1 (= .cse2 .cse37) .cse11 .cse4) (or .cse16 .cse30 (= .cse2 .cse38) .cse11 .cse4) (or .cse30 (= .cse2 .cse39) .cse8 .cse10 .cse32 .cse11 .cse12 .cse4 .cse13) (or (= .cse2 .cse40) .cse33 .cse8 .cse10 .cse11 .cse4 .cse13) (or .cse41 .cse30 .cse11 (= .cse2 .cse42) .cse4 .cse13) (or .cse41 .cse11 (= .cse2 .cse43) .cse4 .cse13) (or .cse33 .cse30 .cse8 (= .cse2 .cse44) .cse10 .cse11 .cse4 .cse13) (or .cse5 (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 .cse39)))) .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse4 .cse13) (or .cse1 (= .cse25 .cse2) .cse8 .cse10 .cse32 .cse11 .cse12 .cse4 .cse13) (or .cse41 (= .cse45 .cse2) .cse1 .cse11 .cse4 .cse13) (or (= .cse2 .cse46) .cse0 .cse30 .cse4)))))))))))) is different from false [2024-11-13 14:57:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:54,856 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2024-11-13 14:57:54,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-13 14:57:54,857 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 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 30 [2024-11-13 14:57:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:54,860 INFO L225 Difference]: With dead ends: 258 [2024-11-13 14:57:54,861 INFO L226 Difference]: Without dead ends: 243 [2024-11-13 14:57:54,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 200.7s TimeCoverageRelationStatistics Valid=1752, Invalid=5752, Unknown=10, NotChecked=1416, Total=8930 [2024-11-13 14:57:54,871 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 96 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 424 IncrementalHoareTripleChecker+Unchecked, 44.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:54,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 101 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 866 Invalid, 0 Unknown, 424 Unchecked, 44.0s Time] [2024-11-13 14:57:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-13 14:57:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 183. [2024-11-13 14:57:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.3241758241758241) internal successors, (241), 182 states have internal predecessors, (241), 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-13 14:57:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 241 transitions. [2024-11-13 14:57:54,956 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 241 transitions. Word has length 30 [2024-11-13 14:57:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:54,956 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 241 transitions. [2024-11-13 14:57:54,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 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-13 14:57:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 241 transitions. [2024-11-13 14:57:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 14:57:54,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:54,958 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1] [2024-11-13 14:57:54,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:57:55,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:57:55,159 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:55,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1512367534, now seen corresponding path program 1 times [2024-11-13 14:57:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:57:55,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433065141] [2024-11-13 14:57:55,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:55,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:57:55,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:57:55,162 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:57:55,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:57:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:55,213 WARN L253 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-13 14:57:55,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:58:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:58:55,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:00:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 7 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:00:36,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:00:36,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433065141] [2024-11-13 15:00:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433065141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:00:36,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:00:36,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-13 15:00:36,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041079936] [2024-11-13 15:00:36,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:00:36,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-13 15:00:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:00:36,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-13 15:00:36,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=2261, Unknown=0, NotChecked=0, Total=2652 [2024-11-13 15:00:36,333 INFO L87 Difference]: Start difference. First operand 183 states and 241 transitions. Second operand has 52 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 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-13 15:01:27,293 WARN L286 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 162 DAG size of output: 198 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:01:40,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:01:45,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:01:47,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:01:57,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:02:03,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:02:04,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 15:02:39,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse32 ((_ zero_extend 24) |c_ULTIMATE.start_main_~c~0#1|))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse32))))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse31))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse33 (_ bv1 32)))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse34))))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse30))))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse25))))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse34)))) (.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse33)))) (.cse28 ((_ zero_extend 24) |c_ULTIMATE.start_main_~y~0#1|)) (.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse32)))) (.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse31)))) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse29)))) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~x~0#1|)) (.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse25))))) (let ((.cse2 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse5))) (_ bv0 32))) (.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse29)))) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse27)))) (.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse16))) .cse15)))))))))) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse30))))) (let ((.cse1 (= (_ bv0 32) ((_ zero_extend 24) |c_ULTIMATE.start_main_~bit~0#1|))) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~i~0#1|) .cse28))) .cse15))) .cse19)))))))))) (.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse17)))) (.cse21 (not (bvslt .cse29 (_ bv8 32)))) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse15))) .cse19)))))))))) (.cse0 (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse20)))))) (.cse8 (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse18))) (_ bv0 32)))) (.cse9 (not (bvslt .cse27 (_ bv8 32)))) (.cse23 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse16))))) (.cse6 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse17))))) (.cse7 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse19))))) (.cse22 (not .cse2)) (.cse10 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse15))))) (.cse11 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse3))) (_ bv0 32)))) (and (or .cse0 .cse1 .cse2 (= .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 .cse5)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse13 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse13)))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse13)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 .cse14))) .cse13) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse13))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 .cse16))) (_ bv0 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse13))) (_ bv0 32)) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 .cse18))))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 .cse19)))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse13)))))))) .cse9) (or .cse1 .cse21 .cse6 .cse7 .cse22 .cse8 (= .cse4 .cse3) .cse10 .cse11) (or .cse23 (= .cse3 .cse14) .cse21 .cse6 .cse7 .cse22 .cse8 .cse10 .cse11) (or (= .cse3 .cse24) .cse21 .cse6 .cse7 .cse22 .cse8 .cse10 .cse11) (or (= .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 .cse24)))) .cse0 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not (bvslt .cse25 (_ bv8 32))) (= .cse26 .cse3) .cse23 (not .cse6) .cse7 .cse22 .cse10 .cse11)))))))))))) is different from false [2024-11-13 15:03:39,082 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 15:03:39,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-13 15:03:39,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 15:03:39,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 251.3s TimeCoverageRelationStatistics Valid=660, Invalid=3499, Unknown=5, NotChecked=126, Total=4290 [2024-11-13 15:03:39,084 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 30 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 50.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:39,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 461 Invalid, 4 Unknown, 48 Unchecked, 50.5s Time] [2024-11-13 15:03:39,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 15:03:39,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:03:39,286 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 48 more [2024-11-13 15:03:39,291 INFO L158 Benchmark]: Toolchain (without parser) took 594623.65ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 60.8MB in the beginning and 60.1MB in the end (delta: 686.1kB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2024-11-13 15:03:39,291 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 64.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:03:39,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.29ms. Allocated memory is still 83.9MB. Free memory was 60.5MB in the beginning and 49.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:03:39,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.70ms. Allocated memory is still 83.9MB. Free memory was 49.3MB in the beginning and 48.4MB in the end (delta: 915.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:03:39,293 INFO L158 Benchmark]: Boogie Preprocessor took 36.90ms. Allocated memory is still 83.9MB. Free memory was 48.4MB in the beginning and 47.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:03:39,293 INFO L158 Benchmark]: RCFGBuilder took 278.59ms. Allocated memory is still 83.9MB. Free memory was 47.1MB in the beginning and 36.9MB in the end (delta: 10.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:03:39,294 INFO L158 Benchmark]: TraceAbstraction took 594057.14ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 36.3MB in the beginning and 60.1MB in the end (delta: -23.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-13 15:03:39,295 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.33ms. Allocated memory is still 83.9MB. Free memory is still 64.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.29ms. Allocated memory is still 83.9MB. Free memory was 60.5MB in the beginning and 49.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.70ms. Allocated memory is still 83.9MB. Free memory was 49.3MB in the beginning and 48.4MB in the end (delta: 915.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.90ms. Allocated memory is still 83.9MB. Free memory was 48.4MB in the beginning and 47.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 278.59ms. Allocated memory is still 83.9MB. Free memory was 47.1MB in the beginning and 36.9MB in the end (delta: 10.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 594057.14ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 36.3MB in the beginning and 60.1MB in the end (delta: -23.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6e9c1be-bd4c-4710-a2b0-68f933f7b4ab/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")