/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/xcsp/AllInterval-005.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 14:49:17,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 14:49:17,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 14:49:17,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 14:49:17,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 14:49:17,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 14:49:17,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 14:49:17,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 14:49:17,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 14:49:17,272 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 14:49:17,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 14:49:17,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 14:49:17,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 14:49:17,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 14:49:17,274 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 14:49:17,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 14:49:17,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 14:49:17,275 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 14:49:17,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 14:49:17,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 14:49:17,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 14:49:17,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 14:49:17,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 14:49:17,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 14:49:17,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 14:49:17,277 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 14:49:17,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 14:49:17,277 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 14:49:17,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 14:49:17,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 14:49:17,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 14:49:17,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 14:49:17,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 14:49:17,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 14:49:17,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 14:49:17,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 14:49:17,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 14:49:17,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 14:49:17,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 14:49:17,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 14:49:17,280 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 14:49:17,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 14:49:17,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 14:49:17,280 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 14:49:17,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 14:49:17,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 14:49:17,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 14:49:17,523 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 14:49:17,523 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 14:49:17,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/xcsp/AllInterval-005.c [2023-12-21 14:49:18,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 14:49:18,811 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 14:49:18,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-005.c [2023-12-21 14:49:18,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a971c89e8/7a553307354c483d93587cfbc18735f5/FLAGae5e23d2f [2023-12-21 14:49:18,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a971c89e8/7a553307354c483d93587cfbc18735f5 [2023-12-21 14:49:18,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 14:49:18,830 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 14:49:18,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 14:49:18,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 14:49:18,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 14:49:18,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:49:18" (1/1) ... [2023-12-21 14:49:18,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707053af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:18, skipping insertion in model container [2023-12-21 14:49:18,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:49:18" (1/1) ... [2023-12-21 14:49:18,870 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 14:49:19,008 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-005.c[2566,2579] [2023-12-21 14:49:19,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 14:49:19,032 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 14:49:19,049 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-005.c[2566,2579] [2023-12-21 14:49:19,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 14:49:19,061 INFO L206 MainTranslator]: Completed translation [2023-12-21 14:49:19,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19 WrapperNode [2023-12-21 14:49:19,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 14:49:19,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 14:49:19,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 14:49:19,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 14:49:19,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (1/1) ... [2023-12-21 14:49:19,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (1/1) ... [2023-12-21 14:49:19,095 INFO L138 Inliner]: procedures = 13, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 108 [2023-12-21 14:49:19,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 14:49:19,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 14:49:19,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 14:49:19,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 14:49:19,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (1/1) ... [2023-12-21 14:49:19,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (1/1) ... [2023-12-21 14:49:19,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (1/1) ... [2023-12-21 14:49:19,126 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-21 14:49:19,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (1/1) ... [2023-12-21 14:49:19,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (1/1) ... [2023-12-21 14:49:19,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (1/1) ... [2023-12-21 14:49:19,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (1/1) ... [2023-12-21 14:49:19,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (1/1) ... [2023-12-21 14:49:19,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (1/1) ... [2023-12-21 14:49:19,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 14:49:19,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 14:49:19,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 14:49:19,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 14:49:19,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (1/1) ... [2023-12-21 14:49:19,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 14:49:19,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 14:49:19,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 14:49:19,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 14:49:19,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 14:49:19,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 14:49:19,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 14:49:19,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 14:49:19,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2023-12-21 14:49:19,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2023-12-21 14:49:19,244 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 14:49:19,246 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 14:49:19,432 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 14:49:19,454 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 14:49:19,454 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-21 14:49:19,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:49:19 BoogieIcfgContainer [2023-12-21 14:49:19,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 14:49:19,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 14:49:19,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 14:49:19,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 14:49:19,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:49:18" (1/3) ... [2023-12-21 14:49:19,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd31bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:49:19, skipping insertion in model container [2023-12-21 14:49:19,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:49:19" (2/3) ... [2023-12-21 14:49:19,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd31bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:49:19, skipping insertion in model container [2023-12-21 14:49:19,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:49:19" (3/3) ... [2023-12-21 14:49:19,496 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2023-12-21 14:49:19,517 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 14:49:19,517 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 14:49:19,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 14:49:19,575 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;@5b392d8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 14:49:19,575 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 14:49:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-21 14:49:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-21 14:49:19,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 14:49:19,595 INFO L195 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 14:49:19,596 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 14:49:19,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 14:49:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1383881084, now seen corresponding path program 1 times [2023-12-21 14:49:19,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 14:49:19,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712319231] [2023-12-21 14:49:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 14:49:19,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 14:49:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 14:49:20,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 14:49:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 14:49:20,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 14:49:20,301 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 14:49:20,303 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 14:49:20,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 14:49:20,309 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-12-21 14:49:20,313 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 14:49:20,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:49:20 BoogieIcfgContainer [2023-12-21 14:49:20,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 14:49:20,369 INFO L158 Benchmark]: Toolchain (without parser) took 1538.95ms. Allocated memory is still 318.8MB. Free memory was 263.6MB in the beginning and 211.3MB in the end (delta: 52.3MB). Peak memory consumption was 53.3MB. Max. memory is 8.0GB. [2023-12-21 14:49:20,370 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 211.8MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 14:49:20,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.82ms. Allocated memory is still 318.8MB. Free memory was 263.6MB in the beginning and 251.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 14:49:20,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.99ms. Allocated memory is still 318.8MB. Free memory was 251.8MB in the beginning and 250.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 14:49:20,371 INFO L158 Benchmark]: Boogie Preprocessor took 38.72ms. Allocated memory is still 318.8MB. Free memory was 250.1MB in the beginning and 248.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 14:49:20,372 INFO L158 Benchmark]: RCFGBuilder took 319.26ms. Allocated memory is still 318.8MB. Free memory was 248.2MB in the beginning and 234.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 14:49:20,372 INFO L158 Benchmark]: TraceAbstraction took 902.55ms. Allocated memory is still 318.8MB. Free memory was 233.3MB in the beginning and 211.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. [2023-12-21 14:49:20,375 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 211.8MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.82ms. Allocated memory is still 318.8MB. Free memory was 263.6MB in the beginning and 251.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.99ms. Allocated memory is still 318.8MB. Free memory was 251.8MB in the beginning and 250.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.72ms. Allocated memory is still 318.8MB. Free memory was 250.1MB in the beginning and 248.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 319.26ms. Allocated memory is still 318.8MB. Free memory was 248.2MB in the beginning and 234.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 902.55ms. Allocated memory is still 318.8MB. Free memory was 233.3MB in the beginning and 211.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 93]: 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=1] [L30] CALL assume(var0 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 4) VAL [dummy=0, var0=1] [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=1, var1=2] [L34] CALL assume(var1 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 4) VAL [dummy=0, var0=1, var1=2] [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=1, var1=2, var2=4] [L38] CALL assume(var2 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 4) VAL [dummy=0, var0=1, var1=2, var2=4] [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=1, var1=2, var2=4, var3=0] [L42] CALL assume(var3 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 4) VAL [dummy=0, var0=1, var1=2, var2=4, var3=0] [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=1, var1=2, var2=4, var3=0, var4=3] [L46] CALL assume(var4 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 4) VAL [dummy=0, var0=1, var1=2, var2=4, var3=0, var4=3] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume(var5 >= 1) VAL [dummy=0, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1] [L50] CALL assume(var5 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 4) VAL [dummy=0, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1] [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=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2] [L54] CALL assume(var6 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 4) VAL [dummy=0, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2] [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=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4] [L58] CALL assume(var7 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 4) VAL [dummy=0, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, 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=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L62] CALL assume(var8 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 4) VAL [dummy=0, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L63] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L64] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L64] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L65] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L65] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L66] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L67] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L67] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L68] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L68] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L69] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L70] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L71] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L71] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L72] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L73] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L74] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L75] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L76] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var5 != var8) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L77] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L78] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L79] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L80] int var_for_abs; [L81] var_for_abs = var0 - var1 [L82] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L83] CALL assume(var5 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var5 == var_for_abs) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L84] var_for_abs = var1 - var2 [L85] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L86] CALL assume(var6 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var6 == var_for_abs) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L87] var_for_abs = var2 - var3 [L88] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=4] [L89] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var7 == var_for_abs) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=4] [L90] var_for_abs = var3 - var4 [L91] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L92] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L93] reach_error() VAL [dummy=0, myvar0=1, var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 1, TraceHistogramMax: 38, 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=59occurred 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.3s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 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-21 14:49:20,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...