./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/xcsp/AllInterval-008.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/xcsp/AllInterval-008.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 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:13:33,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:13:33,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:13:33,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:13:33,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:13:33,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:13:33,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:13:33,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:13:33,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:13:33,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:13:33,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:13:33,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:13:33,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:13:33,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:13:33,885 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:13:33,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:13:33,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:13:33,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:13:33,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:13:33,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:13:33,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:13:33,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:13:33,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:13:33,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:13:33,891 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:13:33,891 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:13:33,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:13:33,891 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:13:33,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:13:33,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:13:33,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:13:33,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:13:33,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:13:33,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:13:33,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:13:33,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:13:33,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:13:33,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:13:33,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:13:33,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:13:33,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:13:33,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:13:33,897 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 -> 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 [2024-11-08 16:13:34,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:13:34,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:13:34,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:13:34,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:13:34,141 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:13:34,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-008.c [2024-11-08 16:13:35,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:13:35,736 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:13:35,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-008.c [2024-11-08 16:13:35,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170dfe1e7/2c51383ca98d4410a8c3643a38e3f122/FLAGeb1ba61dd [2024-11-08 16:13:35,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170dfe1e7/2c51383ca98d4410a8c3643a38e3f122 [2024-11-08 16:13:35,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:13:35,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:13:35,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:13:35,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:13:35,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:13:35,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:13:35" (1/1) ... [2024-11-08 16:13:35,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ab9066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:35, skipping insertion in model container [2024-11-08 16:13:35,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:13:35" (1/1) ... [2024-11-08 16:13:35,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:13:35,970 WARN L250 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-008.c[4334,4347] [2024-11-08 16:13:35,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:13:35,985 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:13:36,017 WARN L250 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-008.c[4334,4347] [2024-11-08 16:13:36,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:13:36,038 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:13:36,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36 WrapperNode [2024-11-08 16:13:36,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:13:36,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:13:36,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:13:36,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:13:36,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (1/1) ... [2024-11-08 16:13:36,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (1/1) ... [2024-11-08 16:13:36,074 INFO L138 Inliner]: procedures = 13, calls = 93, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 192 [2024-11-08 16:13:36,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:13:36,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:13:36,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:13:36,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:13:36,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (1/1) ... [2024-11-08 16:13:36,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (1/1) ... [2024-11-08 16:13:36,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (1/1) ... [2024-11-08 16:13:36,105 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 16:13:36,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (1/1) ... [2024-11-08 16:13:36,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (1/1) ... [2024-11-08 16:13:36,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (1/1) ... [2024-11-08 16:13:36,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (1/1) ... [2024-11-08 16:13:36,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (1/1) ... [2024-11-08 16:13:36,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (1/1) ... [2024-11-08 16:13:36,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:13:36,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:13:36,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:13:36,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:13:36,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (1/1) ... [2024-11-08 16:13:36,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:13:36,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:13:36,157 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-11-08 16:13:36,159 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-11-08 16:13:36,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:13:36,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:13:36,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:13:36,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:13:36,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-11-08 16:13:36,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-11-08 16:13:36,254 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:13:36,256 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:13:36,516 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-08 16:13:36,516 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:13:36,534 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:13:36,534 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:13:36,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:13:36 BoogieIcfgContainer [2024-11-08 16:13:36,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:13:36,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:13:36,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:13:36,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:13:36,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:13:35" (1/3) ... [2024-11-08 16:13:36,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd33093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:13:36, skipping insertion in model container [2024-11-08 16:13:36,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:13:36" (2/3) ... [2024-11-08 16:13:36,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd33093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:13:36, skipping insertion in model container [2024-11-08 16:13:36,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:13:36" (3/3) ... [2024-11-08 16:13:36,545 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-008.c [2024-11-08 16:13:36,561 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:13:36,561 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:13:36,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:13:36,630 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;@2efd979, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:13:36,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:13:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-08 16:13:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-08 16:13:36,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:36,654 INFO L215 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:36,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:36,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:36,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1564691013, now seen corresponding path program 1 times [2024-11-08 16:13:36,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:36,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490207179] [2024-11-08 16:13:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 16:13:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 16:13:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 16:13:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 16:13:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 16:13:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:13:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:13:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 16:13:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 16:13:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:13:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 16:13:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 16:13:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 16:13:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 16:13:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 16:13:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 16:13:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 16:13:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:13:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:13:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 16:13:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 16:13:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 16:13:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 16:13:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 16:13:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 16:13:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 16:13:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 16:13:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 16:13:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 16:13:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 16:13:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 16:13:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 16:13:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 16:13:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 16:13:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 16:13:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-08 16:13:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-08 16:13:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-08 16:13:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-08 16:13:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-08 16:13:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-08 16:13:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-08 16:13:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-08 16:13:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-08 16:13:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-08 16:13:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-08 16:13:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-08 16:13:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-08 16:13:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-08 16:13:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-08 16:13:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-08 16:13:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-08 16:13:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-08 16:13:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-08 16:13:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-08 16:13:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-08 16:13:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-11-08 16:13:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-08 16:13:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-11-08 16:13:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-11-08 16:13:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-11-08 16:13:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2024-11-08 16:13:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2024-11-08 16:13:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2024-11-08 16:13:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-11-08 16:13:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-11-08 16:13:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-11-08 16:13:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-11-08 16:13:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-08 16:13:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-08 16:13:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-08 16:13:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2024-11-08 16:13:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2024-11-08 16:13:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2024-11-08 16:13:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2024-11-08 16:13:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2024-11-08 16:13:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2024-11-08 16:13:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2024-11-08 16:13:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2024-11-08 16:13:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-08 16:13:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-08 16:13:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2024-11-08 16:13:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2024-11-08 16:13:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 437 [2024-11-08 16:13:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2024-11-08 16:13:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2024-11-08 16:13:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2024-11-08 16:13:37,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:13:37,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490207179] [2024-11-08 16:13:37,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490207179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:13:37,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:13:37,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:13:37,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417382398] [2024-11-08 16:13:37,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:13:37,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:13:37,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:13:37,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:13:37,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:13:37,427 INFO L87 Difference]: Start difference. First operand has 119 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2024-11-08 16:13:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:37,467 INFO L93 Difference]: Finished difference Result 232 states and 488 transitions. [2024-11-08 16:13:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:13:37,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 455 [2024-11-08 16:13:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:37,481 INFO L225 Difference]: With dead ends: 232 [2024-11-08 16:13:37,481 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 16:13:37,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:13:37,489 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:37,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:13:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 16:13:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-08 16:13:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 28 states have (on average 1.0) internal successors, (28), 28 states have internal predecessors, (28), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-08 16:13:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 200 transitions. [2024-11-08 16:13:37,555 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 200 transitions. Word has length 455 [2024-11-08 16:13:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:37,555 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 200 transitions. [2024-11-08 16:13:37,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2024-11-08 16:13:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 200 transitions. [2024-11-08 16:13:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-08 16:13:37,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:37,563 INFO L215 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:37,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:13:37,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:37,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:37,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1305604715, now seen corresponding path program 1 times [2024-11-08 16:13:37,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:37,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49603186] [2024-11-08 16:13:37,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:13:38,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:13:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:13:40,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:13:40,190 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:13:40,193 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:13:40,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:13:40,198 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 16:13:40,313 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:13:40,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:13:40 BoogieIcfgContainer [2024-11-08 16:13:40,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:13:40,321 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:13:40,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:13:40,321 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:13:40,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:13:36" (3/4) ... [2024-11-08 16:13:40,322 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 16:13:40,432 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 16:13:40,432 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:13:40,433 INFO L158 Benchmark]: Toolchain (without parser) took 4663.94ms. Allocated memory was 176.2MB in the beginning and 335.5MB in the end (delta: 159.4MB). Free memory was 147.1MB in the beginning and 275.0MB in the end (delta: -127.9MB). Peak memory consumption was 208.2MB. Max. memory is 16.1GB. [2024-11-08 16:13:40,433 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory was 90.2MB in the beginning and 90.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:13:40,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.66ms. Allocated memory is still 176.2MB. Free memory was 147.1MB in the beginning and 132.5MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 16:13:40,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.98ms. Allocated memory is still 176.2MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:13:40,433 INFO L158 Benchmark]: Boogie Preprocessor took 43.32ms. Allocated memory is still 176.2MB. Free memory was 130.4MB in the beginning and 128.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:13:40,434 INFO L158 Benchmark]: RCFGBuilder took 410.23ms. Allocated memory is still 176.2MB. Free memory was 128.3MB in the beginning and 108.1MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 16:13:40,434 INFO L158 Benchmark]: TraceAbstraction took 3784.07ms. Allocated memory was 176.2MB in the beginning and 335.5MB in the end (delta: 159.4MB). Free memory was 107.4MB in the beginning and 102.0MB in the end (delta: 5.4MB). Peak memory consumption was 166.2MB. Max. memory is 16.1GB. [2024-11-08 16:13:40,434 INFO L158 Benchmark]: Witness Printer took 111.68ms. Allocated memory is still 335.5MB. Free memory was 102.0MB in the beginning and 275.0MB in the end (delta: -173.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:13:40,436 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.19ms. Allocated memory is still 125.8MB. Free memory was 90.2MB in the beginning and 90.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.66ms. Allocated memory is still 176.2MB. Free memory was 147.1MB in the beginning and 132.5MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.98ms. Allocated memory is still 176.2MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.32ms. Allocated memory is still 176.2MB. Free memory was 130.4MB in the beginning and 128.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.23ms. Allocated memory is still 176.2MB. Free memory was 128.3MB in the beginning and 108.1MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3784.07ms. Allocated memory was 176.2MB in the beginning and 335.5MB in the end (delta: 159.4MB). Free memory was 107.4MB in the beginning and 102.0MB in the end (delta: 5.4MB). Peak memory consumption was 166.2MB. Max. memory is 16.1GB. * Witness Printer took 111.68ms. Allocated memory is still 335.5MB. Free memory was 102.0MB in the beginning and 275.0MB in the end (delta: -173.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 159]: 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=2] [L30] CALL assume(var0 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 7) VAL [var0=2] [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=2, var1=6] [L34] CALL assume(var1 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 7) VAL [var0=2, var1=6] [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=2, var1=6, var2=1] [L38] CALL assume(var2 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 7) VAL [var0=2, var1=6, var2=1] [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=2, var1=6, var2=1, var3=7] [L42] CALL assume(var3 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L42] RET assume(var3 <= 7) VAL [var0=2, var1=6, var2=1, var3=7] [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=2, var1=6, var2=1, var3=7, var4=0] [L46] CALL assume(var4 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L46] RET assume(var4 <= 7) VAL [var0=2, var1=6, var2=1, var3=7, var4=0] [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=2, var1=6, var2=1, var3=7, var4=0, var5=3] [L50] CALL assume(var5 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 7) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, var5=3] [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=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5] [L54] CALL assume(var6 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 7) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5] [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=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4] [L58] CALL assume(var7 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 7) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L61] RET assume(var8 >= 1) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4] [L62] CALL assume(var8 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 7) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L65] RET assume(var9 >= 1) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L66] CALL assume(var9 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var9 <= 7) VAL [var0=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L69] RET assume(var10 >= 1) VAL [var0=2, var10=6, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L70] CALL assume(var10 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var10 <= 7) VAL [var0=2, var10=6, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L73] RET assume(var11 >= 1) VAL [var0=2, var10=6, var11=7, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L74] CALL assume(var11 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var11 <= 7) VAL [var0=2, var10=6, var11=7, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L77] RET assume(var12 >= 1) VAL [var0=2, var10=6, var11=7, var12=3, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L78] CALL assume(var12 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var12 <= 7) VAL [var0=2, var10=6, var11=7, var12=3, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L79] int var13; [L80] var13 = __VERIFIER_nondet_int() [L81] CALL assume(var13 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L81] RET assume(var13 >= 1) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L82] CALL assume(var13 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L82] RET assume(var13 <= 7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L83] int var14; [L84] var14 = __VERIFIER_nondet_int() [L85] CALL assume(var14 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L85] RET assume(var14 >= 1) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L86] CALL assume(var14 <= 7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var14 <= 7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L87] int myvar0 = 1; VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L88] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L88] RET assume(var0 != var1) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L89] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var0 != var2) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L90] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET assume(var0 != var3) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L91] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L91] RET assume(var0 != var4) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L92] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L92] RET assume(var0 != var5) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L93] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET assume(var0 != var6) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L94] CALL assume(var0 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L94] RET assume(var0 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L95] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L95] RET assume(var1 != var2) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L96] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L96] RET assume(var1 != var3) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L97] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L97] RET assume(var1 != var4) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L98] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L98] RET assume(var1 != var5) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L99] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L99] RET assume(var1 != var6) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L100] CALL assume(var1 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L100] RET assume(var1 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L101] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L101] RET assume(var2 != var3) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L102] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L102] RET assume(var2 != var4) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L103] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L103] RET assume(var2 != var5) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L104] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L104] RET assume(var2 != var6) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L105] CALL assume(var2 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L105] RET assume(var2 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L106] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L106] RET assume(var3 != var4) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L107] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L107] RET assume(var3 != var5) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L108] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L108] RET assume(var3 != var6) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L109] CALL assume(var3 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L109] RET assume(var3 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L110] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L110] RET assume(var4 != var5) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L111] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L111] RET assume(var4 != var6) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L112] CALL assume(var4 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L112] RET assume(var4 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L113] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L113] RET assume(var5 != var6) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L114] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L114] RET assume(var5 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L115] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L115] RET assume(var6 != var7) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L116] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L116] RET assume(var8 != var9) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L117] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L117] RET assume(var8 != var10) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L118] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L118] RET assume(var8 != var11) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L119] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L119] RET assume(var8 != var12) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L120] CALL assume(var8 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L120] RET assume(var8 != var13) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L121] CALL assume(var8 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L121] RET assume(var8 != var14) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L122] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L122] RET assume(var9 != var10) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L123] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L123] RET assume(var9 != var11) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L124] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L124] RET assume(var9 != var12) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L125] CALL assume(var9 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L125] RET assume(var9 != var13) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L126] CALL assume(var9 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L126] RET assume(var9 != var14) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L127] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L127] RET assume(var10 != var11) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L128] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L128] RET assume(var10 != var12) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L129] CALL assume(var10 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L129] RET assume(var10 != var13) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L130] CALL assume(var10 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L130] RET assume(var10 != var14) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L131] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L131] RET assume(var11 != var12) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L132] CALL assume(var11 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L132] RET assume(var11 != var13) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L133] CALL assume(var11 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L133] RET assume(var11 != var14) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L134] CALL assume(var12 != var13) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L134] RET assume(var12 != var13) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L135] CALL assume(var12 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L135] RET assume(var12 != var14) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L136] CALL assume(var13 != var14) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L136] RET assume(var13 != var14) VAL [var0=2, var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5] [L137] int var_for_abs; [L138] var_for_abs = var0 - var1 [L139] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=4] [L140] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L140] RET assume(var8 == var_for_abs) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var1=6, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=4] [L141] var_for_abs = var1 - var2 [L142] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=5] [L143] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L143] RET assume(var9 == var_for_abs) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var2=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=5] [L144] var_for_abs = var2 - var3 [L145] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=6] [L146] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L146] RET assume(var10 == var_for_abs) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var3=7, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=6] [L147] var_for_abs = var3 - var4 [L148] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=7] [L149] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L149] RET assume(var11 == var_for_abs) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var4=0, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=7] [L150] var_for_abs = var4 - var5 [L151] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=3] [L152] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L152] RET assume(var12 == var_for_abs) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var5=3, var6=5, var7=4, var8=4, var9=5, var_for_abs=3] [L153] var_for_abs = var5 - var6 [L154] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var6=5, var7=4, var8=4, var9=5, var_for_abs=2] [L155] CALL assume(var13 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L155] RET assume(var13 == var_for_abs) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var6=5, var7=4, var8=4, var9=5, var_for_abs=2] [L156] var_for_abs = var6 - var7 [L157] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var8=4, var9=5, var_for_abs=1] [L158] CALL assume(var14 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L158] RET assume(var14 == var_for_abs) VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var8=4, var9=5, var_for_abs=1] [L159] reach_error() VAL [var10=6, var11=7, var12=3, var13=2, var14=1, var8=4, var9=5, var_for_abs=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 2, TraceHistogramMax: 86, 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, 200 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 200 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 910 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 14620/14620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 16:13:40,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE