/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/xcsp/AllInterval-010.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 14:49:30,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 14:49:30,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 14:49:30,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 14:49:30,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 14:49:30,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 14:49:30,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 14:49:30,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 14:49:30,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 14:49:30,460 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 14:49:30,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 14:49:30,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 14:49:30,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 14:49:30,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 14:49:30,461 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 14:49:30,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 14:49:30,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 14:49:30,462 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 14:49:30,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 14:49:30,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 14:49:30,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 14:49:30,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 14:49:30,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 14:49:30,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 14:49:30,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 14:49:30,464 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 14:49:30,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 14:49:30,464 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 14:49:30,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 14:49:30,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 14:49:30,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 14:49:30,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 14:49:30,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 14:49:30,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 14:49:30,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 14:49:30,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 14:49:30,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 14:49:30,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 14:49:30,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 14:49:30,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 14:49:30,466 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 14:49:30,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 14:49:30,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 14:49:30,467 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 14:49:30,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 14:49:30,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 14:49:30,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 14:49:30,686 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 14:49:30,686 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 14:49:30,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/xcsp/AllInterval-010.c [2023-12-21 14:49:31,763 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 14:49:31,933 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 14:49:31,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-010.c [2023-12-21 14:49:31,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b96a824f/63e57989f0604f69a9b4f92c18e5aba7/FLAG4222c65b0 [2023-12-21 14:49:31,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b96a824f/63e57989f0604f69a9b4f92c18e5aba7 [2023-12-21 14:49:31,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 14:49:31,967 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 14:49:31,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 14:49:31,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 14:49:31,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 14:49:31,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:49:31" (1/1) ... [2023-12-21 14:49:31,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1886fe3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:31, skipping insertion in model container [2023-12-21 14:49:31,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:49:31" (1/1) ... [2023-12-21 14:49:32,000 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 14:49:32,130 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-010.c[5778,5791] [2023-12-21 14:49:32,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 14:49:32,147 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 14:49:32,176 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-010.c[5778,5791] [2023-12-21 14:49:32,177 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 14:49:32,186 INFO L206 MainTranslator]: Completed translation [2023-12-21 14:49:32,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32 WrapperNode [2023-12-21 14:49:32,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 14:49:32,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 14:49:32,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 14:49:32,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 14:49:32,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (1/1) ... [2023-12-21 14:49:32,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (1/1) ... [2023-12-21 14:49:32,251 INFO L138 Inliner]: procedures = 13, calls = 135, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 258 [2023-12-21 14:49:32,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 14:49:32,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 14:49:32,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 14:49:32,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 14:49:32,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (1/1) ... [2023-12-21 14:49:32,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (1/1) ... [2023-12-21 14:49:32,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (1/1) ... [2023-12-21 14:49:32,271 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]. [2023-12-21 14:49:32,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (1/1) ... [2023-12-21 14:49:32,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (1/1) ... [2023-12-21 14:49:32,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (1/1) ... [2023-12-21 14:49:32,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (1/1) ... [2023-12-21 14:49:32,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (1/1) ... [2023-12-21 14:49:32,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (1/1) ... [2023-12-21 14:49:32,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 14:49:32,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 14:49:32,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 14:49:32,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 14:49:32,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (1/1) ... [2023-12-21 14:49:32,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 14:49:32,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:49:32,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 14:49:32,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 14:49:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 14:49:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 14:49:32,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 14:49:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 14:49:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2023-12-21 14:49:32,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2023-12-21 14:49:32,391 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 14:49:32,393 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 14:49:32,698 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 14:49:32,719 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 14:49:32,719 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-21 14:49:32,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:49:32 BoogieIcfgContainer [2023-12-21 14:49:32,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 14:49:32,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 14:49:32,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 14:49:32,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 14:49:32,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:49:31" (1/3) ... [2023-12-21 14:49:32,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312af110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:49:32, skipping insertion in model container [2023-12-21 14:49:32,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:32" (2/3) ... [2023-12-21 14:49:32,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312af110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:49:32, skipping insertion in model container [2023-12-21 14:49:32,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:49:32" (3/3) ... [2023-12-21 14:49:32,726 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-010.c [2023-12-21 14:49:32,738 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 14:49:32,738 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 14:49:32,794 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 14:49:32,800 INFO L357 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, mHoare=true, 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;@5974b2ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 14:49:32,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 14:49:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2023-12-21 14:49:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2023-12-21 14:49:32,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:49:32,850 INFO L195 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:49:32,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:49:32,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:49:32,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2096619517, now seen corresponding path program 1 times [2023-12-21 14:49:32,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:49:32,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831347283] [2023-12-21 14:49:32,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:49:32,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:49:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 14:49:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 14:49:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-21 14:49:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 14:49:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 14:49:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-21 14:49:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 14:49:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-21 14:49:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 14:49:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 14:49:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 14:49:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-21 14:49:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-21 14:49:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-21 14:49:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-21 14:49:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 14:49:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 14:49:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-21 14:49:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-21 14:49:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 14:49:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-21 14:49:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-21 14:49:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-21 14:49:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-21 14:49:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-21 14:49:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-21 14:49:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-12-21 14:49:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-12-21 14:49:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-12-21 14:49:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-12-21 14:49:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-12-21 14:49:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-12-21 14:49:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-12-21 14:49:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-12-21 14:49:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-21 14:49:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-21 14:49:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-21 14:49:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-12-21 14:49:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-12-21 14:49:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 14:49:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2023-12-21 14:49:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-12-21 14:49:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-21 14:49:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-21 14:49:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-21 14:49:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-21 14:49:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-21 14:49:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-21 14:49:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-12-21 14:49:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-21 14:49:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2023-12-21 14:49:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-21 14:49:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2023-12-21 14:49:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2023-12-21 14:49:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2023-12-21 14:49:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2023-12-21 14:49:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2023-12-21 14:49:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2023-12-21 14:49:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2023-12-21 14:49:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2023-12-21 14:49:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2023-12-21 14:49:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2023-12-21 14:49:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2023-12-21 14:49:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2023-12-21 14:49:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2023-12-21 14:49:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2023-12-21 14:49:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-12-21 14:49:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2023-12-21 14:49:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2023-12-21 14:49:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2023-12-21 14:49:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2023-12-21 14:49:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2023-12-21 14:49:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2023-12-21 14:49:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2023-12-21 14:49:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2023-12-21 14:49:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2023-12-21 14:49:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2023-12-21 14:49:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2023-12-21 14:49:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 410 [2023-12-21 14:49:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 415 [2023-12-21 14:49:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2023-12-21 14:49:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2023-12-21 14:49:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 430 [2023-12-21 14:49:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 435 [2023-12-21 14:49:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2023-12-21 14:49:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 445 [2023-12-21 14:49:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 450 [2023-12-21 14:49:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2023-12-21 14:49:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2023-12-21 14:49:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 465 [2023-12-21 14:49:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 470 [2023-12-21 14:49:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2023-12-21 14:49:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2023-12-21 14:49:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2023-12-21 14:49:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 490 [2023-12-21 14:49:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 495 [2023-12-21 14:49:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2023-12-21 14:49:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 505 [2023-12-21 14:49:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 510 [2023-12-21 14:49:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 515 [2023-12-21 14:49:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 520 [2023-12-21 14:49:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 525 [2023-12-21 14:49:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2023-12-21 14:49:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2023-12-21 14:49:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 540 [2023-12-21 14:49:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 545 [2023-12-21 14:49:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 550 [2023-12-21 14:49:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 555 [2023-12-21 14:49:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 560 [2023-12-21 14:49:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 565 [2023-12-21 14:49:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 570 [2023-12-21 14:49:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2023-12-21 14:49:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 580 [2023-12-21 14:49:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 585 [2023-12-21 14:49:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2023-12-21 14:49:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 595 [2023-12-21 14:49:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600 [2023-12-21 14:49:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 605 [2023-12-21 14:49:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 610 [2023-12-21 14:49:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 616 [2023-12-21 14:49:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 622 [2023-12-21 14:49:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2023-12-21 14:49:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 634 [2023-12-21 14:49:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 640 [2023-12-21 14:49:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2023-12-21 14:49:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 652 [2023-12-21 14:49:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 658 [2023-12-21 14:49:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 664 [2023-12-21 14:49:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 14:49:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2023-12-21 14:49:33,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 14:49:33,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831347283] [2023-12-21 14:49:33,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831347283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 14:49:33,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 14:49:33,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 14:49:33,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852531395] [2023-12-21 14:49:33,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 14:49:33,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 14:49:33,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 14:49:33,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 14:49:33,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 14:49:33,709 INFO L87 Difference]: Start difference. First operand has 164 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) [2023-12-21 14:49:33,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 14:49:33,786 INFO L93 Difference]: Finished difference Result 325 states and 707 transitions. [2023-12-21 14:49:33,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 14:49:33,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) Word has length 670 [2023-12-21 14:49:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 14:49:33,797 INFO L225 Difference]: With dead ends: 325 [2023-12-21 14:49:33,797 INFO L226 Difference]: Without dead ends: 163 [2023-12-21 14:49:33,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 14:49:33,808 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 14:49:33,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 14:49:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-21 14:49:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2023-12-21 14:49:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 33 states have (on average 1.0) internal successors, (33), 33 states have internal predecessors, (33), 128 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2023-12-21 14:49:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 289 transitions. [2023-12-21 14:49:33,884 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 289 transitions. Word has length 670 [2023-12-21 14:49:33,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 14:49:33,885 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 289 transitions. [2023-12-21 14:49:33,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (128), 1 states have call predecessors, (128), 1 states have return successors, (128), 1 states have call predecessors, (128), 2 states have call successors, (128) [2023-12-21 14:49:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 289 transitions. [2023-12-21 14:49:33,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2023-12-21 14:49:33,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:49:33,898 INFO L195 NwaCegarLoop]: trace histogram [128, 128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:49:33,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 14:49:33,898 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:49:33,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:49:33,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1862820777, now seen corresponding path program 1 times [2023-12-21 14:49:33,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:49:33,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865160014] [2023-12-21 14:49:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:49:33,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:49:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 14:49:37,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 14:49:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 14:49:40,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 14:49:40,111 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 14:49:40,113 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 14:49:40,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 14:49:40,118 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-21 14:49:40,122 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 14:49:40,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:49:40 BoogieIcfgContainer [2023-12-21 14:49:40,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 14:49:40,258 INFO L158 Benchmark]: Toolchain (without parser) took 8290.30ms. Allocated memory was 178.3MB in the beginning and 834.7MB in the end (delta: 656.4MB). Free memory was 123.7MB in the beginning and 454.9MB in the end (delta: -331.3MB). Peak memory consumption was 483.3MB. Max. memory is 8.0GB. [2023-12-21 14:49:40,258 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory was 132.0MB in the beginning and 131.8MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 14:49:40,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.99ms. Allocated memory is still 178.3MB. Free memory was 123.4MB in the beginning and 109.5MB in the end (delta: 13.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-21 14:49:40,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.47ms. Allocated memory is still 178.3MB. Free memory was 109.4MB in the beginning and 107.0MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 14:49:40,261 INFO L158 Benchmark]: Boogie Preprocessor took 28.29ms. Allocated memory is still 178.3MB. Free memory was 107.0MB in the beginning and 104.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 14:49:40,261 INFO L158 Benchmark]: RCFGBuilder took 438.97ms. Allocated memory was 178.3MB in the beginning and 303.0MB in the end (delta: 124.8MB). Free memory was 104.6MB in the beginning and 258.4MB in the end (delta: -153.8MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2023-12-21 14:49:40,261 INFO L158 Benchmark]: TraceAbstraction took 7535.51ms. Allocated memory was 303.0MB in the beginning and 834.7MB in the end (delta: 531.6MB). Free memory was 257.4MB in the beginning and 454.9MB in the end (delta: -197.6MB). Peak memory consumption was 491.9MB. Max. memory is 8.0GB. [2023-12-21 14:49:40,263 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory was 132.0MB in the beginning and 131.8MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.99ms. Allocated memory is still 178.3MB. Free memory was 123.4MB in the beginning and 109.5MB in the end (delta: 13.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.47ms. Allocated memory is still 178.3MB. Free memory was 109.4MB in the beginning and 107.0MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.29ms. Allocated memory is still 178.3MB. Free memory was 107.0MB in the beginning and 104.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 438.97ms. Allocated memory was 178.3MB in the beginning and 303.0MB in the end (delta: 124.8MB). Free memory was 104.6MB in the beginning and 258.4MB in the end (delta: -153.8MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * TraceAbstraction took 7535.51ms. Allocated memory was 303.0MB in the beginning and 834.7MB in the end (delta: 531.6MB). Free memory was 257.4MB in the beginning and 454.9MB in the end (delta: -197.6MB). Peak memory consumption was 491.9MB. Max. memory is 8.0GB. * 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: 213]: 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, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=4] [L30] CALL assume(var0 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 9) VAL [dummy=0, var0=4] [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, cond=1] [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=4, var1=8] [L34] CALL assume(var1 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 9) VAL [dummy=0, var0=4, 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, cond=1] [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=4, var1=8, var2=0] [L38] CALL assume(var2 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 9) VAL [dummy=0, var0=4, 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, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9] [L42] CALL assume(var3 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 9) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9] [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, cond=1] [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9, var4=2] [L46] CALL assume(var4 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 9) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9, var4=2] [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, cond=1] [L49] RET assume(var5 >= 0) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9, var4=2, var5=7] [L50] CALL assume(var5 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 9) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9, var4=2, 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, cond=1] [L53] RET assume(var6 >= 0) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1] [L54] CALL assume(var6 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 9) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1] [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, cond=1] [L57] RET assume(var7 >= 0) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3] [L58] CALL assume(var7 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 9) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3] [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, cond=1] [L61] RET assume(var8 >= 0) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6] [L62] CALL assume(var8 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 9) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6] [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, cond=1] [L65] RET assume(var9 >= 0) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L66] CALL assume(var9 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 9) VAL [dummy=0, var0=4, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var10 >= 1) VAL [dummy=0, var0=4, var10=4, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L70] CALL assume(var10 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 9) VAL [dummy=0, var0=4, var10=4, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, 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, cond=1] [L73] RET assume(var11 >= 1) VAL [dummy=0, var0=4, var10=4, var11=8, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L74] CALL assume(var11 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var11 <= 9) VAL [dummy=0, var0=4, var10=4, var11=8, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, 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, cond=1] [L77] RET assume(var12 >= 1) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L78] CALL assume(var12 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var12 <= 9) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, 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, cond=1] [L81] RET assume(var13 >= 1) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var13=7, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L82] CALL assume(var13 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var13 <= 9) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var13=7, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, 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, cond=1] [L85] RET assume(var14 >= 1) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L86] CALL assume(var14 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var14 <= 9) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, 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, cond=1] [L89] RET assume(var15 >= 1) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L90] CALL assume(var15 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var15 <= 9) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, 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, cond=1] [L93] RET assume(var16 >= 1) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L94] CALL assume(var16 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var16 <= 9) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, 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, cond=1] [L97] RET assume(var17 >= 1) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L98] CALL assume(var17 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume(var17 <= 9) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, 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, cond=1] [L101] RET assume(var18 >= 1) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L102] CALL assume(var18 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L102] RET assume(var18 <= 9) VAL [dummy=0, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L103] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L104] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L105] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L105] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L106] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L107] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L108] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L109] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L109] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L110] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L110] RET assume(var0 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L111] CALL assume(var0 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var0 != var8) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L112] CALL assume(var0 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var0 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L113] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L113] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L114] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L114] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L115] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L116] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L117] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L117] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L118] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L118] RET assume(var1 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L119] CALL assume(var1 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var1 != var8) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L120] CALL assume(var1 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var1 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L121] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L121] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L122] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L122] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L123] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L124] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L125] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L125] RET assume(var2 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L126] CALL assume(var2 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L126] RET assume(var2 != var8) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L127] CALL assume(var2 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var2 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L128] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L129] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L129] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L130] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L130] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L131] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var3 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L132] CALL assume(var3 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var3 != var8) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L133] CALL assume(var3 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L133] RET assume(var3 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L134] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L134] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L135] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L136] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var4 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L137] CALL assume(var4 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L137] RET assume(var4 != var8) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L138] CALL assume(var4 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L138] RET assume(var4 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L139] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L139] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L140] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L141] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L141] RET assume(var5 != var8) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L142] CALL assume(var5 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L142] RET assume(var5 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L143] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L144] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L144] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L145] CALL assume(var6 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L145] RET assume(var6 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L146] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L146] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L147] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L147] RET assume(var7 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L148] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L148] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L149] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L149] RET assume(var10 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L150] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L150] RET assume(var10 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L151] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L151] RET assume(var10 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L152] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var10 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L153] CALL assume(var10 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L153] RET assume(var10 != var15) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L154] CALL assume(var10 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L154] RET assume(var10 != var16) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L155] CALL assume(var10 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var10 != var17) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L156] CALL assume(var10 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L156] RET assume(var10 != var18) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L157] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L157] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L158] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L158] RET assume(var11 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L159] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L159] RET assume(var11 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L160] CALL assume(var11 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L160] RET assume(var11 != var15) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L161] CALL assume(var11 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L161] RET assume(var11 != var16) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L162] CALL assume(var11 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L162] RET assume(var11 != var17) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L163] CALL assume(var11 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L163] RET assume(var11 != var18) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L164] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L164] RET assume(var12 != var13) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L165] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L165] RET assume(var12 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L166] CALL assume(var12 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L166] RET assume(var12 != var15) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L167] CALL assume(var12 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L167] RET assume(var12 != var16) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L168] CALL assume(var12 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L168] RET assume(var12 != var17) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L169] CALL assume(var12 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L169] RET assume(var12 != var18) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L170] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L170] RET assume(var13 != var14) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L171] CALL assume(var13 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L171] RET assume(var13 != var15) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L172] CALL assume(var13 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L172] RET assume(var13 != var16) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L173] CALL assume(var13 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L173] RET assume(var13 != var17) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L174] CALL assume(var13 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L174] RET assume(var13 != var18) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L175] CALL assume(var14 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L175] RET assume(var14 != var15) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L176] CALL assume(var14 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L176] RET assume(var14 != var16) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L177] CALL assume(var14 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L177] RET assume(var14 != var17) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L178] CALL assume(var14 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L178] RET assume(var14 != var18) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L179] CALL assume(var15 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L179] RET assume(var15 != var16) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L180] CALL assume(var15 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L180] RET assume(var15 != var17) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L181] CALL assume(var15 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L181] RET assume(var15 != var18) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L182] CALL assume(var16 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L182] RET assume(var16 != var17) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L183] CALL assume(var16 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L183] RET assume(var16 != var18) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L184] CALL assume(var17 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L184] RET assume(var17 != var18) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5] [L185] int var_for_abs; [L186] var_for_abs = var0 - var1 [L187] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=4] [L188] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L188] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=4] [L189] var_for_abs = var1 - var2 [L190] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=8] [L191] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L191] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=8] [L192] var_for_abs = var2 - var3 [L193] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=9] [L194] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L194] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=9] [L195] var_for_abs = var3 - var4 [L196] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=7] [L197] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L197] RET assume(var13 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=7] [L198] var_for_abs = var4 - var5 [L199] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=5] [L200] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L200] RET assume(var14 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=5] [L201] var_for_abs = var5 - var6 [L202] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=6] [L203] CALL assume(var15 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L203] RET assume(var15 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=6] [L204] var_for_abs = var6 - var7 [L205] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=2] [L206] CALL assume(var16 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L206] RET assume(var16 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=2] [L207] var_for_abs = var7 - var8 [L208] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=3] [L209] CALL assume(var17 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L209] RET assume(var17 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=3] [L210] var_for_abs = var8 - var9 [L211] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=1] [L212] CALL assume(var18 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L212] RET assume(var18 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=1] [L213] reach_error() VAL [dummy=0, myvar0=1, var0=4, var10=4, var11=8, var12=9, var13=7, var14=5, var15=6, var16=2, var17=3, var18=1, var1=8, var2=0, var3=9, var4=2, var5=7, var6=1, var7=3, var8=6, var9=5, var_for_abs=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 164 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 2, TraceHistogramMax: 128, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1 IncrementalHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 288 mSDtfsCounter, 1 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 386 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred 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.0s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1340 NumberOfCodeBlocks, 1340 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 669 ConstructedInterpolants, 0 QuantifiedInterpolants, 669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 32512/32512 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! [2023-12-21 14:49:40,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...