/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:06:43,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:06:43,294 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-15 22:06:43,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:06:43,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:06:43,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:06:43,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:06:43,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:06:43,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:06:43,328 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:06:43,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:06:43,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:06:43,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:06:43,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:06:43,330 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:06:43,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:06:43,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:06:43,331 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:06:43,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:06:43,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:06:43,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:06:43,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:06:43,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:06:43,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:06:43,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:06:43,335 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:06:43,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:06:43,336 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:06:43,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:06:43,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:06:43,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:06:43,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:06:43,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:06:43,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:06:43,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:06:43,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:06:43,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:06:43,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:06:43,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:06:43,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:06:43,339 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:06:43,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:06:43,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:06:43,340 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 -> true [2023-12-15 22:06:43,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:06:43,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:06:43,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:06:43,586 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:06:43,587 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:06:43,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c [2023-12-15 22:06:44,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:06:44,948 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:06:44,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c [2023-12-15 22:06:44,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e7bd7e4/493bd124ef28499cb4118a787b883fd8/FLAGffa10327f [2023-12-15 22:06:44,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e7bd7e4/493bd124ef28499cb4118a787b883fd8 [2023-12-15 22:06:44,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:06:44,969 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:06:44,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:06:44,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:06:44,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:06:44,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:06:44" (1/1) ... [2023-12-15 22:06:44,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2b172c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:44, skipping insertion in model container [2023-12-15 22:06:44,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:06:44" (1/1) ... [2023-12-15 22:06:44,992 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:06:45,127 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c[860,873] [2023-12-15 22:06:45,134 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c[916,929] [2023-12-15 22:06:45,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:06:45,148 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:06:45,160 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c[860,873] [2023-12-15 22:06:45,161 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c[916,929] [2023-12-15 22:06:45,161 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:06:45,174 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:06:45,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45 WrapperNode [2023-12-15 22:06:45,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:06:45,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:06:45,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:06:45,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:06:45,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (1/1) ... [2023-12-15 22:06:45,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (1/1) ... [2023-12-15 22:06:45,224 INFO L138 Inliner]: procedures = 11, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2023-12-15 22:06:45,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:06:45,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:06:45,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:06:45,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:06:45,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (1/1) ... [2023-12-15 22:06:45,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (1/1) ... [2023-12-15 22:06:45,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (1/1) ... [2023-12-15 22:06:45,255 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-15 22:06:45,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (1/1) ... [2023-12-15 22:06:45,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (1/1) ... [2023-12-15 22:06:45,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (1/1) ... [2023-12-15 22:06:45,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (1/1) ... [2023-12-15 22:06:45,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (1/1) ... [2023-12-15 22:06:45,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (1/1) ... [2023-12-15 22:06:45,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:06:45,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:06:45,277 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:06:45,277 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:06:45,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (1/1) ... [2023-12-15 22:06:45,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:06:45,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:06:45,310 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-15 22:06:45,334 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-15 22:06:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:06:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:06:45,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:06:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:06:45,398 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:06:45,401 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:06:45,528 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:06:45,548 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:06:45,549 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 22:06:45,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:06:45 BoogieIcfgContainer [2023-12-15 22:06:45,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:06:45,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:06:45,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:06:45,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:06:45,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:06:44" (1/3) ... [2023-12-15 22:06:45,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469789d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:06:45, skipping insertion in model container [2023-12-15 22:06:45,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:06:45" (2/3) ... [2023-12-15 22:06:45,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469789d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:06:45, skipping insertion in model container [2023-12-15 22:06:45,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:06:45" (3/3) ... [2023-12-15 22:06:45,557 INFO L112 eAbstractionObserver]: Analyzing ICFG linear-inequality-inv-b.c [2023-12-15 22:06:45,573 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:06:45,573 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-15 22:06:45,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:06:45,631 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;@2762f772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:06:45,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-15 22:06:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:06:45,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-15 22:06:45,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:06:45,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-15 22:06:45,647 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:06:45,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:06:45,651 INFO L85 PathProgramCache]: Analyzing trace with hash 63025968, now seen corresponding path program 1 times [2023-12-15 22:06:45,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:06:45,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023257052] [2023-12-15 22:06:45,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:06:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:06:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:06:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:06:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:06:45,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023257052] [2023-12-15 22:06:45,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023257052] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:06:45,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:06:45,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 22:06:45,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391984955] [2023-12-15 22:06:45,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:06:45,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 22:06:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:06:45,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 22:06:45,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 22:06:45,836 INFO L87 Difference]: Start difference. First operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:06:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:06:45,870 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2023-12-15 22:06:45,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 22:06:45,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-15 22:06:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:06:45,884 INFO L225 Difference]: With dead ends: 17 [2023-12-15 22:06:45,884 INFO L226 Difference]: Without dead ends: 6 [2023-12-15 22:06:45,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 22:06:45,899 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:06:45,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:06:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2023-12-15 22:06:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2023-12-15 22:06:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:06:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2023-12-15 22:06:45,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 5 [2023-12-15 22:06:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:06:45,930 INFO L495 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2023-12-15 22:06:45,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:06:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2023-12-15 22:06:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-15 22:06:45,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:06:45,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-15 22:06:45,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 22:06:45,931 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:06:45,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:06:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash 63022124, now seen corresponding path program 1 times [2023-12-15 22:06:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:06:45,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653558777] [2023-12-15 22:06:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:06:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:06:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:06:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:06:46,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:06:46,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653558777] [2023-12-15 22:06:46,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653558777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:06:46,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:06:46,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 22:06:46,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352200493] [2023-12-15 22:06:46,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:06:46,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 22:06:46,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:06:46,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 22:06:46,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 22:06:46,143 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:06:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:06:46,159 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2023-12-15 22:06:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 22:06:46,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-15 22:06:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:06:46,160 INFO L225 Difference]: With dead ends: 10 [2023-12-15 22:06:46,161 INFO L226 Difference]: Without dead ends: 7 [2023-12-15 22:06:46,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 22:06:46,163 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:06:46,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:06:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2023-12-15 22:06:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2023-12-15 22:06:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:06:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2023-12-15 22:06:46,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2023-12-15 22:06:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:06:46,172 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2023-12-15 22:06:46,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:06:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2023-12-15 22:06:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-15 22:06:46,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:06:46,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-15 22:06:46,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 22:06:46,175 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:06:46,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:06:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1953737730, now seen corresponding path program 1 times [2023-12-15 22:06:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:06:46,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345695882] [2023-12-15 22:06:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:06:46,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:06:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:06:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:06:46,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:06:46,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345695882] [2023-12-15 22:06:46,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345695882] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:06:46,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258910784] [2023-12-15 22:06:46,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:06:46,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:06:46,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:06:46,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 22:06:46,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 22:06:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:06:46,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 22:06:46,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:06:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:06:46,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:06:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:06:46,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258910784] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:06:46,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:06:46,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-12-15 22:06:46,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104540044] [2023-12-15 22:06:46,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:06:46,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:06:46,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:06:46,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:06:46,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:06:46,714 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:06:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:06:46,749 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2023-12-15 22:06:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 22:06:46,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-15 22:06:46,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:06:46,755 INFO L225 Difference]: With dead ends: 11 [2023-12-15 22:06:46,755 INFO L226 Difference]: Without dead ends: 8 [2023-12-15 22:06:46,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:06:46,758 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:06:46,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:06:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-12-15 22:06:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-12-15 22:06:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:06:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-15 22:06:46,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2023-12-15 22:06:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:06:46,765 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-15 22:06:46,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:06:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-15 22:06:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-15 22:06:46,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:06:46,766 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-15 22:06:46,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 22:06:46,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:06:46,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:06:46,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:06:46,977 INFO L85 PathProgramCache]: Analyzing trace with hash 436379372, now seen corresponding path program 2 times [2023-12-15 22:06:46,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:06:46,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25758136] [2023-12-15 22:06:46,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:06:46,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:06:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 22:06:47,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 22:06:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 22:06:47,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 22:06:47,030 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 22:06:47,033 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-15 22:06:47,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-15 22:06:47,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 22:06:47,038 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-12-15 22:06:47,042 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:06:47,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:06:47 BoogieIcfgContainer [2023-12-15 22:06:47,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:06:47,064 INFO L158 Benchmark]: Toolchain (without parser) took 2095.57ms. Allocated memory is still 262.1MB. Free memory was 212.9MB in the beginning and 108.5MB in the end (delta: 104.3MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. [2023-12-15 22:06:47,066 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 190.8MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:06:47,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.10ms. Allocated memory is still 262.1MB. Free memory was 212.9MB in the beginning and 202.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-15 22:06:47,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.52ms. Allocated memory is still 262.1MB. Free memory was 202.4MB in the beginning and 200.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-15 22:06:47,067 INFO L158 Benchmark]: Boogie Preprocessor took 51.17ms. Allocated memory is still 262.1MB. Free memory was 200.8MB in the beginning and 199.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 22:06:47,067 INFO L158 Benchmark]: RCFGBuilder took 272.31ms. Allocated memory is still 262.1MB. Free memory was 199.2MB in the beginning and 188.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-15 22:06:47,067 INFO L158 Benchmark]: TraceAbstraction took 1512.74ms. Allocated memory is still 262.1MB. Free memory was 187.7MB in the beginning and 108.5MB in the end (delta: 79.2MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. [2023-12-15 22:06:47,069 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.44ms. Allocated memory is still 190.8MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.10ms. Allocated memory is still 262.1MB. Free memory was 212.9MB in the beginning and 202.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.52ms. Allocated memory is still 262.1MB. Free memory was 202.4MB in the beginning and 200.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.17ms. Allocated memory is still 262.1MB. Free memory was 200.8MB in the beginning and 199.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 272.31ms. Allocated memory is still 262.1MB. Free memory was 199.2MB in the beginning and 188.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1512.74ms. Allocated memory is still 262.1MB. Free memory was 187.7MB in the beginning and 108.5MB in the end (delta: 79.2MB). Peak memory consumption was 78.6MB. 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: 25]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] unsigned char n = __VERIFIER_nondet_uchar(); [L13] COND FALSE !(n == 0) [L16] unsigned char v = 0; [L17] unsigned char s = 0; [L18] unsigned int i = 0; VAL [i=0, n=2, s=0, v=0] [L19] COND TRUE i < n [L20] v = __VERIFIER_nondet_uchar() [L21] s += v [L22] ++i VAL [i=1, n=2, s=255, v=255] [L19] COND TRUE i < n [L20] v = __VERIFIER_nondet_uchar() [L21] s += v [L22] ++i VAL [i=2, n=2, s=0, v=1] [L19] COND FALSE !(i < n) VAL [i=2, n=2, s=0, v=1] [L24] COND TRUE s < v VAL [i=2, n=2, s=0, v=1] [L25] reach_error() VAL [i=2, n=2, s=0, v=1] - UnprovableResult [Line: 29]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 16 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 128 SizeOfPredicates, 2 NumberOfNonLiveVariables, 36 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 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-15 22:06:47,087 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...