./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-010.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-010.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfe1a42da562b3cff2a3558221569a45820196d22b493b00a35c820fb53c2bd2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:08:21,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:08:21,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:08:21,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:08:21,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:08:21,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:08:21,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:08:21,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:08:21,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:08:21,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:08:21,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:08:21,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:08:21,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:08:21,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:08:21,923 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:08:21,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:08:21,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:08:21,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:08:21,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:08:21,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:08:21,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:08:21,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:08:21,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:08:21,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:08:21,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:08:21,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:08:21,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:08:21,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:08:21,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:08:21,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:08:21,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:08:21,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:08:21,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:08:21,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:08:21,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:08:21,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:08:21,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:08:21,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:08:21,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:08:21,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:08:21,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:08:21,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:08:21,930 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfe1a42da562b3cff2a3558221569a45820196d22b493b00a35c820fb53c2bd2 [2024-10-14 04:08:22,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:08:22,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:08:22,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:08:22,162 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:08:22,162 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:08:22,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-010.c [2024-10-14 04:08:23,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:08:23,555 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:08:23,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-010.c [2024-10-14 04:08:23,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d5c38d8/fdac394de576456cafea33f6e8be7a6f/FLAG29b8166e4 [2024-10-14 04:08:23,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13d5c38d8/fdac394de576456cafea33f6e8be7a6f [2024-10-14 04:08:23,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:08:23,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:08:23,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:08:23,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:08:23,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:08:23,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:08:23" (1/1) ... [2024-10-14 04:08:23,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259f61fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:23, skipping insertion in model container [2024-10-14 04:08:23,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:08:23" (1/1) ... [2024-10-14 04:08:23,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:08:24,144 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-010.c[5778,5791] [2024-10-14 04:08:24,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:08:24,157 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:08:24,189 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-010.c[5778,5791] [2024-10-14 04:08:24,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:08:24,206 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:08:24,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24 WrapperNode [2024-10-14 04:08:24,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:08:24,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:08:24,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:08:24,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:08:24,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (1/1) ... [2024-10-14 04:08:24,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (1/1) ... [2024-10-14 04:08:24,259 INFO L138 Inliner]: procedures = 13, calls = 135, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 258 [2024-10-14 04:08:24,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:08:24,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:08:24,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:08:24,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:08:24,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (1/1) ... [2024-10-14 04:08:24,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (1/1) ... [2024-10-14 04:08:24,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (1/1) ... [2024-10-14 04:08:24,301 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 04:08:24,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (1/1) ... [2024-10-14 04:08:24,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (1/1) ... [2024-10-14 04:08:24,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (1/1) ... [2024-10-14 04:08:24,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (1/1) ... [2024-10-14 04:08:24,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (1/1) ... [2024-10-14 04:08:24,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (1/1) ... [2024-10-14 04:08:24,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:08:24,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:08:24,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:08:24,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:08:24,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (1/1) ... [2024-10-14 04:08:24,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:08:24,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:08:24,366 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) [2024-10-14 04:08:24,368 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 [2024-10-14 04:08:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:08:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:08:24,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:08:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:08:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-10-14 04:08:24,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-10-14 04:08:24,485 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:08:24,486 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:08:24,784 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-14 04:08:24,784 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:08:24,814 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:08:24,815 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 04:08:24,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:08:24 BoogieIcfgContainer [2024-10-14 04:08:24,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:08:24,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:08:24,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:08:24,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:08:24,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:08:23" (1/3) ... [2024-10-14 04:08:24,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ae4363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:08:24, skipping insertion in model container [2024-10-14 04:08:24,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:08:24" (2/3) ... [2024-10-14 04:08:24,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ae4363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:08:24, skipping insertion in model container [2024-10-14 04:08:24,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:08:24" (3/3) ... [2024-10-14 04:08:24,822 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-010.c [2024-10-14 04:08:24,836 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:08:24,837 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 04:08:24,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:08:24,900 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3727ab0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:08:24,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 04:08:24,904 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) [2024-10-14 04:08:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2024-10-14 04:08:24,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:08:24,931 INFO L215 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] [2024-10-14 04:08:24,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:08:24,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:08:24,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2096619517, now seen corresponding path program 1 times [2024-10-14 04:08:24,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:08:24,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350891608] [2024-10-14 04:08:24,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:08:24,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:08:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 04:08:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 04:08:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 04:08:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:08:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 04:08:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 04:08:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:08:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 04:08:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 04:08:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 04:08:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 04:08:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 04:08:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 04:08:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 04:08:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 04:08:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 04:08:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 04:08:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 04:08:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 04:08:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 04:08:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 04:08:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 04:08:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 04:08:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 04:08:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 04:08:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 04:08:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 04:08:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 04:08:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 04:08:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 04:08:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-14 04:08:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-14 04:08:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-14 04:08:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-14 04:08:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-14 04:08:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-14 04:08:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-14 04:08:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-10-14 04:08:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-14 04:08:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-14 04:08:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-10-14 04:08:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-10-14 04:08:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 04:08:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-14 04:08:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-14 04:08:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-14 04:08:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-14 04:08:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-14 04:08:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-14 04:08:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-14 04:08:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-14 04:08:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-14 04:08:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-10-14 04:08:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-14 04:08:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-10-14 04:08:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2024-10-14 04:08:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-10-14 04:08:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-10-14 04:08:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-10-14 04:08:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2024-10-14 04:08:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-10-14 04:08:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-14 04:08:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-10-14 04:08:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2024-10-14 04:08:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-10-14 04:08:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-10-14 04:08:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-10-14 04:08:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2024-10-14 04:08:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2024-10-14 04:08:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2024-10-14 04:08:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2024-10-14 04:08:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2024-10-14 04:08:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-10-14 04:08:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-10-14 04:08:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2024-10-14 04:08:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-10-14 04:08:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-10-14 04:08:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2024-10-14 04:08:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 410 [2024-10-14 04:08:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 415 [2024-10-14 04:08:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2024-10-14 04:08:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2024-10-14 04:08:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 430 [2024-10-14 04:08:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 435 [2024-10-14 04:08:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2024-10-14 04:08:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 445 [2024-10-14 04:08:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 450 [2024-10-14 04:08:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2024-10-14 04:08:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2024-10-14 04:08:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 465 [2024-10-14 04:08:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 470 [2024-10-14 04:08:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2024-10-14 04:08:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2024-10-14 04:08:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2024-10-14 04:08:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 490 [2024-10-14 04:08:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 495 [2024-10-14 04:08:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2024-10-14 04:08:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 505 [2024-10-14 04:08:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 510 [2024-10-14 04:08:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 515 [2024-10-14 04:08:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 520 [2024-10-14 04:08:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 525 [2024-10-14 04:08:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2024-10-14 04:08:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2024-10-14 04:08:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 540 [2024-10-14 04:08:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 545 [2024-10-14 04:08:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 550 [2024-10-14 04:08:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 555 [2024-10-14 04:08:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 560 [2024-10-14 04:08:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 565 [2024-10-14 04:08:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 570 [2024-10-14 04:08:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2024-10-14 04:08:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 580 [2024-10-14 04:08:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 585 [2024-10-14 04:08:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2024-10-14 04:08:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 595 [2024-10-14 04:08:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600 [2024-10-14 04:08:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 605 [2024-10-14 04:08:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 610 [2024-10-14 04:08:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 616 [2024-10-14 04:08:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 622 [2024-10-14 04:08:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2024-10-14 04:08:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 634 [2024-10-14 04:08:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 640 [2024-10-14 04:08:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 646 [2024-10-14 04:08:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 652 [2024-10-14 04:08:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 658 [2024-10-14 04:08:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 664 [2024-10-14 04:08:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:08:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 32512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32512 trivial. 0 not checked. [2024-10-14 04:08:25,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:08:25,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350891608] [2024-10-14 04:08:25,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350891608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:08:25,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:08:25,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 04:08:25,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319573296] [2024-10-14 04:08:25,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:08:25,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 04:08:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:08:25,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 04:08:25,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 04:08:25,741 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) [2024-10-14 04:08:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:08:25,794 INFO L93 Difference]: Finished difference Result 325 states and 707 transitions. [2024-10-14 04:08:25,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 04:08:25,797 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 [2024-10-14 04:08:25,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:08:25,806 INFO L225 Difference]: With dead ends: 325 [2024-10-14 04:08:25,806 INFO L226 Difference]: Without dead ends: 163 [2024-10-14 04:08:25,811 INFO L431 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 [2024-10-14 04:08:25,814 INFO L432 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 [2024-10-14 04:08:25,816 INFO L433 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] [2024-10-14 04:08:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-14 04:08:25,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-14 04:08:25,880 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) [2024-10-14 04:08:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 289 transitions. [2024-10-14 04:08:25,885 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 289 transitions. Word has length 670 [2024-10-14 04:08:25,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:08:25,886 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 289 transitions. [2024-10-14 04:08:25,886 INFO L472 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) [2024-10-14 04:08:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 289 transitions. [2024-10-14 04:08:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2024-10-14 04:08:25,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:08:25,901 INFO L215 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] [2024-10-14 04:08:25,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:08:25,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:08:25,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:08:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1862820777, now seen corresponding path program 1 times [2024-10-14 04:08:25,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:08:25,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361676654] [2024-10-14 04:08:25,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:08:25,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:08:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 04:08:29,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 04:08:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 04:08:33,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 04:08:33,252 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 04:08:33,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 04:08:33,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:08:33,258 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-14 04:08:33,383 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 04:08:33,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 04:08:33 BoogieIcfgContainer [2024-10-14 04:08:33,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 04:08:33,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 04:08:33,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 04:08:33,386 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 04:08:33,387 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:08:24" (3/4) ... [2024-10-14 04:08:33,387 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 04:08:33,507 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 04:08:33,508 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 04:08:33,508 INFO L158 Benchmark]: Toolchain (without parser) took 9546.04ms. Allocated memory was 153.1MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 81.2MB in the beginning and 723.4MB in the end (delta: -642.2MB). Peak memory consumption was 290.8MB. Max. memory is 16.1GB. [2024-10-14 04:08:33,508 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 153.1MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 04:08:33,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.67ms. Allocated memory is still 153.1MB. Free memory was 81.0MB in the beginning and 66.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 04:08:33,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.22ms. Allocated memory is still 153.1MB. Free memory was 66.4MB in the beginning and 63.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 04:08:33,509 INFO L158 Benchmark]: Boogie Preprocessor took 57.72ms. Allocated memory is still 153.1MB. Free memory was 63.8MB in the beginning and 61.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 04:08:33,509 INFO L158 Benchmark]: RCFGBuilder took 497.63ms. Allocated memory was 153.1MB in the beginning and 218.1MB in the end (delta: 65.0MB). Free memory was 61.5MB in the beginning and 165.3MB in the end (delta: -103.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-10-14 04:08:33,510 INFO L158 Benchmark]: TraceAbstraction took 8568.29ms. Allocated memory was 218.1MB in the beginning and 1.1GB in the end (delta: 866.1MB). Free memory was 164.3MB in the beginning and 744.3MB in the end (delta: -580.1MB). Peak memory consumption was 641.9MB. Max. memory is 16.1GB. [2024-10-14 04:08:33,510 INFO L158 Benchmark]: Witness Printer took 121.62ms. Allocated memory is still 1.1GB. Free memory was 744.3MB in the beginning and 723.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 04:08:33,511 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.14ms. Allocated memory is still 153.1MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.67ms. Allocated memory is still 153.1MB. Free memory was 81.0MB in the beginning and 66.4MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.22ms. Allocated memory is still 153.1MB. Free memory was 66.4MB in the beginning and 63.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.72ms. Allocated memory is still 153.1MB. Free memory was 63.8MB in the beginning and 61.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 497.63ms. Allocated memory was 153.1MB in the beginning and 218.1MB in the end (delta: 65.0MB). Free memory was 61.5MB in the beginning and 165.3MB in the end (delta: -103.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8568.29ms. Allocated memory was 218.1MB in the beginning and 1.1GB in the end (delta: 866.1MB). Free memory was 164.3MB in the beginning and 744.3MB in the end (delta: -580.1MB). Peak memory consumption was 641.9MB. Max. memory is 16.1GB. * Witness Printer took 121.62ms. Allocated memory is still 1.1GB. Free memory was 744.3MB in the beginning and 723.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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] [L29] RET assume(var0 >= 0) VAL [var0=5] [L30] CALL assume(var0 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 9) VAL [var0=5] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L33] RET assume(var1 >= 0) VAL [var0=5, var1=4] [L34] CALL assume(var1 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 9) VAL [var0=5, var1=4] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L37] RET assume(var2 >= 0) VAL [var0=5, var1=4, var2=6] [L38] CALL assume(var2 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 9) VAL [var0=5, var1=4, var2=6] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L41] RET assume(var3 >= 0) VAL [var0=5, var1=4, var2=6, var3=3] [L42] CALL assume(var3 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L42] RET assume(var3 <= 9) VAL [var0=5, var1=4, var2=6, var3=3] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L45] RET assume(var4 >= 0) VAL [var0=5, var1=4, var2=6, var3=3, var4=7] [L46] CALL assume(var4 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L46] RET assume(var4 <= 9) VAL [var0=5, var1=4, var2=6, var3=3, var4=7] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L49] RET assume(var5 >= 0) VAL [var0=5, var1=4, var2=6, var3=3, var4=7, var5=2] [L50] CALL assume(var5 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 9) VAL [var0=5, var1=4, var2=6, var3=3, var4=7, var5=2] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L53] RET assume(var6 >= 0) VAL [var0=5, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8] [L54] CALL assume(var6 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 9) VAL [var0=5, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET assume(var7 >= 0) VAL [var0=5, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1] [L58] CALL assume(var7 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 9) VAL [var0=5, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L61] RET assume(var8 >= 0) VAL [var0=5, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9] [L62] CALL assume(var8 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 9) VAL [var0=5, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L65] RET assume(var9 >= 0) VAL [var0=5, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L66] CALL assume(var9 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var9 <= 9) VAL [var0=5, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [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] [L69] RET assume(var10 >= 1) VAL [var0=5, var10=1, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L70] CALL assume(var10 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var10 <= 9) VAL [var0=5, var10=1, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L73] RET assume(var11 >= 1) VAL [var0=5, var10=1, var11=2, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L74] CALL assume(var11 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var11 <= 9) VAL [var0=5, var10=1, var11=2, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L77] RET assume(var12 >= 1) VAL [var0=5, var10=1, var11=2, var12=3, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L78] CALL assume(var12 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var12 <= 9) VAL [var0=5, var10=1, var11=2, var12=3, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L81] RET assume(var13 >= 1) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L82] CALL assume(var13 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L82] RET assume(var13 <= 9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L85] RET assume(var14 >= 1) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L86] CALL assume(var14 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var14 <= 9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L87] int var15; [L88] var15 = __VERIFIER_nondet_int() [L89] CALL assume(var15 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var15 >= 1) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L90] CALL assume(var15 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET assume(var15 <= 9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L91] int var16; [L92] var16 = __VERIFIER_nondet_int() [L93] CALL assume(var16 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET assume(var16 >= 1) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L94] CALL assume(var16 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L94] RET assume(var16 <= 9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L95] int var17; [L96] var17 = __VERIFIER_nondet_int() [L97] CALL assume(var17 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L97] RET assume(var17 >= 1) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L98] CALL assume(var17 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L98] RET assume(var17 <= 9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L99] int var18; [L100] var18 = __VERIFIER_nondet_int() [L101] CALL assume(var18 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L101] RET assume(var18 >= 1) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L102] CALL assume(var18 <= 9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L102] RET assume(var18 <= 9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L103] int myvar0 = 1; VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L104] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L104] RET assume(var0 != var1) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L105] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L105] RET assume(var0 != var2) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L106] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L106] RET assume(var0 != var3) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L107] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L107] RET assume(var0 != var4) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L108] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L108] RET assume(var0 != var5) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L109] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L109] RET assume(var0 != var6) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L110] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L110] RET assume(var0 != var7) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L111] CALL assume(var0 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L111] RET assume(var0 != var8) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L112] CALL assume(var0 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L112] RET assume(var0 != var9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L113] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L113] RET assume(var1 != var2) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L114] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L114] RET assume(var1 != var3) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L115] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L115] RET assume(var1 != var4) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L116] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L116] RET assume(var1 != var5) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L117] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L117] RET assume(var1 != var6) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L118] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L118] RET assume(var1 != var7) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L119] CALL assume(var1 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L119] RET assume(var1 != var8) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L120] CALL assume(var1 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L120] RET assume(var1 != var9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L121] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L121] RET assume(var2 != var3) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L122] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L122] RET assume(var2 != var4) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L123] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L123] RET assume(var2 != var5) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L124] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L124] RET assume(var2 != var6) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L125] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L125] RET assume(var2 != var7) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L126] CALL assume(var2 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L126] RET assume(var2 != var8) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L127] CALL assume(var2 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L127] RET assume(var2 != var9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L128] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L128] RET assume(var3 != var4) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L129] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L129] RET assume(var3 != var5) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L130] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L130] RET assume(var3 != var6) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L131] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L131] RET assume(var3 != var7) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L132] CALL assume(var3 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L132] RET assume(var3 != var8) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L133] CALL assume(var3 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L133] RET assume(var3 != var9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L134] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L134] RET assume(var4 != var5) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L135] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L135] RET assume(var4 != var6) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L136] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L136] RET assume(var4 != var7) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L137] CALL assume(var4 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L137] RET assume(var4 != var8) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L138] CALL assume(var4 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L138] RET assume(var4 != var9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L139] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L139] RET assume(var5 != var6) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L140] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L140] RET assume(var5 != var7) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L141] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L141] RET assume(var5 != var8) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L142] CALL assume(var5 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L142] RET assume(var5 != var9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L143] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L143] RET assume(var6 != var7) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L144] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L144] RET assume(var6 != var8) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L145] CALL assume(var6 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L145] RET assume(var6 != var9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L146] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L146] RET assume(var7 != var8) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L147] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L147] RET assume(var7 != var9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L148] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L148] RET assume(var8 != var9) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L149] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L149] RET assume(var10 != var11) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L150] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L150] RET assume(var10 != var12) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L151] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L151] RET assume(var10 != var13) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L152] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L152] RET assume(var10 != var14) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L153] CALL assume(var10 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L153] RET assume(var10 != var15) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L154] CALL assume(var10 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L154] RET assume(var10 != var16) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L155] CALL assume(var10 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L155] RET assume(var10 != var17) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L156] CALL assume(var10 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L156] RET assume(var10 != var18) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L157] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L157] RET assume(var11 != var12) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L158] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L158] RET assume(var11 != var13) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L159] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L159] RET assume(var11 != var14) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L160] CALL assume(var11 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L160] RET assume(var11 != var15) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L161] CALL assume(var11 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L161] RET assume(var11 != var16) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L162] CALL assume(var11 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L162] RET assume(var11 != var17) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L163] CALL assume(var11 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L163] RET assume(var11 != var18) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L164] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L164] RET assume(var12 != var13) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L165] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L165] RET assume(var12 != var14) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L166] CALL assume(var12 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L166] RET assume(var12 != var15) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L167] CALL assume(var12 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L167] RET assume(var12 != var16) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L168] CALL assume(var12 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L168] RET assume(var12 != var17) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L169] CALL assume(var12 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L169] RET assume(var12 != var18) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L170] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L170] RET assume(var13 != var14) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L171] CALL assume(var13 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L171] RET assume(var13 != var15) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L172] CALL assume(var13 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L172] RET assume(var13 != var16) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L173] CALL assume(var13 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L173] RET assume(var13 != var17) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L174] CALL assume(var13 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L174] RET assume(var13 != var18) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L175] CALL assume(var14 != var15) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L175] RET assume(var14 != var15) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L176] CALL assume(var14 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L176] RET assume(var14 != var16) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L177] CALL assume(var14 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L177] RET assume(var14 != var17) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L178] CALL assume(var14 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L178] RET assume(var14 != var18) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L179] CALL assume(var15 != var16) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L179] RET assume(var15 != var16) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L180] CALL assume(var15 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L180] RET assume(var15 != var17) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L181] CALL assume(var15 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L181] RET assume(var15 != var18) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L182] CALL assume(var16 != var17) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L182] RET assume(var16 != var17) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L183] CALL assume(var16 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L183] RET assume(var16 != var18) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [L184] CALL assume(var17 != var18) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L184] RET assume(var17 != var18) VAL [var0=5, var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0] [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 [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0, var_for_abs=1] [L188] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L188] RET assume(var10 == var_for_abs) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var1=4, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0, var_for_abs=1] [L189] var_for_abs = var1 - var2 [L190] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0, var_for_abs=2] [L191] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L191] RET assume(var11 == var_for_abs) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var2=6, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0, var_for_abs=2] [L192] var_for_abs = var2 - var3 [L193] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0, var_for_abs=3] [L194] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L194] RET assume(var12 == var_for_abs) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var3=3, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0, var_for_abs=3] [L195] var_for_abs = var3 - var4 [L196] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0, var_for_abs=4] [L197] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L197] RET assume(var13 == var_for_abs) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var4=7, var5=2, var6=8, var7=1, var8=9, var9=0, var_for_abs=4] [L198] var_for_abs = var4 - var5 [L199] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var5=2, var6=8, var7=1, var8=9, var9=0, var_for_abs=5] [L200] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L200] RET assume(var14 == var_for_abs) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var5=2, var6=8, var7=1, var8=9, var9=0, 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 [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var6=8, var7=1, var8=9, var9=0, var_for_abs=6] [L203] CALL assume(var15 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L203] RET assume(var15 == var_for_abs) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var6=8, var7=1, var8=9, var9=0, 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 [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var7=1, var8=9, var9=0, var_for_abs=7] [L206] CALL assume(var16 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L206] RET assume(var16 == var_for_abs) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var7=1, var8=9, var9=0, var_for_abs=7] [L207] var_for_abs = var7 - var8 [L208] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var8=9, var9=0, var_for_abs=8] [L209] CALL assume(var17 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L209] RET assume(var17 == var_for_abs) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var8=9, var9=0, var_for_abs=8] [L210] var_for_abs = var8 - var9 [L211] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var_for_abs=9] [L212] CALL assume(var18 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L212] RET assume(var18 == var_for_abs) VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var_for_abs=9] [L213] reach_error() VAL [var10=1, var11=2, var12=3, var13=4, var14=5, var15=6, var16=7, var17=8, var18=9, var_for_abs=9] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 164 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 2, TraceHistogramMax: 128, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, 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.2s SatisfiabilityAnalysisTime, 0.6s 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! [2024-10-14 04:08:33,547 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE