/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.synabs.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:55:21,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:55:21,435 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:55:21,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:55:21,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:55:21,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:55:21,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:55:21,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:55:21,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:55:21,472 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:55:21,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:55:21,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:55:21,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:55:21,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:55:21,474 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:55:21,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:55:21,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:55:21,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:55:21,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:55:21,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:55:21,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:55:21,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:55:21,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:55:21,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:55:21,477 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:55:21,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:55:21,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:55:21,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:55:21,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:55:21,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:55:21,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:55:21,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:55:21,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:55:21,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:55:21,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:55:21,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:55:21,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:55:21,480 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:55:21,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:55:21,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:55:21,481 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:55:21,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:55:21,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:55:21,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:55:21,751 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:55:21,751 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:55:21,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs.c [2023-12-16 19:55:22,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:55:23,147 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:55:23,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.synabs.c [2023-12-16 19:55:23,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991d51284/86af225e0231435490bc4ae0c0856fa3/FLAGdfc3a6126 [2023-12-16 19:55:23,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991d51284/86af225e0231435490bc4ae0c0856fa3 [2023-12-16 19:55:23,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:55:23,170 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:55:23,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:55:23,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:55:23,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:55:23,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:55:23" (1/1) ... [2023-12-16 19:55:23,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15424b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23, skipping insertion in model container [2023-12-16 19:55:23,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:55:23" (1/1) ... [2023-12-16 19:55:23,205 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:55:23,334 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.synabs.c[1246,1259] [2023-12-16 19:55:23,379 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:55:23,388 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:55:23,398 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.synabs.c[1246,1259] [2023-12-16 19:55:23,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:55:23,433 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:55:23,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23 WrapperNode [2023-12-16 19:55:23,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:55:23,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:55:23,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:55:23,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:55:23,441 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:55:23" (1/1) ... [2023-12-16 19:55:23,455 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:55:23" (1/1) ... [2023-12-16 19:55:23,494 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 245 [2023-12-16 19:55:23,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:55:23,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:55:23,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:55:23,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:55:23,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23" (1/1) ... [2023-12-16 19:55:23,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23" (1/1) ... [2023-12-16 19:55:23,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23" (1/1) ... [2023-12-16 19:55:23,539 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:55:23,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23" (1/1) ... [2023-12-16 19:55:23,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23" (1/1) ... [2023-12-16 19:55:23,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23" (1/1) ... [2023-12-16 19:55:23,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23" (1/1) ... [2023-12-16 19:55:23,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23" (1/1) ... [2023-12-16 19:55:23,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23" (1/1) ... [2023-12-16 19:55:23,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:55:23,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:55:23,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:55:23,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:55:23,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23" (1/1) ... [2023-12-16 19:55:23,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:55:23,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:55:23,613 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:55:23,627 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:55:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:55:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:55:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:55:23,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:55:23,751 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:55:23,754 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:55:24,218 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:55:24,243 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:55:24,243 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:55:24,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:55:24 BoogieIcfgContainer [2023-12-16 19:55:24,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:55:24,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:55:24,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:55:24,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:55:24,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:55:23" (1/3) ... [2023-12-16 19:55:24,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2f4072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:55:24, skipping insertion in model container [2023-12-16 19:55:24,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:55:23" (2/3) ... [2023-12-16 19:55:24,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2f4072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:55:24, skipping insertion in model container [2023-12-16 19:55:24,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:55:24" (3/3) ... [2023-12-16 19:55:24,253 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs.c [2023-12-16 19:55:24,269 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:55:24,269 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:55:24,316 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:55:24,321 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;@5977493b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:55:24,322 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:55:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 43 states have internal predecessors, (70), 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:55:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 19:55:24,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:24,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:24,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:24,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash 122773413, now seen corresponding path program 1 times [2023-12-16 19:55:24,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:24,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906263511] [2023-12-16 19:55:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:24,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:24,872 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:55:24,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:24,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906263511] [2023-12-16 19:55:24,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906263511] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:24,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:24,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 19:55:24,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623231750] [2023-12-16 19:55:24,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:24,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:55:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:24,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:55:24,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:55:24,903 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 43 states have internal predecessors, (70), 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 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:55:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:25,013 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2023-12-16 19:55:25,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:55:25,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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) Word has length 18 [2023-12-16 19:55:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:25,022 INFO L225 Difference]: With dead ends: 73 [2023-12-16 19:55:25,022 INFO L226 Difference]: Without dead ends: 42 [2023-12-16 19:55:25,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:55:25,030 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 57 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:25,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 85 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:55:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-16 19:55:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-16 19:55:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 41 states have internal predecessors, (64), 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:55:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2023-12-16 19:55:25,064 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 64 transitions. Word has length 18 [2023-12-16 19:55:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:25,064 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 64 transitions. [2023-12-16 19:55:25,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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:55:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 64 transitions. [2023-12-16 19:55:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 19:55:25,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:25,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:25,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:55:25,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:25,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1922801427, now seen corresponding path program 1 times [2023-12-16 19:55:25,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:25,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374499489] [2023-12-16 19:55:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:25,308 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:55:25,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:25,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374499489] [2023-12-16 19:55:25,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374499489] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:25,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:25,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:55:25,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715289776] [2023-12-16 19:55:25,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:25,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:55:25,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:25,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:55:25,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:55:25,318 INFO L87 Difference]: Start difference. First operand 42 states and 64 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:55:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:25,352 INFO L93 Difference]: Finished difference Result 46 states and 68 transitions. [2023-12-16 19:55:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:55:25,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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) Word has length 19 [2023-12-16 19:55:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:25,354 INFO L225 Difference]: With dead ends: 46 [2023-12-16 19:55:25,355 INFO L226 Difference]: Without dead ends: 44 [2023-12-16 19:55:25,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:55:25,356 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:25,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:55:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-16 19:55:25,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-16 19:55:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 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:55:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2023-12-16 19:55:25,368 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 19 [2023-12-16 19:55:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:25,369 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2023-12-16 19:55:25,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:55:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2023-12-16 19:55:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 19:55:25,370 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:25,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:25,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:55:25,371 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:25,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash 524422939, now seen corresponding path program 1 times [2023-12-16 19:55:25,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:25,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090632863] [2023-12-16 19:55:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:25,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:25,481 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:55:25,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090632863] [2023-12-16 19:55:25,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090632863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:25,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:25,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:55:25,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032023793] [2023-12-16 19:55:25,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:25,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:55:25,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:25,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:55:25,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:55:25,488 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:55:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:25,526 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2023-12-16 19:55:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:55:25,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) Word has length 20 [2023-12-16 19:55:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:25,529 INFO L225 Difference]: With dead ends: 78 [2023-12-16 19:55:25,529 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 19:55:25,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:55:25,534 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:25,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 176 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:55:25,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 19:55:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2023-12-16 19:55:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.511111111111111) internal successors, (68), 45 states have internal predecessors, (68), 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:55:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2023-12-16 19:55:25,545 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 20 [2023-12-16 19:55:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:25,546 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2023-12-16 19:55:25,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:55:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2023-12-16 19:55:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 19:55:25,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:25,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:25,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:55:25,549 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:25,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:25,550 INFO L85 PathProgramCache]: Analyzing trace with hash 641816905, now seen corresponding path program 1 times [2023-12-16 19:55:25,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:25,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944642603] [2023-12-16 19:55:25,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:25,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:55:25,812 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:55:25,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:55:25,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944642603] [2023-12-16 19:55:25,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944642603] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:55:25,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:55:25,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:55:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753239946] [2023-12-16 19:55:25,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:55:25,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:55:25,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:55:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:55:25,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:55:25,814 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:55:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:55:25,880 INFO L93 Difference]: Finished difference Result 105 states and 151 transitions. [2023-12-16 19:55:25,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:55:25,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2023-12-16 19:55:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:55:25,881 INFO L225 Difference]: With dead ends: 105 [2023-12-16 19:55:25,881 INFO L226 Difference]: Without dead ends: 72 [2023-12-16 19:55:25,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:55:25,882 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 124 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:55:25,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 173 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:55:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-16 19:55:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 46. [2023-12-16 19:55:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.488888888888889) internal successors, (67), 45 states have internal predecessors, (67), 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:55:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2023-12-16 19:55:25,887 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 21 [2023-12-16 19:55:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:55:25,887 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2023-12-16 19:55:25,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:55:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2023-12-16 19:55:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 19:55:25,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:55:25,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:55:25,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:55:25,889 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:55:25,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:55:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1133190457, now seen corresponding path program 1 times [2023-12-16 19:55:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:55:25,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849229718] [2023-12-16 19:55:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:55:25,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:55:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:55:25,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:55:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:55:25,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:55:25,971 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:55:25,972 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:55:25,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:55:25,977 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 19:55:25,981 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:55:26,023 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:55:26,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:55:26 BoogieIcfgContainer [2023-12-16 19:55:26,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:55:26,035 INFO L158 Benchmark]: Toolchain (without parser) took 2865.26ms. Allocated memory is still 196.1MB. Free memory was 151.7MB in the beginning and 109.5MB in the end (delta: 42.2MB). Peak memory consumption was 42.6MB. Max. memory is 8.0GB. [2023-12-16 19:55:26,036 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 196.1MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:55:26,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.74ms. Allocated memory is still 196.1MB. Free memory was 151.4MB in the beginning and 138.0MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 19:55:26,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.17ms. Allocated memory is still 196.1MB. Free memory was 138.0MB in the beginning and 132.5MB in the end (delta: 5.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 19:55:26,038 INFO L158 Benchmark]: Boogie Preprocessor took 88.90ms. Allocated memory is still 196.1MB. Free memory was 132.5MB in the beginning and 129.0MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 19:55:26,038 INFO L158 Benchmark]: RCFGBuilder took 659.58ms. Allocated memory is still 196.1MB. Free memory was 129.0MB in the beginning and 159.9MB in the end (delta: -30.8MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. [2023-12-16 19:55:26,039 INFO L158 Benchmark]: TraceAbstraction took 1787.65ms. Allocated memory is still 196.1MB. Free memory was 158.8MB in the beginning and 109.5MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2023-12-16 19:55:26,042 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.13ms. Allocated memory is still 196.1MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.74ms. Allocated memory is still 196.1MB. Free memory was 151.4MB in the beginning and 138.0MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.17ms. Allocated memory is still 196.1MB. Free memory was 138.0MB in the beginning and 132.5MB in the end (delta: 5.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 88.90ms. Allocated memory is still 196.1MB. Free memory was 132.5MB in the beginning and 129.0MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 659.58ms. Allocated memory is still 196.1MB. Free memory was 129.0MB in the beginning and 159.9MB in the end (delta: -30.8MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1787.65ms. Allocated memory is still 196.1MB. Free memory was 158.8MB in the beginning and 109.5MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. 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: 21]: 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 68. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 4); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (4 - 1); [L35] const SORT_4 var_5 = 1; [L36] const SORT_8 var_9 = 2; [L37] const SORT_1 var_15 = 1; [L38] const SORT_4 var_19 = 5; [L39] const SORT_4 var_22 = 7; [L40] const SORT_4 var_26 = 11; [L41] const SORT_4 var_29 = 3; [L42] const SORT_8 var_30 = 1; [L43] const SORT_8 var_37 = 5; [L45] SORT_1 input_2; [L46] SORT_1 input_3; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, msb_SORT_1=1, msb_SORT_4=16, msb_SORT_8=8, var_15=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L48] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, msb_SORT_1=1, msb_SORT_4=16, msb_SORT_8=8, state_6=0, var_15=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L49] SORT_4 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, msb_SORT_1=1, msb_SORT_4=16, msb_SORT_8=8, state_20=0, state_6=0, var_15=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L50] SORT_4 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, msb_SORT_1=1, msb_SORT_4=16, msb_SORT_8=8, state_20=0, state_23=0, state_6=0, var_15=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L51] SORT_4 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L53] SORT_4 init_7_arg_1 = var_5; [L54] state_6 = init_7_arg_1 [L55] SORT_4 init_21_arg_1 = var_19; [L56] state_20 = init_21_arg_1 [L57] SORT_4 init_24_arg_1 = var_22; [L58] state_23 = init_24_arg_1 [L59] SORT_4 init_28_arg_1 = var_26; [L60] state_27 = init_28_arg_1 VAL [init_21_arg_1=5, init_24_arg_1=7, init_28_arg_1=11, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, msb_SORT_1=1, msb_SORT_4=16, msb_SORT_8=8, state_20=5, state_23=7, state_27=11, state_6=1, var_15=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L63] input_2 = __VERIFIER_nondet_uchar() [L64] input_3 = __VERIFIER_nondet_uchar() [L67] SORT_8 var_10_arg_0 = var_9; VAL [init_21_arg_1=5, init_24_arg_1=7, init_28_arg_1=11, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, msb_SORT_1=1, msb_SORT_4=16, msb_SORT_8=8, state_20=5, state_23=7, state_27=11, state_6=1, var_10_arg_0=2, var_15=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L68] EXPR var_10_arg_0 & mask_SORT_8 VAL [init_21_arg_1=5, init_24_arg_1=7, init_28_arg_1=11, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, msb_SORT_1=1, msb_SORT_4=16, msb_SORT_8=8, state_20=5, state_23=7, state_27=11, state_6=1, var_10_arg_0=2, var_15=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L68] var_10_arg_0 = var_10_arg_0 & mask_SORT_8 [L69] SORT_4 var_10 = var_10_arg_0; [L70] SORT_4 var_11_arg_0 = state_6; [L71] SORT_4 var_11_arg_1 = var_10; [L72] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L73] SORT_1 var_12_arg_0 = var_11; [L74] SORT_1 var_12 = ~var_12_arg_0; [L75] SORT_1 var_16_arg_0 = var_12; [L76] SORT_1 var_16 = ~var_16_arg_0; [L77] SORT_1 var_17_arg_0 = var_15; [L78] SORT_1 var_17_arg_1 = var_16; VAL [init_21_arg_1=5, init_24_arg_1=7, init_28_arg_1=11, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, msb_SORT_1=1, msb_SORT_4=16, msb_SORT_8=8, state_20=5, state_23=7, state_27=11, state_6=1, var_10=1, var_10_arg_0=1, var_11=1, var_11_arg_0=1, var_11_arg_1=1, var_12=254, var_12_arg_0=1, var_15=1, var_16=1, var_16_arg_0=254, var_17_arg_0=1, var_17_arg_1=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L79] EXPR var_17_arg_0 & var_17_arg_1 VAL [init_21_arg_1=5, init_24_arg_1=7, init_28_arg_1=11, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, msb_SORT_1=1, msb_SORT_4=16, msb_SORT_8=8, state_20=5, state_23=7, state_27=11, state_6=1, var_10=1, var_10_arg_0=1, var_11=1, var_11_arg_0=1, var_11_arg_1=1, var_12=254, var_12_arg_0=1, var_15=1, var_16=1, var_16_arg_0=254, var_17_arg_0=1, var_17_arg_1=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L79] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L80] EXPR var_17 & mask_SORT_1 VAL [init_21_arg_1=5, init_24_arg_1=7, init_28_arg_1=11, init_7_arg_1=1, mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, msb_SORT_1=1, msb_SORT_4=16, msb_SORT_8=8, state_20=5, state_23=7, state_27=11, state_6=1, var_10=1, var_10_arg_0=1, var_11=1, var_11_arg_0=1, var_11_arg_1=1, var_12=254, var_12_arg_0=1, var_15=1, var_16=1, var_16_arg_0=254, var_17=1, var_17_arg_0=1, var_17_arg_1=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L80] var_17 = var_17 & mask_SORT_1 [L81] SORT_1 bad_18_arg_0 = var_17; [L82] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 353 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 259 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=3, InterpolantAutomatonStates: 17, 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, 4 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-16 19:55:26,060 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...