./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-011.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_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/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_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-011.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/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_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/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 5b6e29ecd51153e438c1994cc2e0ffddafd2990e0e080381de4ae5b34f9e08cf --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:30:07,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:30:07,801 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:30:07,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:30:07,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:30:07,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:30:07,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:30:07,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:30:07,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:30:07,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:30:07,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:30:07,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:30:07,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:30:07,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:30:07,859 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:30:07,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:30:07,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:30:07,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:30:07,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:30:07,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:30:07,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:30:07,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:30:07,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:30:07,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:30:07,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:30:07,861 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:30:07,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:30:07,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:30:07,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:30:07,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:30:07,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:30:07,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:30:07,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:30:07,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:30:07,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:30:07,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:30:07,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:30:07,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:30:07,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:30:07,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:30:07,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:30:07,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:30:07,865 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_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/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 -> 5b6e29ecd51153e438c1994cc2e0ffddafd2990e0e080381de4ae5b34f9e08cf [2024-11-13 13:30:08,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:30:08,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:30:08,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:30:08,280 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:30:08,280 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:30:08,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/xcsp/AllInterval-011.c Unable to find full path for "g++" [2024-11-13 13:30:10,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:30:10,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:30:10,629 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/sv-benchmarks/c/xcsp/AllInterval-011.c [2024-11-13 13:30:10,639 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/bin/uautomizer-verify-qhAvR1uOyd/data/40f205b39/973f3ab248704f0b96f6369b54321a2d/FLAGe8565c9dd [2024-11-13 13:30:10,926 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/bin/uautomizer-verify-qhAvR1uOyd/data/40f205b39/973f3ab248704f0b96f6369b54321a2d [2024-11-13 13:30:10,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:30:10,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:30:10,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:30:10,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:30:10,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:30:10,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:30:10" (1/1) ... [2024-11-13 13:30:10,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8b5301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:10, skipping insertion in model container [2024-11-13 13:30:10,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:30:10" (1/1) ... [2024-11-13 13:30:11,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:30:11,367 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_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/sv-benchmarks/c/xcsp/AllInterval-011.c[6600,6613] [2024-11-13 13:30:11,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:30:11,399 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:30:11,475 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_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/sv-benchmarks/c/xcsp/AllInterval-011.c[6600,6613] [2024-11-13 13:30:11,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:30:11,495 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:30:11,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11 WrapperNode [2024-11-13 13:30:11,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:30:11,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:30:11,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:30:11,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:30:11,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (1/1) ... [2024-11-13 13:30:11,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (1/1) ... [2024-11-13 13:30:11,577 INFO L138 Inliner]: procedures = 13, calls = 159, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 294 [2024-11-13 13:30:11,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:30:11,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:30:11,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:30:11,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:30:11,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (1/1) ... [2024-11-13 13:30:11,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (1/1) ... [2024-11-13 13:30:11,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (1/1) ... [2024-11-13 13:30:11,615 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 13:30:11,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (1/1) ... [2024-11-13 13:30:11,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (1/1) ... [2024-11-13 13:30:11,625 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (1/1) ... [2024-11-13 13:30:11,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (1/1) ... [2024-11-13 13:30:11,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (1/1) ... [2024-11-13 13:30:11,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (1/1) ... [2024-11-13 13:30:11,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:30:11,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:30:11,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:30:11,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:30:11,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (1/1) ... [2024-11-13 13:30:11,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:30:11,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:30:11,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:30:11,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:30:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:30:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:30:11,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:30:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:30:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-11-13 13:30:11,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-11-13 13:30:11,847 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:30:11,849 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:30:12,506 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-13 13:30:12,506 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:30:12,528 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:30:12,528 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 13:30:12,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:30:12 BoogieIcfgContainer [2024-11-13 13:30:12,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:30:12,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:30:12,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:30:12,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:30:12,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:30:10" (1/3) ... [2024-11-13 13:30:12,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c606f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:30:12, skipping insertion in model container [2024-11-13 13:30:12,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:30:11" (2/3) ... [2024-11-13 13:30:12,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c606f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:30:12, skipping insertion in model container [2024-11-13 13:30:12,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:30:12" (3/3) ... [2024-11-13 13:30:12,541 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-011.c [2024-11-13 13:30:12,560 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:30:12,561 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG AllInterval-011.c that has 2 procedures, 194 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-13 13:30:12,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:30:12,687 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;@dc0ed47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:30:12,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:30:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 13:30:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2024-11-13 13:30:12,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:12,764 INFO L215 NwaCegarLoop]: trace histogram [152, 152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:30:12,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:30:12,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:12,770 INFO L85 PathProgramCache]: Analyzing trace with hash -696530000, now seen corresponding path program 1 times [2024-11-13 13:30:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:12,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478548568] [2024-11-13 13:30:12,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:12,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 13:30:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-13 13:30:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 13:30:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-13 13:30:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-13 13:30:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 13:30:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 13:30:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-13 13:30:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-13 13:30:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 13:30:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 13:30:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-13 13:30:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-13 13:30:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 13:30:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-13 13:30:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 13:30:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-13 13:30:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 13:30:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-13 13:30:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 13:30:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 13:30:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-13 13:30:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-13 13:30:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-13 13:30:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 13:30:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-13 13:30:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-13 13:30:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-13 13:30:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-13 13:30:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-13 13:30:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-13 13:30:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-13 13:30:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-13 13:30:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-13 13:30:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-13 13:30:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-13 13:30:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-13 13:30:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-13 13:30:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-13 13:30:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-13 13:30:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-13 13:30:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-13 13:30:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-13 13:30:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-13 13:30:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-13 13:30:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-13 13:30:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-13 13:30:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-13 13:30:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-13 13:30:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-13 13:30:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-13 13:30:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-13 13:30:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-11-13 13:30:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2024-11-13 13:30:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-11-13 13:30:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2024-11-13 13:30:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2024-11-13 13:30:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-11-13 13:30:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2024-11-13 13:30:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-11-13 13:30:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2024-11-13 13:30:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-13 13:30:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2024-11-13 13:30:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-13 13:30:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-13 13:30:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-13 13:30:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2024-11-13 13:30:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-13 13:30:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-11-13 13:30:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2024-11-13 13:30:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2024-11-13 13:30:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2024-11-13 13:30:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2024-11-13 13:30:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 388 [2024-11-13 13:30:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2024-11-13 13:30:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 398 [2024-11-13 13:30:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:13,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2024-11-13 13:30:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2024-11-13 13:30:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-13 13:30:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2024-11-13 13:30:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 423 [2024-11-13 13:30:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2024-11-13 13:30:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-13 13:30:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2024-11-13 13:30:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2024-11-13 13:30:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2024-11-13 13:30:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2024-11-13 13:30:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2024-11-13 13:30:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 463 [2024-11-13 13:30:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 468 [2024-11-13 13:30:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 473 [2024-11-13 13:30:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 478 [2024-11-13 13:30:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 483 [2024-11-13 13:30:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2024-11-13 13:30:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 493 [2024-11-13 13:30:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2024-11-13 13:30:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2024-11-13 13:30:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 508 [2024-11-13 13:30:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2024-11-13 13:30:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 518 [2024-11-13 13:30:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 523 [2024-11-13 13:30:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2024-11-13 13:30:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-11-13 13:30:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 538 [2024-11-13 13:30:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 543 [2024-11-13 13:30:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 548 [2024-11-13 13:30:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 553 [2024-11-13 13:30:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 558 [2024-11-13 13:30:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 563 [2024-11-13 13:30:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2024-11-13 13:30:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 573 [2024-11-13 13:30:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 578 [2024-11-13 13:30:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 583 [2024-11-13 13:30:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 588 [2024-11-13 13:30:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 593 [2024-11-13 13:30:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 598 [2024-11-13 13:30:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 603 [2024-11-13 13:30:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 608 [2024-11-13 13:30:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 613 [2024-11-13 13:30:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 618 [2024-11-13 13:30:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2024-11-13 13:30:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2024-11-13 13:30:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 633 [2024-11-13 13:30:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 638 [2024-11-13 13:30:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 643 [2024-11-13 13:30:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 648 [2024-11-13 13:30:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 653 [2024-11-13 13:30:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 658 [2024-11-13 13:30:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 663 [2024-11-13 13:30:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 668 [2024-11-13 13:30:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 673 [2024-11-13 13:30:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 678 [2024-11-13 13:30:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 683 [2024-11-13 13:30:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 688 [2024-11-13 13:30:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 693 [2024-11-13 13:30:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 698 [2024-11-13 13:30:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 703 [2024-11-13 13:30:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 708 [2024-11-13 13:30:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 713 [2024-11-13 13:30:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 718 [2024-11-13 13:30:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 723 [2024-11-13 13:30:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 728 [2024-11-13 13:30:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 734 [2024-11-13 13:30:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 740 [2024-11-13 13:30:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 746 [2024-11-13 13:30:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 752 [2024-11-13 13:30:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 758 [2024-11-13 13:30:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 764 [2024-11-13 13:30:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 770 [2024-11-13 13:30:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 776 [2024-11-13 13:30:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 782 [2024-11-13 13:30:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2024-11-13 13:30:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 45904 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45904 trivial. 0 not checked. [2024-11-13 13:30:14,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:30:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478548568] [2024-11-13 13:30:14,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478548568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:30:14,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:30:14,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:30:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111635219] [2024-11-13 13:30:14,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:30:14,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:30:14,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:30:14,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:30:14,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:30:14,431 INFO L87 Difference]: Start difference. First operand has 194 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 1 states have call predecessors, (152), 2 states have call successors, (152) [2024-11-13 13:30:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:14,536 INFO L93 Difference]: Finished difference Result 382 states and 836 transitions. [2024-11-13 13:30:14,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:30:14,539 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 1 states have call predecessors, (152), 2 states have call successors, (152) Word has length 794 [2024-11-13 13:30:14,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:14,549 INFO L225 Difference]: With dead ends: 382 [2024-11-13 13:30:14,549 INFO L226 Difference]: Without dead ends: 191 [2024-11-13 13:30:14,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 458 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 13:30:14,568 INFO L432 NwaCegarLoop]: 341 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, 341 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 13:30:14,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:30:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-13 13:30:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-13 13:30:14,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 37 states have (on average 1.0) internal successors, (37), 37 states have internal predecessors, (37), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 13:30:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 341 transitions. [2024-11-13 13:30:14,725 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 341 transitions. Word has length 794 [2024-11-13 13:30:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:14,726 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 341 transitions. [2024-11-13 13:30:14,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 1 states have call predecessors, (152), 2 states have call successors, (152) [2024-11-13 13:30:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 341 transitions. [2024-11-13 13:30:14,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2024-11-13 13:30:14,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:14,765 INFO L215 NwaCegarLoop]: trace histogram [152, 152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:30:14,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:30:14,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:30:14,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1894498652, now seen corresponding path program 1 times [2024-11-13 13:30:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:30:14,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016409850] [2024-11-13 13:30:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:30:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:30:21,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:30:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:30:48,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:30:48,867 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:30:48,869 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:30:48,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:30:48,876 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-13 13:30:49,129 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:30:49,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:30:49 BoogieIcfgContainer [2024-11-13 13:30:49,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:30:49,136 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:30:49,136 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:30:49,137 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:30:49,137 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:30:12" (3/4) ... [2024-11-13 13:30:49,138 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 13:30:49,378 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 13:30:49,379 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:30:49,380 INFO L158 Benchmark]: Toolchain (without parser) took 38441.34ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 92.6MB in the beginning and 1.1GB in the end (delta: -977.0MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-13 13:30:49,383 INFO L158 Benchmark]: CDTParser took 1.24ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:30:49,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.38ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 78.4MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:30:49,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.45ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 75.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:30:49,384 INFO L158 Benchmark]: Boogie Preprocessor took 66.26ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 74.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:30:49,384 INFO L158 Benchmark]: RCFGBuilder took 883.97ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 46.7MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:30:49,385 INFO L158 Benchmark]: TraceAbstraction took 36604.07ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 46.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-13 13:30:49,385 INFO L158 Benchmark]: Witness Printer took 242.54ms. Allocated memory is still 2.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 13:30:49,391 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.24ms. Allocated memory is still 117.4MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.38ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 78.4MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.45ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 75.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.26ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 74.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 883.97ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 46.7MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 36604.07ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 46.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 242.54ms. Allocated memory is still 2.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: 243]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L29] RET assume(var0 >= 0) VAL [var0=3] [L30] CALL assume(var0 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 10) VAL [var0=3] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L33] RET assume(var1 >= 0) VAL [var0=3, var1=8] [L34] CALL assume(var1 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 10) VAL [var0=3, var1=8] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L37] RET assume(var2 >= 0) VAL [var0=3, var1=8, var2=0] [L38] CALL assume(var2 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 10) VAL [var0=3, var1=8, var2=0] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L41] RET assume(var3 >= 0) VAL [var0=3, var1=8, var2=0, var3=10] [L42] CALL assume(var3 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L42] RET assume(var3 <= 10) VAL [var0=3, var1=8, var2=0, var3=10] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L45] RET assume(var4 >= 0) VAL [var0=3, var1=8, var2=0, var3=10, var4=1] [L46] CALL assume(var4 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L46] RET assume(var4 <= 10) VAL [var0=3, var1=8, var2=0, var3=10, var4=1] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L49] RET assume(var5 >= 0) VAL [var0=3, var1=8, var2=0, var3=10, var4=1, var5=7] [L50] CALL assume(var5 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 10) VAL [var0=3, var1=8, var2=0, var3=10, var4=1, var5=7] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L53] RET assume(var6 >= 0) VAL [var0=3, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4] [L54] CALL assume(var6 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 10) VAL [var0=3, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET assume(var7 >= 0) VAL [var0=3, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2] [L58] CALL assume(var7 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 10) VAL [var0=3, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L61] RET assume(var8 >= 0) VAL [var0=3, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9] [L62] CALL assume(var8 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 10) VAL [var0=3, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L65] RET assume(var9 >= 0) VAL [var0=3, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L66] CALL assume(var9 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var9 <= 10) VAL [var0=3, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L69] RET assume(var10 >= 0) VAL [var0=3, var10=6, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L70] CALL assume(var10 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var10 <= 10) VAL [var0=3, var10=6, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L73] RET assume(var11 >= 1) VAL [var0=3, var10=6, var11=5, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L74] CALL assume(var11 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var11 <= 10) VAL [var0=3, var10=6, var11=5, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L77] RET assume(var12 >= 1) VAL [var0=3, var10=6, var11=5, var12=8, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L78] CALL assume(var12 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var12 <= 10) VAL [var0=3, var10=6, var11=5, var12=8, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L81] RET assume(var13 >= 1) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L82] CALL assume(var13 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L82] RET assume(var13 <= 10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L85] RET assume(var14 >= 1) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L86] CALL assume(var14 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var14 <= 10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L87] int var15; [L88] var15 = __VERIFIER_nondet_int() [L89] CALL assume(var15 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var15 >= 1) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L90] CALL assume(var15 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET assume(var15 <= 10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L91] int var16; [L92] var16 = __VERIFIER_nondet_int() [L93] CALL assume(var16 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET assume(var16 >= 1) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L94] CALL assume(var16 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L94] RET assume(var16 <= 10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L95] int var17; [L96] var17 = __VERIFIER_nondet_int() [L97] CALL assume(var17 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L97] RET assume(var17 >= 1) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L98] CALL assume(var17 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L98] RET assume(var17 <= 10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L99] int var18; [L100] var18 = __VERIFIER_nondet_int() [L101] CALL assume(var18 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L101] RET assume(var18 >= 1) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L102] CALL assume(var18 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L102] RET assume(var18 <= 10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L103] int var19; [L104] var19 = __VERIFIER_nondet_int() [L105] CALL assume(var19 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L105] RET assume(var19 >= 1) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L106] CALL assume(var19 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L106] RET assume(var19 <= 10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L107] int var20; [L108] var20 = __VERIFIER_nondet_int() [L109] CALL assume(var20 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L109] RET assume(var20 >= 1) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L110] CALL assume(var20 <= 10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L110] RET assume(var20 <= 10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L111] int myvar0 = 1; VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L112] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L112] RET assume(var0 != var1) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L113] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L113] RET assume(var0 != var2) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L114] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L114] RET assume(var0 != var3) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L115] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L115] RET assume(var0 != var4) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L116] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L116] RET assume(var0 != var5) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L117] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L117] RET assume(var0 != var6) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L118] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L118] RET assume(var0 != var7) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L119] CALL assume(var0 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L119] RET assume(var0 != var8) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L120] CALL assume(var0 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L120] RET assume(var0 != var9) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L121] CALL assume(var0 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L121] RET assume(var0 != var10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L122] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L122] RET assume(var1 != var2) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L123] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L123] RET assume(var1 != var3) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L124] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L124] RET assume(var1 != var4) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L125] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L125] RET assume(var1 != var5) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L126] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L126] RET assume(var1 != var6) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L127] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L127] RET assume(var1 != var7) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L128] CALL assume(var1 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L128] RET assume(var1 != var8) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L129] CALL assume(var1 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L129] RET assume(var1 != var9) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L130] CALL assume(var1 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L130] RET assume(var1 != var10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L131] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L131] RET assume(var2 != var3) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L132] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L132] RET assume(var2 != var4) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L133] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L133] RET assume(var2 != var5) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L134] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L134] RET assume(var2 != var6) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L135] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L135] RET assume(var2 != var7) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L136] CALL assume(var2 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L136] RET assume(var2 != var8) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L137] CALL assume(var2 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L137] RET assume(var2 != var9) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L138] CALL assume(var2 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L138] RET assume(var2 != var10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L139] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L139] RET assume(var3 != var4) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L140] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L140] RET assume(var3 != var5) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L141] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L141] RET assume(var3 != var6) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L142] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L142] RET assume(var3 != var7) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L143] CALL assume(var3 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L143] RET assume(var3 != var8) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L144] CALL assume(var3 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L144] RET assume(var3 != var9) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L145] CALL assume(var3 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L145] RET assume(var3 != var10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L146] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L146] RET assume(var4 != var5) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L147] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L147] RET assume(var4 != var6) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L148] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L148] RET assume(var4 != var7) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L149] CALL assume(var4 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L149] RET assume(var4 != var8) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L150] CALL assume(var4 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L150] RET assume(var4 != var9) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L151] CALL assume(var4 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L151] RET assume(var4 != var10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L152] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L152] RET assume(var5 != var6) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L153] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L153] RET assume(var5 != var7) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L154] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L154] RET assume(var5 != var8) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L155] CALL assume(var5 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L155] RET assume(var5 != var9) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L156] CALL assume(var5 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L156] RET assume(var5 != var10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L157] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L157] RET assume(var6 != var7) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L158] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L158] RET assume(var6 != var8) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L159] CALL assume(var6 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L159] RET assume(var6 != var9) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L160] CALL assume(var6 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L160] RET assume(var6 != var10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L161] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L161] RET assume(var7 != var8) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L162] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L162] RET assume(var7 != var9) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L163] CALL assume(var7 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L163] RET assume(var7 != var10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L164] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L164] RET assume(var8 != var9) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L165] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L165] RET assume(var8 != var10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L166] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L166] RET assume(var9 != var10) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L167] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L167] RET assume(var11 != var12) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L168] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L168] RET assume(var11 != var13) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L169] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L169] RET assume(var11 != var14) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L170] CALL assume(var11 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L170] RET assume(var11 != var15) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L171] CALL assume(var11 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L171] RET assume(var11 != var16) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L172] CALL assume(var11 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L172] RET assume(var11 != var17) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L173] CALL assume(var11 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L173] RET assume(var11 != var18) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L174] CALL assume(var11 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L174] RET assume(var11 != var19) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L175] CALL assume(var11 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L175] RET assume(var11 != var20) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L176] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L176] RET assume(var12 != var13) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L177] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L177] RET assume(var12 != var14) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L178] CALL assume(var12 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L178] RET assume(var12 != var15) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L179] CALL assume(var12 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L179] RET assume(var12 != var16) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L180] CALL assume(var12 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L180] RET assume(var12 != var17) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L181] CALL assume(var12 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L181] RET assume(var12 != var18) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L182] CALL assume(var12 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L182] RET assume(var12 != var19) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L183] CALL assume(var12 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L183] RET assume(var12 != var20) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L184] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L184] RET assume(var13 != var14) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L185] CALL assume(var13 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L185] RET assume(var13 != var15) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L186] CALL assume(var13 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L186] RET assume(var13 != var16) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L187] CALL assume(var13 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L187] RET assume(var13 != var17) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L188] CALL assume(var13 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L188] RET assume(var13 != var18) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L189] CALL assume(var13 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L189] RET assume(var13 != var19) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L190] CALL assume(var13 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L190] RET assume(var13 != var20) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L191] CALL assume(var14 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L191] RET assume(var14 != var15) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L192] CALL assume(var14 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L192] RET assume(var14 != var16) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L193] CALL assume(var14 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L193] RET assume(var14 != var17) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L194] CALL assume(var14 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L194] RET assume(var14 != var18) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L195] CALL assume(var14 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L195] RET assume(var14 != var19) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L196] CALL assume(var14 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L196] RET assume(var14 != var20) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L197] CALL assume(var15 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L197] RET assume(var15 != var16) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L198] CALL assume(var15 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L198] RET assume(var15 != var17) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L199] CALL assume(var15 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L199] RET assume(var15 != var18) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L200] CALL assume(var15 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L200] RET assume(var15 != var19) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L201] CALL assume(var15 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L201] RET assume(var15 != var20) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L202] CALL assume(var16 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L202] RET assume(var16 != var17) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L203] CALL assume(var16 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L203] RET assume(var16 != var18) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L204] CALL assume(var16 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L204] RET assume(var16 != var19) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L205] CALL assume(var16 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L205] RET assume(var16 != var20) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L206] CALL assume(var17 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L206] RET assume(var17 != var18) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L207] CALL assume(var17 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L207] RET assume(var17 != var19) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L208] CALL assume(var17 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L208] RET assume(var17 != var20) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L209] CALL assume(var18 != var19) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L209] RET assume(var18 != var19) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L210] CALL assume(var18 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L210] RET assume(var18 != var20) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L211] CALL assume(var19 != var20) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L211] RET assume(var19 != var20) VAL [var0=3, var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5] [L212] int var_for_abs; [L213] var_for_abs = var0 - var1 [L214] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5, var_for_abs=5] [L215] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L215] RET assume(var11 == var_for_abs) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var1=8, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5, var_for_abs=5] [L216] var_for_abs = var1 - var2 [L217] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5, var_for_abs=8] [L218] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L218] RET assume(var12 == var_for_abs) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var2=0, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5, var_for_abs=8] [L219] var_for_abs = var2 - var3 [L220] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5, var_for_abs=10] [L221] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L221] RET assume(var13 == var_for_abs) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var3=10, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5, var_for_abs=10] [L222] var_for_abs = var3 - var4 [L223] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5, var_for_abs=9] [L224] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L224] RET assume(var14 == var_for_abs) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var4=1, var5=7, var6=4, var7=2, var8=9, var9=5, var_for_abs=9] [L225] var_for_abs = var4 - var5 [L226] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var5=7, var6=4, var7=2, var8=9, var9=5, var_for_abs=6] [L227] CALL assume(var15 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L227] RET assume(var15 == var_for_abs) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var5=7, var6=4, var7=2, var8=9, var9=5, var_for_abs=6] [L228] var_for_abs = var5 - var6 [L229] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var6=4, var7=2, var8=9, var9=5, var_for_abs=3] [L230] CALL assume(var16 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L230] RET assume(var16 == var_for_abs) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var6=4, var7=2, var8=9, var9=5, var_for_abs=3] [L231] var_for_abs = var6 - var7 [L232] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var7=2, var8=9, var9=5, var_for_abs=2] [L233] CALL assume(var17 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L233] RET assume(var17 == var_for_abs) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var7=2, var8=9, var9=5, var_for_abs=2] [L234] var_for_abs = var7 - var8 [L235] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var8=9, var9=5, var_for_abs=7] [L236] CALL assume(var18 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L236] RET assume(var18 == var_for_abs) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var8=9, var9=5, var_for_abs=7] [L237] var_for_abs = var8 - var9 [L238] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var9=5, var_for_abs=4] [L239] CALL assume(var19 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L239] RET assume(var19 == var_for_abs) VAL [var10=6, var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var9=5, var_for_abs=4] [L240] var_for_abs = var9 - var10 [L241] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var_for_abs=1] [L242] CALL assume(var20 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L242] RET assume(var20 == var_for_abs) VAL [var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var_for_abs=1] [L243] reach_error() VAL [var11=5, var12=8, var13=10, var14=9, var15=6, var16=3, var17=2, var18=7, var19=4, var20=1, var_for_abs=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 194 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.2s, OverallIterations: 2, TraceHistogramMax: 152, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 341 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 341 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 6.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1588 NumberOfCodeBlocks, 1588 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 793 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 45904/45904 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 13:30:49,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81c5b22-62e4-4b71-8770-14b3d0d1bb96/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE