/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-64bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.count2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:20:37,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:20:37,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2023-12-16 19:20:37,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:20:37,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:20:37,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:20:37,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:20:37,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:20:37,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:20:37,391 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:20:37,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:20:37,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:20:37,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:20:37,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:20:37,393 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:20:37,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:20:37,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:20:37,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:20:37,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:20:37,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:20:37,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:20:37,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:20:37,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:20:37,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:20:37,396 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:20:37,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:20:37,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:20:37,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:20:37,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:20:37,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:20:37,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:20:37,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:20:37,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:20:37,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:20:37,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:20:37,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:20:37,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:20:37,398 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:20:37,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:20:37,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:20:37,399 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-16 19:20:37,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:20:37,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:20:37,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:20:37,620 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:20:37,620 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:20:37,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.count2.c [2023-12-16 19:20:38,730 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:20:38,884 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:20:38,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.count2.c [2023-12-16 19:20:38,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f39a46c73/6c27a58b627c463abecbcdf7012d6097/FLAG852decde9 [2023-12-16 19:20:38,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f39a46c73/6c27a58b627c463abecbcdf7012d6097 [2023-12-16 19:20:38,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:20:38,908 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:20:38,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:20:38,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:20:38,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:20:38,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:20:38" (1/1) ... [2023-12-16 19:20:38,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22034e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:38, skipping insertion in model container [2023-12-16 19:20:38,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:20:38" (1/1) ... [2023-12-16 19:20:38,932 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:20:39,046 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.count2.c[1256,1269] [2023-12-16 19:20:39,079 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:20:39,087 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:20:39,095 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.count2.c[1256,1269] [2023-12-16 19:20:39,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:20:39,124 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:20:39,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39 WrapperNode [2023-12-16 19:20:39,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:20:39,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:20:39,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:20:39,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:20:39,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (1/1) ... [2023-12-16 19:20:39,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (1/1) ... [2023-12-16 19:20:39,165 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-12-16 19:20:39,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:20:39,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:20:39,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:20:39,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:20:39,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (1/1) ... [2023-12-16 19:20:39,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (1/1) ... [2023-12-16 19:20:39,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (1/1) ... [2023-12-16 19:20:39,190 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-16 19:20:39,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (1/1) ... [2023-12-16 19:20:39,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (1/1) ... [2023-12-16 19:20:39,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (1/1) ... [2023-12-16 19:20:39,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (1/1) ... [2023-12-16 19:20:39,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (1/1) ... [2023-12-16 19:20:39,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (1/1) ... [2023-12-16 19:20:39,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:20:39,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:20:39,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:20:39,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:20:39,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (1/1) ... [2023-12-16 19:20:39,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:20:39,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:20:39,236 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-16 19:20:39,278 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-16 19:20:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:20:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:20:39,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:20:39,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:20:39,364 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:20:39,366 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:20:39,536 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:20:39,551 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:20:39,551 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:20:39,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:20:39 BoogieIcfgContainer [2023-12-16 19:20:39,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:20:39,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:20:39,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:20:39,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:20:39,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:20:38" (1/3) ... [2023-12-16 19:20:39,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409b9dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:20:39, skipping insertion in model container [2023-12-16 19:20:39,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:20:39" (2/3) ... [2023-12-16 19:20:39,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409b9dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:20:39, skipping insertion in model container [2023-12-16 19:20:39,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:20:39" (3/3) ... [2023-12-16 19:20:39,563 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count2.c [2023-12-16 19:20:39,574 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:20:39,575 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:20:39,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:20:39,618 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;@96c7ab2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:20:39,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:20:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 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-16 19:20:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 19:20:39,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:39,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 19:20:39,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:39,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1856432838, now seen corresponding path program 1 times [2023-12-16 19:20:39,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:39,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242471964] [2023-12-16 19:20:39,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:39,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:40,217 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-16 19:20:40,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:40,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242471964] [2023-12-16 19:20:40,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242471964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:40,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:20:40,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:20:40,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645345881] [2023-12-16 19:20:40,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:40,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:20:40,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:40,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:20:40,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:20:40,243 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 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 6 states, 6 states have (on average 1.0) 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-16 19:20:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:40,340 INFO L93 Difference]: Finished difference Result 28 states and 44 transitions. [2023-12-16 19:20:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:20:40,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.0) 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) Word has length 6 [2023-12-16 19:20:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:40,347 INFO L225 Difference]: With dead ends: 28 [2023-12-16 19:20:40,348 INFO L226 Difference]: Without dead ends: 18 [2023-12-16 19:20:40,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:20:40,352 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:40,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 8 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:20:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-16 19:20:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2023-12-16 19:20:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-16 19:20:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2023-12-16 19:20:40,374 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 6 [2023-12-16 19:20:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:40,374 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2023-12-16 19:20:40,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.0) 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-16 19:20:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2023-12-16 19:20:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 19:20:40,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:40,375 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:20:40,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:20:40,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:40,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1441919211, now seen corresponding path program 1 times [2023-12-16 19:20:40,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:40,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623864776] [2023-12-16 19:20:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:40,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:40,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623864776] [2023-12-16 19:20:40,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623864776] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:20:40,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697659543] [2023-12-16 19:20:40,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:40,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:20:40,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:20:40,514 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-16 19:20:40,526 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-16 19:20:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:40,573 WARN L260 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-16 19:20:40,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:20:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:40,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:20:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:40,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697659543] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:20:40,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:20:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 8] total 17 [2023-12-16 19:20:40,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804585846] [2023-12-16 19:20:40,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:20:40,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 19:20:40,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:40,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 19:20:40,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2023-12-16 19:20:40,949 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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-16 19:20:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:41,062 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2023-12-16 19:20:41,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:20:41,062 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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 11 [2023-12-16 19:20:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:41,063 INFO L225 Difference]: With dead ends: 24 [2023-12-16 19:20:41,063 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 19:20:41,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2023-12-16 19:20:41,064 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 91 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:41,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 14 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:20:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 19:20:41,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2023-12-16 19:20:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-16 19:20:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2023-12-16 19:20:41,067 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 11 [2023-12-16 19:20:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:41,068 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-12-16 19:20:41,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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-16 19:20:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2023-12-16 19:20:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 19:20:41,068 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:41,068 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:20:41,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 19:20:41,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:20:41,273 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:41,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:41,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1695605879, now seen corresponding path program 1 times [2023-12-16 19:20:41,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:41,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142085271] [2023-12-16 19:20:41,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:41,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:41,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:41,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142085271] [2023-12-16 19:20:41,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142085271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:20:41,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:20:41,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:20:41,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061789434] [2023-12-16 19:20:41,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:20:41,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:20:41,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:41,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:20:41,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:20:41,376 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-16 19:20:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:41,426 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-12-16 19:20:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:20:41,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-12-16 19:20:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:41,427 INFO L225 Difference]: With dead ends: 33 [2023-12-16 19:20:41,427 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 19:20:41,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:20:41,428 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:41,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 10 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:20:41,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 19:20:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-12-16 19:20:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-16 19:20:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-12-16 19:20:41,431 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2023-12-16 19:20:41,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:41,431 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-12-16 19:20:41,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-16 19:20:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-12-16 19:20:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 19:20:41,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:41,432 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:20:41,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:20:41,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:41,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1693758837, now seen corresponding path program 1 times [2023-12-16 19:20:41,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:41,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587571327] [2023-12-16 19:20:41,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:41,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:41,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587571327] [2023-12-16 19:20:41,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587571327] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:20:41,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169019302] [2023-12-16 19:20:41,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:41,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:20:41,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:20:41,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:20:41,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 19:20:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:41,677 WARN L260 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-16 19:20:41,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:20:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:41,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:20:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169019302] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:20:42,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:20:42,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 20 [2023-12-16 19:20:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412388913] [2023-12-16 19:20:42,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:20:42,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-16 19:20:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:42,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-16 19:20:42,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-12-16 19:20:42,081 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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-16 19:20:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:42,572 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2023-12-16 19:20:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 19:20:42,572 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 12 [2023-12-16 19:20:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:42,574 INFO L225 Difference]: With dead ends: 49 [2023-12-16 19:20:42,574 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 19:20:42,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 19:20:42,575 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 92 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:42,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 18 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:20:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 19:20:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2023-12-16 19:20:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-16 19:20:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-12-16 19:20:42,578 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 12 [2023-12-16 19:20:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:42,579 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-12-16 19:20:42,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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-16 19:20:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-12-16 19:20:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 19:20:42,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:42,579 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:20:42,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 19:20:42,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-16 19:20:42,785 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:42,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:42,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2118012954, now seen corresponding path program 1 times [2023-12-16 19:20:42,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:42,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217997216] [2023-12-16 19:20:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:42,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:43,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:43,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217997216] [2023-12-16 19:20:43,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217997216] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:20:43,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732254203] [2023-12-16 19:20:43,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:43,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:20:43,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:20:43,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:20:43,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 19:20:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:43,113 WARN L260 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-16 19:20:43,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:20:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:43,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:20:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:43,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732254203] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:20:43,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:20:43,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 12] total 25 [2023-12-16 19:20:43,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602054931] [2023-12-16 19:20:43,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:20:43,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 19:20:43,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:43,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 19:20:43,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2023-12-16 19:20:43,744 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 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-16 19:20:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:44,326 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2023-12-16 19:20:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 19:20:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 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 18 [2023-12-16 19:20:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:44,327 INFO L225 Difference]: With dead ends: 59 [2023-12-16 19:20:44,327 INFO L226 Difference]: Without dead ends: 42 [2023-12-16 19:20:44,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=444, Invalid=1718, Unknown=0, NotChecked=0, Total=2162 [2023-12-16 19:20:44,329 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 116 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:44,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 57 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:20:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-16 19:20:44,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2023-12-16 19:20:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 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-16 19:20:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-12-16 19:20:44,333 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2023-12-16 19:20:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:44,333 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-12-16 19:20:44,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 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-16 19:20:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-12-16 19:20:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 19:20:44,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:44,334 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2023-12-16 19:20:44,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 19:20:44,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:20:44,538 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:44,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:44,539 INFO L85 PathProgramCache]: Analyzing trace with hash 618283757, now seen corresponding path program 2 times [2023-12-16 19:20:44,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:44,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289656168] [2023-12-16 19:20:44,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:44,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289656168] [2023-12-16 19:20:45,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289656168] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:20:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657690520] [2023-12-16 19:20:45,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 19:20:45,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:20:45,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:20:45,326 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:20:45,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 19:20:45,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 19:20:45,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 19:20:45,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-16 19:20:45,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:20:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 19:20:45,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:20:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 19:20:51,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657690520] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:20:51,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:20:51,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2023-12-16 19:20:51,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150374384] [2023-12-16 19:20:51,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:20:51,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-16 19:20:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:51,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-16 19:20:51,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2023-12-16 19:20:51,553 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 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-16 19:20:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:20:53,000 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2023-12-16 19:20:53,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-16 19:20:53,001 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 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 24 [2023-12-16 19:20:53,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:20:53,001 INFO L225 Difference]: With dead ends: 66 [2023-12-16 19:20:53,001 INFO L226 Difference]: Without dead ends: 43 [2023-12-16 19:20:53,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=737, Invalid=2455, Unknown=0, NotChecked=0, Total=3192 [2023-12-16 19:20:53,003 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 189 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:20:53,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 10 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:20:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-16 19:20:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2023-12-16 19:20:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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-16 19:20:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-12-16 19:20:53,006 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2023-12-16 19:20:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:20:53,007 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-12-16 19:20:53,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 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-16 19:20:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-12-16 19:20:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 19:20:53,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:20:53,007 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2023-12-16 19:20:53,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 19:20:53,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:20:53,223 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:20:53,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:20:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1058404092, now seen corresponding path program 2 times [2023-12-16 19:20:53,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:20:53,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606420405] [2023-12-16 19:20:53,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:20:53,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:20:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:20:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:53,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:20:53,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606420405] [2023-12-16 19:20:53,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606420405] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:20:53,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633828715] [2023-12-16 19:20:53,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 19:20:53,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:20:53,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:20:53,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:20:53,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 19:20:54,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 19:20:54,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 19:20:54,021 WARN L260 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-16 19:20:54,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:20:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:54,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:20:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:20:57,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633828715] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:20:57,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:20:57,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 20] total 50 [2023-12-16 19:20:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402795099] [2023-12-16 19:20:57,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:20:57,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-16 19:20:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:20:57,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-16 19:20:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=2182, Unknown=0, NotChecked=0, Total=2550 [2023-12-16 19:20:57,270 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 51 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 50 states have internal predecessors, (84), 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-16 19:21:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:21:00,359 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2023-12-16 19:21:00,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-16 19:21:00,359 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 50 states have internal predecessors, (84), 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 30 [2023-12-16 19:21:00,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:21:00,360 INFO L225 Difference]: With dead ends: 69 [2023-12-16 19:21:00,360 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 19:21:00,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1265, Invalid=5541, Unknown=0, NotChecked=0, Total=6806 [2023-12-16 19:21:00,362 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 166 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:21:00,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 21 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 19:21:00,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 19:21:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2023-12-16 19:21:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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-16 19:21:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-12-16 19:21:00,366 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 30 [2023-12-16 19:21:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:21:00,366 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-12-16 19:21:00,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 50 states have internal predecessors, (84), 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-16 19:21:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-12-16 19:21:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-16 19:21:00,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:21:00,367 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2023-12-16 19:21:00,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-16 19:21:00,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:21:00,573 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:21:00,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:21:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1964639313, now seen corresponding path program 3 times [2023-12-16 19:21:00,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:21:00,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500750483] [2023-12-16 19:21:00,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:21:00,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:21:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:21:00,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:21:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:21:00,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:21:00,721 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:21:00,722 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:21:00,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:21:00,725 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2023-12-16 19:21:00,727 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:21:00,763 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:21:00,764 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:21:00,764 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:21:00,764 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:21:00,764 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:21:00,764 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:21:00,764 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:21:00,764 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:21:00,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:21:00 BoogieIcfgContainer [2023-12-16 19:21:00,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:21:00,772 INFO L158 Benchmark]: Toolchain (without parser) took 21863.73ms. Allocated memory was 274.7MB in the beginning and 476.1MB in the end (delta: 201.3MB). Free memory was 224.0MB in the beginning and 253.6MB in the end (delta: -29.6MB). Peak memory consumption was 172.1MB. Max. memory is 8.0GB. [2023-12-16 19:21:00,774 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:21:00,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.00ms. Allocated memory is still 274.7MB. Free memory was 223.3MB in the beginning and 212.1MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 19:21:00,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.06ms. Allocated memory is still 274.7MB. Free memory was 212.1MB in the beginning and 210.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 19:21:00,775 INFO L158 Benchmark]: Boogie Preprocessor took 44.05ms. Allocated memory is still 274.7MB. Free memory was 210.0MB in the beginning and 208.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 19:21:00,775 INFO L158 Benchmark]: RCFGBuilder took 339.96ms. Allocated memory is still 274.7MB. Free memory was 207.9MB in the beginning and 195.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 19:21:00,775 INFO L158 Benchmark]: TraceAbstraction took 21213.49ms. Allocated memory was 274.7MB in the beginning and 476.1MB in the end (delta: 201.3MB). Free memory was 194.6MB in the beginning and 253.6MB in the end (delta: -59.0MB). Peak memory consumption was 142.7MB. Max. memory is 8.0GB. [2023-12-16 19:21:00,777 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.09ms. Allocated memory is still 188.7MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.00ms. Allocated memory is still 274.7MB. Free memory was 223.3MB in the beginning and 212.1MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.06ms. Allocated memory is still 274.7MB. Free memory was 212.1MB in the beginning and 210.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.05ms. Allocated memory is still 274.7MB. Free memory was 210.0MB in the beginning and 208.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 339.96ms. Allocated memory is still 274.7MB. Free memory was 207.9MB in the beginning and 195.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 21213.49ms. Allocated memory was 274.7MB in the beginning and 476.1MB in the end (delta: 201.3MB). Free memory was 194.6MB in the beginning and 253.6MB in the end (delta: -59.0MB). Peak memory consumption was 142.7MB. 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 - UnprovableResult [Line: 22]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 55. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L30] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 1); [L31] const SORT_9 msb_SORT_9 = (SORT_9)1 << (1 - 1); [L33] const SORT_1 var_2 = 0; [L34] const SORT_1 var_5 = 1; [L35] const SORT_1 var_8 = mask_SORT_1; [L38] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, var_2=0, var_5=1, var_8=7] [L38] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L40] SORT_1 init_4_arg_1 = var_2; [L41] state_3 = init_4_arg_1 VAL [init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, state_3=0, var_2=0, var_5=1, var_8=7] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, state_3=0, var_10=0, var_10_arg_0=0, var_10_arg_1=7, var_2=0, var_5=1, var_6=1, var_6_arg_0=0, var_6_arg_1=1, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, state_3=0, var_10=0, var_10_arg_0=0, var_10_arg_1=7, var_2=0, var_5=1, var_6=1, var_6_arg_0=0, var_6_arg_1=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=1, state_3=1, var_10=0, var_10_arg_0=0, var_10_arg_1=7, var_2=0, var_5=1, var_6=1, var_6_arg_0=0, var_6_arg_1=1, var_8=7] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=1, state_3=1, var_10=0, var_10_arg_0=1, var_10_arg_1=7, var_2=0, var_5=1, var_6=2, var_6_arg_0=1, var_6_arg_1=1, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=1, state_3=1, var_10=0, var_10_arg_0=1, var_10_arg_1=7, var_2=0, var_5=1, var_6=2, var_6_arg_0=1, var_6_arg_1=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=2, state_3=2, var_10=0, var_10_arg_0=1, var_10_arg_1=7, var_2=0, var_5=1, var_6=2, var_6_arg_0=1, var_6_arg_1=1, var_8=7] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=2, state_3=2, var_10=0, var_10_arg_0=2, var_10_arg_1=7, var_2=0, var_5=1, var_6=3, var_6_arg_0=2, var_6_arg_1=1, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=2, state_3=2, var_10=0, var_10_arg_0=2, var_10_arg_1=7, var_2=0, var_5=1, var_6=3, var_6_arg_0=2, var_6_arg_1=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=3, state_3=3, var_10=0, var_10_arg_0=2, var_10_arg_1=7, var_2=0, var_5=1, var_6=3, var_6_arg_0=2, var_6_arg_1=1, var_8=7] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=3, state_3=3, var_10=0, var_10_arg_0=3, var_10_arg_1=7, var_2=0, var_5=1, var_6=4, var_6_arg_0=3, var_6_arg_1=1, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=3, state_3=3, var_10=0, var_10_arg_0=3, var_10_arg_1=7, var_2=0, var_5=1, var_6=4, var_6_arg_0=3, var_6_arg_1=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=4, state_3=4, var_10=0, var_10_arg_0=3, var_10_arg_1=7, var_2=0, var_5=1, var_6=4, var_6_arg_0=3, var_6_arg_1=1, var_8=7] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=4, state_3=4, var_10=0, var_10_arg_0=4, var_10_arg_1=7, var_2=0, var_5=1, var_6=5, var_6_arg_0=4, var_6_arg_1=1, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=4, state_3=4, var_10=0, var_10_arg_0=4, var_10_arg_1=7, var_2=0, var_5=1, var_6=5, var_6_arg_0=4, var_6_arg_1=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=5, state_3=5, var_10=0, var_10_arg_0=4, var_10_arg_1=7, var_2=0, var_5=1, var_6=5, var_6_arg_0=4, var_6_arg_1=1, var_8=7] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=5, state_3=5, var_10=0, var_10_arg_0=5, var_10_arg_1=7, var_2=0, var_5=1, var_6=6, var_6_arg_0=5, var_6_arg_1=1, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=5, state_3=5, var_10=0, var_10_arg_0=5, var_10_arg_1=7, var_2=0, var_5=1, var_6=6, var_6_arg_0=5, var_6_arg_1=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=6, state_3=6, var_10=0, var_10_arg_0=5, var_10_arg_1=7, var_2=0, var_5=1, var_6=6, var_6_arg_0=5, var_6_arg_1=1, var_8=7] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=6, state_3=6, var_10=0, var_10_arg_0=6, var_10_arg_1=7, var_2=0, var_5=1, var_6=7, var_6_arg_0=6, var_6_arg_1=1, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=6, state_3=6, var_10=0, var_10_arg_0=6, var_10_arg_1=7, var_2=0, var_5=1, var_6=7, var_6_arg_0=6, var_6_arg_1=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 VAL [bad_11_arg_0=0, init_4_arg_1=0, mask_SORT_1=7, mask_SORT_9=1, msb_SORT_1=4, msb_SORT_9=1, next_7_arg_1=7, state_3=7, var_10=0, var_10_arg_0=6, var_10_arg_1=7, var_2=0, var_5=1, var_6=7, var_6_arg_0=6, var_6_arg_1=1, var_8=7] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L22] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 8, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 735 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 735 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1164 IncrementalHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 17 mSDtfsCounter, 1164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3514 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, InterpolantAutomatonStates: 126, 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, 7 MinimizatonAttempts, 51 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 286 ConstructedInterpolants, 14 QuantifiedInterpolants, 11482 SizeOfPredicates, 143 NumberOfNonLiveVariables, 631 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 56/248 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 could not prove your program: unable to determine feasibility of some traces [2023-12-16 19:21:00,811 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...