./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.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_6e570152-dc58-41e1-9444-953be30b18ef/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/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_6e570152-dc58-41e1-9444-953be30b18ef/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/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_6e570152-dc58-41e1-9444-953be30b18ef/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 f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:47:10,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:47:10,597 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 12:47:10,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:47:10,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:47:10,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:47:10,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:47:10,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:47:10,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:47:10,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:47:10,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:47:10,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:47:10,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:47:10,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:47:10,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:47:10,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:47:10,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:47:10,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:47:10,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:47:10,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:47:10,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:47:10,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:47:10,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:47:10,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:47:10,657 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:47:10,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:47:10,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:47:10,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:47:10,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:47:10,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:47:10,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:47:10,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:47:10,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:47:10,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:47:10,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:47:10,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:47:10,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:47:10,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:47:10,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:47:10,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:47:10,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:47:10,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:47:10,664 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/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 -> f8ead2a6759acdf787a08f1ff38320ba759d869365709db6ba95cb561ffe0161 [2024-11-13 12:47:11,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:47:11,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:47:11,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:47:11,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:47:11,045 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:47:11,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/eca-rers2012/Problem02_label16.c Unable to find full path for "g++" [2024-11-13 12:47:13,100 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:47:13,536 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:47:13,537 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/sv-benchmarks/c/eca-rers2012/Problem02_label16.c [2024-11-13 12:47:13,551 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/bin/uautomizer-verify-qhAvR1uOyd/data/dabd6d6d8/30b2b8855f24476fa2277cd851c3a2af/FLAG23cbade36 [2024-11-13 12:47:13,572 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/bin/uautomizer-verify-qhAvR1uOyd/data/dabd6d6d8/30b2b8855f24476fa2277cd851c3a2af [2024-11-13 12:47:13,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:47:13,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:47:13,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:47:13,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:47:13,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:47:13,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:47:13" (1/1) ... [2024-11-13 12:47:13,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca15ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:13, skipping insertion in model container [2024-11-13 12:47:13,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:47:13" (1/1) ... [2024-11-13 12:47:13,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:47:13,994 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_6e570152-dc58-41e1-9444-953be30b18ef/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325] [2024-11-13 12:47:14,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:47:14,064 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:47:14,223 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_6e570152-dc58-41e1-9444-953be30b18ef/sv-benchmarks/c/eca-rers2012/Problem02_label16.c[15312,15325] [2024-11-13 12:47:14,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:47:14,263 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:47:14,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14 WrapperNode [2024-11-13 12:47:14,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:47:14,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:47:14,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:47:14,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:47:14,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (1/1) ... [2024-11-13 12:47:14,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (1/1) ... [2024-11-13 12:47:14,365 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-13 12:47:14,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:47:14,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:47:14,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:47:14,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:47:14,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (1/1) ... [2024-11-13 12:47:14,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (1/1) ... [2024-11-13 12:47:14,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (1/1) ... [2024-11-13 12:47:14,404 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 12:47:14,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (1/1) ... [2024-11-13 12:47:14,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (1/1) ... [2024-11-13 12:47:14,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (1/1) ... [2024-11-13 12:47:14,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (1/1) ... [2024-11-13 12:47:14,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (1/1) ... [2024-11-13 12:47:14,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (1/1) ... [2024-11-13 12:47:14,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:47:14,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:47:14,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:47:14,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:47:14,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (1/1) ... [2024-11-13 12:47:14,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:47:14,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:47:14,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:47:14,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:47:14,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:47:14,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:47:14,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:47:14,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:47:14,691 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:47:14,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:47:16,222 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-13 12:47:16,223 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:47:16,241 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:47:16,244 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:47:16,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:47:16 BoogieIcfgContainer [2024-11-13 12:47:16,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:47:16,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:47:16,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:47:16,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:47:16,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:47:13" (1/3) ... [2024-11-13 12:47:16,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96dcddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:47:16, skipping insertion in model container [2024-11-13 12:47:16,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:14" (2/3) ... [2024-11-13 12:47:16,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96dcddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:47:16, skipping insertion in model container [2024-11-13 12:47:16,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:47:16" (3/3) ... [2024-11-13 12:47:16,257 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label16.c [2024-11-13 12:47:16,278 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:47:16,280 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label16.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:47:16,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:47:16,386 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;@7d969465, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:47:16,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:47:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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 12:47:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-13 12:47:16,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:16,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:47:16,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:16,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash -332870846, now seen corresponding path program 1 times [2024-11-13 12:47:16,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:47:16,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657507176] [2024-11-13 12:47:16,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:16,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:47:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:17,200 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 12:47:17,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:47:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657507176] [2024-11-13 12:47:17,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657507176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:47:17,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:47:17,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:47:17,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908324859] [2024-11-13 12:47:17,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:47:17,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:47:17,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:47:17,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:47:17,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:47:17,248 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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 12:47:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:47:18,440 INFO L93 Difference]: Finished difference Result 630 states and 1070 transitions. [2024-11-13 12:47:18,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:47:18,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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 87 [2024-11-13 12:47:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:47:18,463 INFO L225 Difference]: With dead ends: 630 [2024-11-13 12:47:18,464 INFO L226 Difference]: Without dead ends: 318 [2024-11-13 12:47:18,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 12:47:18,474 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 143 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:47:18,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 12:47:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-13 12:47:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-13 12:47:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 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 12:47:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2024-11-13 12:47:18,563 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 87 [2024-11-13 12:47:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:47:18,564 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2024-11-13 12:47:18,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 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 12:47:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2024-11-13 12:47:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 12:47:18,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:18,568 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:47:18,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:47:18,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:18,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash 6714295, now seen corresponding path program 1 times [2024-11-13 12:47:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:47:18,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797746869] [2024-11-13 12:47:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:18,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:47:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:47:19,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:47:19,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797746869] [2024-11-13 12:47:19,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797746869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:47:19,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:47:19,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:47:19,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754262633] [2024-11-13 12:47:19,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:47:19,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:47:19,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:47:19,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:47:19,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:47:19,368 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 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 12:47:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:47:20,553 INFO L93 Difference]: Finished difference Result 999 states and 1508 transitions. [2024-11-13 12:47:20,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:47:20,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2024-11-13 12:47:20,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:47:20,558 INFO L225 Difference]: With dead ends: 999 [2024-11-13 12:47:20,558 INFO L226 Difference]: Without dead ends: 600 [2024-11-13 12:47:20,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:47:20,561 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 170 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:47:20,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 114 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 12:47:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-13 12:47:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-13 12:47:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.357262103505843) internal successors, (813), 599 states have internal predecessors, (813), 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 12:47:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 813 transitions. [2024-11-13 12:47:20,594 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 813 transitions. Word has length 91 [2024-11-13 12:47:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:47:20,598 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 813 transitions. [2024-11-13 12:47:20,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 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 12:47:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 813 transitions. [2024-11-13 12:47:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 12:47:20,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:20,604 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:47:20,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:47:20,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:20,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1749412543, now seen corresponding path program 1 times [2024-11-13 12:47:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:47:20,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207330142] [2024-11-13 12:47:20,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:20,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:47:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:47:20,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:47:20,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207330142] [2024-11-13 12:47:20,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207330142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:47:20,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:47:20,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:47:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686441555] [2024-11-13 12:47:20,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:47:20,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:47:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:47:20,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:47:20,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:47:20,792 INFO L87 Difference]: Start difference. First operand 600 states and 813 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 12:47:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:47:21,478 INFO L93 Difference]: Finished difference Result 1781 states and 2418 transitions. [2024-11-13 12:47:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:47:21,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2024-11-13 12:47:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:47:21,484 INFO L225 Difference]: With dead ends: 1781 [2024-11-13 12:47:21,484 INFO L226 Difference]: Without dead ends: 1183 [2024-11-13 12:47:21,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 12:47:21,487 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 12:47:21,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 99 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 12:47:21,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2024-11-13 12:47:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1173. [2024-11-13 12:47:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.3114334470989761) internal successors, (1537), 1172 states have internal predecessors, (1537), 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 12:47:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1537 transitions. [2024-11-13 12:47:21,535 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1537 transitions. Word has length 105 [2024-11-13 12:47:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:47:21,535 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1537 transitions. [2024-11-13 12:47:21,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 12:47:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1537 transitions. [2024-11-13 12:47:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 12:47:21,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:21,542 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:47:21,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:47:21,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:21,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1407583344, now seen corresponding path program 1 times [2024-11-13 12:47:21,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:47:21,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605538207] [2024-11-13 12:47:21,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:21,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:47:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:47:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:47:21,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605538207] [2024-11-13 12:47:21,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605538207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:47:21,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:47:21,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:47:21,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214193659] [2024-11-13 12:47:21,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:47:21,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:47:21,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:47:21,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:47:21,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:47:21,740 INFO L87 Difference]: Start difference. First operand 1173 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 12:47:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:47:22,501 INFO L93 Difference]: Finished difference Result 3329 states and 4387 transitions. [2024-11-13 12:47:22,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:47:22,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 111 [2024-11-13 12:47:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:47:22,511 INFO L225 Difference]: With dead ends: 3329 [2024-11-13 12:47:22,511 INFO L226 Difference]: Without dead ends: 2158 [2024-11-13 12:47:22,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 12:47:22,517 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 124 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 12:47:22,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 129 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 12:47:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2024-11-13 12:47:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2155. [2024-11-13 12:47:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.1996285979572887) internal successors, (2584), 2154 states have internal predecessors, (2584), 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 12:47:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2584 transitions. [2024-11-13 12:47:22,621 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2584 transitions. Word has length 111 [2024-11-13 12:47:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:47:22,624 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 2584 transitions. [2024-11-13 12:47:22,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 12:47:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2584 transitions. [2024-11-13 12:47:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 12:47:22,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:22,639 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:47:22,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:47:22,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:22,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash 856666241, now seen corresponding path program 1 times [2024-11-13 12:47:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:47:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109254050] [2024-11-13 12:47:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:47:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:47:22,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:47:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:47:22,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:47:22,842 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:47:22,844 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 12:47:22,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:47:22,850 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-13 12:47:22,959 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:47:22,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:47:22 BoogieIcfgContainer [2024-11-13 12:47:22,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:47:22,967 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:47:22,967 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:47:22,968 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:47:22,968 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:47:16" (3/4) ... [2024-11-13 12:47:22,969 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 12:47:23,121 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 12:47:23,121 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:47:23,123 INFO L158 Benchmark]: Toolchain (without parser) took 9544.83ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 92.7MB in the beginning and 280.1MB in the end (delta: -187.4MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-11-13 12:47:23,123 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:47:23,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.66ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 66.9MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 12:47:23,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.22ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 61.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:47:23,128 INFO L158 Benchmark]: Boogie Preprocessor took 117.29ms. Allocated memory is still 117.4MB. Free memory was 61.6MB in the beginning and 57.2MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:47:23,128 INFO L158 Benchmark]: RCFGBuilder took 1760.98ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 56.8MB in the beginning and 312.9MB in the end (delta: -256.1MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2024-11-13 12:47:23,128 INFO L158 Benchmark]: TraceAbstraction took 6719.04ms. Allocated memory is still 352.3MB. Free memory was 312.3MB in the beginning and 291.9MB in the end (delta: 20.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-13 12:47:23,129 INFO L158 Benchmark]: Witness Printer took 154.85ms. Allocated memory is still 352.3MB. Free memory was 291.9MB in the beginning and 280.1MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:47:23,130 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.57ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.66ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 66.9MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.22ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 61.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.29ms. Allocated memory is still 117.4MB. Free memory was 61.6MB in the beginning and 57.2MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1760.98ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 56.8MB in the beginning and 312.9MB in the end (delta: -256.1MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6719.04ms. Allocated memory is still 352.3MB. Free memory was 312.3MB in the beginning and 291.9MB in the end (delta: 20.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 154.85ms. Allocated memory is still 352.3MB. Free memory was 291.9MB in the beginning and 280.1MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. 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 - CounterExampleResult [Line: 443]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L613] int output = -1; VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L61] a28 = 11 [L62] a25 = 1 [L63] return 26; VAL [\result=26, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L110] a17 = 7 [L111] a25 = 0 [L112] a11 = 1 [L113] a28 = 10 [L114] a19 = 0 [L115] return -1; VAL [\result=-1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L436] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L439] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L442] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L443] reach_error() VAL [a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 595 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 595 mSDsluCounter, 461 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 339 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1894 IncrementalHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 339 mSolverCounterUnsat, 358 mSDtfsCounter, 1894 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2155occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 508 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 2174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 43/43 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 proved your program to be incorrect! [2024-11-13 12:47:23,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e570152-dc58-41e1-9444-953be30b18ef/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE