/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/xcsp/AllInterval-006.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 11:49:22,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 11:49:22,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 11:49:22,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 11:49:22,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 11:49:22,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 11:49:22,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 11:49:22,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 11:49:22,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 11:49:22,128 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 11:49:22,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 11:49:22,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 11:49:22,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 11:49:22,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 11:49:22,130 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 11:49:22,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 11:49:22,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 11:49:22,131 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 11:49:22,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 11:49:22,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 11:49:22,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 11:49:22,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 11:49:22,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 11:49:22,133 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 11:49:22,133 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 11:49:22,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 11:49:22,134 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 11:49:22,134 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 11:49:22,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 11:49:22,134 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 11:49:22,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 11:49:22,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 11:49:22,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 11:49:22,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 11:49:22,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:49:22,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 11:49:22,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 11:49:22,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 11:49:22,136 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 11:49:22,137 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 11:49:22,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 11:49:22,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 11:49:22,137 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 11:49:22,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 11:49:22,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 11:49:22,138 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 11:49:22,138 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 [2023-12-25 11:49:22,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 11:49:22,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 11:49:22,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 11:49:22,386 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 11:49:22,390 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 11:49:22,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/xcsp/AllInterval-006.c [2023-12-25 11:49:23,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 11:49:23,713 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 11:49:23,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-006.c [2023-12-25 11:49:23,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0da8164/6fbd0c2c11d54265a302327e0c449086/FLAGf6b58da47 [2023-12-25 11:49:23,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0da8164/6fbd0c2c11d54265a302327e0c449086 [2023-12-25 11:49:23,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 11:49:23,734 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 11:49:23,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 11:49:23,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 11:49:23,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 11:49:23,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:23,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eae85dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23, skipping insertion in model container [2023-12-25 11:49:23,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:23,764 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 11:49:23,894 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-006.c[3098,3111] [2023-12-25 11:49:23,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:49:23,920 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 11:49:23,938 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-006.c[3098,3111] [2023-12-25 11:49:23,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 11:49:23,963 INFO L206 MainTranslator]: Completed translation [2023-12-25 11:49:23,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23 WrapperNode [2023-12-25 11:49:23,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 11:49:23,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 11:49:23,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 11:49:23,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 11:49:23,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:23,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:24,028 INFO L138 Inliner]: procedures = 13, calls = 59, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2023-12-25 11:49:24,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 11:49:24,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 11:49:24,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 11:49:24,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 11:49:24,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:24,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:24,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:24,072 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 11:49:24,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:24,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:24,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:24,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:24,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:24,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:24,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 11:49:24,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 11:49:24,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 11:49:24,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 11:49:24,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (1/1) ... [2023-12-25 11:49:24,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 11:49:24,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 11:49:24,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 11:49:24,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 11:49:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 11:49:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 11:49:24,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 11:49:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 11:49:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2023-12-25 11:49:24,152 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2023-12-25 11:49:24,204 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 11:49:24,206 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 11:49:24,435 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 11:49:24,534 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 11:49:24,535 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 11:49:24,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:49:24 BoogieIcfgContainer [2023-12-25 11:49:24,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 11:49:24,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 11:49:24,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 11:49:24,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 11:49:24,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 11:49:23" (1/3) ... [2023-12-25 11:49:24,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436c1579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:49:24, skipping insertion in model container [2023-12-25 11:49:24,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 11:49:23" (2/3) ... [2023-12-25 11:49:24,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436c1579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 11:49:24, skipping insertion in model container [2023-12-25 11:49:24,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 11:49:24" (3/3) ... [2023-12-25 11:49:24,541 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-006.c [2023-12-25 11:49:24,554 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 11:49:24,554 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 11:49:24,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 11:49:24,608 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4e189b66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 11:49:24,608 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 11:49:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-25 11:49:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2023-12-25 11:49:24,634 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 11:49:24,635 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 11:49:24,636 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 11:49:24,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 11:49:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash -314292702, now seen corresponding path program 1 times [2023-12-25 11:49:24,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 11:49:24,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799287325] [2023-12-25 11:49:24,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 11:49:24,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:49:24,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 11:49:24,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 11:49:24,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 11:49:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 11:49:24,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 11:49:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 11:49:25,173 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 11:49:25,175 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 11:49:25,176 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 11:49:25,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 11:49:25,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 11:49:25,392 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-25 11:49:25,397 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 11:49:25,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 11:49:25 BoogieIcfgContainer [2023-12-25 11:49:25,474 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 11:49:25,475 INFO L158 Benchmark]: Toolchain (without parser) took 1740.76ms. Allocated memory is still 339.7MB. Free memory was 287.2MB in the beginning and 261.2MB in the end (delta: 26.0MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. [2023-12-25 11:49:25,475 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 228.6MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 11:49:25,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.42ms. Allocated memory is still 339.7MB. Free memory was 287.0MB in the beginning and 274.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 11:49:25,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.37ms. Allocated memory is still 339.7MB. Free memory was 274.5MB in the beginning and 272.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 11:49:25,476 INFO L158 Benchmark]: Boogie Preprocessor took 52.87ms. Allocated memory is still 339.7MB. Free memory was 272.6MB in the beginning and 270.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 11:49:25,477 INFO L158 Benchmark]: RCFGBuilder took 453.16ms. Allocated memory is still 339.7MB. Free memory was 270.5MB in the beginning and 304.2MB in the end (delta: -33.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-25 11:49:25,477 INFO L158 Benchmark]: TraceAbstraction took 937.19ms. Allocated memory is still 339.7MB. Free memory was 303.7MB in the beginning and 261.2MB in the end (delta: 42.5MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2023-12-25 11:49:25,479 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.46ms. Allocated memory is still 228.6MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.42ms. Allocated memory is still 339.7MB. Free memory was 287.0MB in the beginning and 274.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.37ms. Allocated memory is still 339.7MB. Free memory was 274.5MB in the beginning and 272.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.87ms. Allocated memory is still 339.7MB. Free memory was 272.6MB in the beginning and 270.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 453.16ms. Allocated memory is still 339.7MB. Free memory was 270.5MB in the beginning and 304.2MB in the end (delta: -33.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 937.19ms. Allocated memory is still 339.7MB. Free memory was 303.7MB in the beginning and 261.2MB in the end (delta: 42.5MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 113]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=0] [L30] CALL assume(var0 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 5) VAL [dummy=0, var0=0] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=0, var1=5] [L34] CALL assume(var1 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 5) VAL [dummy=0, var0=0, var1=5] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=0, var1=5, var2=1] [L38] CALL assume(var2 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 5) VAL [dummy=0, var0=0, var1=5, 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, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4] [L42] CALL assume(var3 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 5) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4, var4=2] [L46] CALL assume(var4 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 5) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4, var4=2] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume(var5 >= 0) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4, var4=2, var5=3] [L50] CALL assume(var5 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 5) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4, var4=2, var5=3] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 1) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5] [L54] CALL assume(var6 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 5) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 1) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4] [L58] CALL assume(var7 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 5) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4, var4=2, 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, cond=1] [L61] RET assume(var8 >= 1) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3] [L62] CALL assume(var8 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 5) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3] [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, cond=1] [L65] RET assume(var9 >= 1) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L66] CALL assume(var9 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 5) VAL [dummy=0, var0=0, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var10 >= 1) VAL [dummy=0, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L70] CALL assume(var10 <= 5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 5) VAL [dummy=0, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L71] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L72] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L73] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L74] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L75] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L76] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L77] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L78] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L79] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L80] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L81] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L81] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L82] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L83] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L84] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L84] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L85] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L85] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L86] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L87] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L88] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L89] CALL assume(var6 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var6 != var9) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L90] CALL assume(var6 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var6 != var10) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L91] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L92] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var7 != var9) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L93] CALL assume(var7 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L93] RET assume(var7 != var10) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L94] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L95] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var8 != var10) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L96] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2] [L97] int var_for_abs; [L98] var_for_abs = var0 - var1 [L99] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2, var_for_abs=5] [L100] CALL assume(var6 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var6 == var_for_abs) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2, var_for_abs=5] [L101] var_for_abs = var1 - var2 [L102] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2, var_for_abs=4] [L103] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var7 == var_for_abs) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2, var_for_abs=4] [L104] var_for_abs = var2 - var3 [L105] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2, var_for_abs=3] [L106] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2, var_for_abs=3] [L107] var_for_abs = var3 - var4 [L108] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2, var_for_abs=2] [L109] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L109] RET assume(var9 == var_for_abs) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2, var_for_abs=2] [L110] var_for_abs = var4 - var5 [L111] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2, var_for_abs=1] [L112] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2, var_for_abs=1] [L113] reach_error() VAL [dummy=0, myvar0=1, var0=0, var10=1, var1=5, var2=1, var3=4, var4=2, var5=3, var6=5, var7=4, var8=3, var9=2, var_for_abs=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 1, TraceHistogramMax: 52, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-25 11:49:25,506 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...