/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.cal54.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:12:55,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:12:55,581 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:12:55,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:12:55,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:12:55,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:12:55,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:12:55,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:12:55,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:12:55,614 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:12:55,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:12:55,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:12:55,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:12:55,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:12:55,617 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:12:55,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:12:55,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:12:55,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:12:55,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:12:55,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:12:55,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:12:55,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:12:55,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:12:55,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:12:55,618 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:12:55,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:12:55,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:12:55,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:12:55,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:12:55,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:12:55,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:12:55,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:12:55,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:12:55,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:12:55,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:12:55,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:12:55,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:12:55,621 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:12:55,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:12:55,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:12:55,621 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:12:55,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:12:55,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:12:55,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:12:55,828 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:12:55,828 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:12:55,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal54.c [2023-12-16 19:12:56,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:12:57,080 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:12:57,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.cal54.c [2023-12-16 19:12:57,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072d0b718/09b2d8c5f2c6443ea5ec8d0e0f08664d/FLAGe5d4f30a2 [2023-12-16 19:12:57,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072d0b718/09b2d8c5f2c6443ea5ec8d0e0f08664d [2023-12-16 19:12:57,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:12:57,119 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:12:57,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:12:57,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:12:57,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:12:57,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:12:57" (1/1) ... [2023-12-16 19:12:57,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb42da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57, skipping insertion in model container [2023-12-16 19:12:57,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:12:57" (1/1) ... [2023-12-16 19:12:57,160 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:12:57,256 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.cal54.c[1245,1258] [2023-12-16 19:12:57,300 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:12:57,308 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:12:57,316 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.cal54.c[1245,1258] [2023-12-16 19:12:57,371 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:12:57,381 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:12:57,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57 WrapperNode [2023-12-16 19:12:57,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:12:57,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:12:57,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:12:57,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:12:57,388 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:12:57" (1/1) ... [2023-12-16 19:12:57,400 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:12:57" (1/1) ... [2023-12-16 19:12:57,458 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 386 [2023-12-16 19:12:57,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:12:57,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:12:57,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:12:57,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:12:57,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57" (1/1) ... [2023-12-16 19:12:57,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57" (1/1) ... [2023-12-16 19:12:57,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57" (1/1) ... [2023-12-16 19:12:57,493 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-16 19:12:57,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57" (1/1) ... [2023-12-16 19:12:57,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57" (1/1) ... [2023-12-16 19:12:57,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57" (1/1) ... [2023-12-16 19:12:57,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57" (1/1) ... [2023-12-16 19:12:57,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57" (1/1) ... [2023-12-16 19:12:57,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57" (1/1) ... [2023-12-16 19:12:57,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:12:57,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:12:57,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:12:57,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:12:57,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57" (1/1) ... [2023-12-16 19:12:57,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:12:57,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:12:57,573 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:12:57,596 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:12:57,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:12:57,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:12:57,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 19:12:57,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:12:57,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:12:57,679 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:12:57,681 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:12:58,032 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:12:58,058 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:12:58,058 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:12:58,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:12:58 BoogieIcfgContainer [2023-12-16 19:12:58,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:12:58,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:12:58,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:12:58,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:12:58,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:12:57" (1/3) ... [2023-12-16 19:12:58,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f3d17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:12:58, skipping insertion in model container [2023-12-16 19:12:58,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:12:57" (2/3) ... [2023-12-16 19:12:58,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f3d17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:12:58, skipping insertion in model container [2023-12-16 19:12:58,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:12:58" (3/3) ... [2023-12-16 19:12:58,067 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal54.c [2023-12-16 19:12:58,079 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:12:58,080 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:12:58,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:12:58,124 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;@50ad011e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:12:58,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:12:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 61 states have internal predecessors, (100), 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:12:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 19:12:58,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:58,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:58,137 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:58,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:58,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1513167013, now seen corresponding path program 1 times [2023-12-16 19:12:58,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:58,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792766063] [2023-12-16 19:12:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:58,606 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:12:58,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:58,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792766063] [2023-12-16 19:12:58,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792766063] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:58,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:58,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:12:58,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269785736] [2023-12-16 19:12:58,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:58,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:12:58,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:58,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:12:58,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:58,633 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 61 states have internal predecessors, (100), 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 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:12:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:58,663 INFO L93 Difference]: Finished difference Result 111 states and 181 transitions. [2023-12-16 19:12:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:12:58,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2023-12-16 19:12:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:58,670 INFO L225 Difference]: With dead ends: 111 [2023-12-16 19:12:58,670 INFO L226 Difference]: Without dead ends: 62 [2023-12-16 19:12:58,672 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:12:58,676 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 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:12:58,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:12:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-16 19:12:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-16 19:12:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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:12:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2023-12-16 19:12:58,710 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 98 transitions. Word has length 34 [2023-12-16 19:12:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:58,710 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 98 transitions. [2023-12-16 19:12:58,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:12:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 98 transitions. [2023-12-16 19:12:58,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 19:12:58,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:58,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:58,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:12:58,712 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:58,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:58,713 INFO L85 PathProgramCache]: Analyzing trace with hash -334737725, now seen corresponding path program 1 times [2023-12-16 19:12:58,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:58,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201297040] [2023-12-16 19:12:58,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:58,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:58,871 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:12:58,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:58,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201297040] [2023-12-16 19:12:58,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201297040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:58,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:58,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:12:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906737933] [2023-12-16 19:12:58,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:58,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:12:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:12:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:12:58,878 INFO L87 Difference]: Start difference. First operand 62 states and 98 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:12:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:58,915 INFO L93 Difference]: Finished difference Result 114 states and 179 transitions. [2023-12-16 19:12:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:12:58,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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) Word has length 35 [2023-12-16 19:12:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:58,917 INFO L225 Difference]: With dead ends: 114 [2023-12-16 19:12:58,917 INFO L226 Difference]: Without dead ends: 65 [2023-12-16 19:12:58,918 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:12:58,919 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 272 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:12:58,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 272 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:12:58,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-16 19:12:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2023-12-16 19:12:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 63 states have internal predecessors, (100), 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:12:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2023-12-16 19:12:58,929 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 35 [2023-12-16 19:12:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:58,929 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2023-12-16 19:12:58,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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:12:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2023-12-16 19:12:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 19:12:58,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:58,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:58,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:12:58,930 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:58,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:58,931 INFO L85 PathProgramCache]: Analyzing trace with hash -222359807, now seen corresponding path program 1 times [2023-12-16 19:12:58,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:58,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652639848] [2023-12-16 19:12:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:58,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:59,322 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:12:59,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:59,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652639848] [2023-12-16 19:12:59,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652639848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:59,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:59,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:12:59,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075231015] [2023-12-16 19:12:59,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:59,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:12:59,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:59,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:12:59,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:12:59,325 INFO L87 Difference]: Start difference. First operand 64 states and 100 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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:12:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:59,464 INFO L93 Difference]: Finished difference Result 191 states and 299 transitions. [2023-12-16 19:12:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:12:59,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 36 [2023-12-16 19:12:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:59,469 INFO L225 Difference]: With dead ends: 191 [2023-12-16 19:12:59,469 INFO L226 Difference]: Without dead ends: 140 [2023-12-16 19:12:59,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:12:59,474 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 407 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:59,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 392 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:12:59,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-16 19:12:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 90. [2023-12-16 19:12:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.595505617977528) internal successors, (142), 89 states have internal predecessors, (142), 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:12:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 142 transitions. [2023-12-16 19:12:59,481 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 142 transitions. Word has length 36 [2023-12-16 19:12:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:59,481 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 142 transitions. [2023-12-16 19:12:59,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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:12:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 142 transitions. [2023-12-16 19:12:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 19:12:59,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:59,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:59,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:12:59,483 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:59,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1586074219, now seen corresponding path program 1 times [2023-12-16 19:12:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614636791] [2023-12-16 19:12:59,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:12:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:12:59,748 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:12:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:12:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614636791] [2023-12-16 19:12:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614636791] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:12:59,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:12:59,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:12:59,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838587337] [2023-12-16 19:12:59,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:12:59,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:12:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:12:59,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:12:59,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:12:59,750 INFO L87 Difference]: Start difference. First operand 90 states and 142 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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:12:59,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:12:59,946 INFO L93 Difference]: Finished difference Result 235 states and 367 transitions. [2023-12-16 19:12:59,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 19:12:59,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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 37 [2023-12-16 19:12:59,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:12:59,948 INFO L225 Difference]: With dead ends: 235 [2023-12-16 19:12:59,948 INFO L226 Difference]: Without dead ends: 184 [2023-12-16 19:12:59,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-12-16 19:12:59,954 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 655 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:12:59,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 641 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:12:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-16 19:12:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 93. [2023-12-16 19:12:59,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.5869565217391304) internal successors, (146), 92 states have internal predecessors, (146), 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:12:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions. [2023-12-16 19:12:59,968 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 37 [2023-12-16 19:12:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:12:59,968 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 146 transitions. [2023-12-16 19:12:59,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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:12:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2023-12-16 19:12:59,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 19:12:59,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:12:59,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:12:59,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:12:59,969 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:12:59,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:12:59,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1193047209, now seen corresponding path program 1 times [2023-12-16 19:12:59,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:12:59,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974921296] [2023-12-16 19:12:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:12:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:00,133 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:13:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:00,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974921296] [2023-12-16 19:13:00,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974921296] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:00,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:00,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 19:13:00,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592557788] [2023-12-16 19:13:00,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:00,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 19:13:00,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:00,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 19:13:00,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 19:13:00,136 INFO L87 Difference]: Start difference. First operand 93 states and 146 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:13:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:00,146 INFO L93 Difference]: Finished difference Result 161 states and 251 transitions. [2023-12-16 19:13:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 19:13:00,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2023-12-16 19:13:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:00,149 INFO L225 Difference]: With dead ends: 161 [2023-12-16 19:13:00,150 INFO L226 Difference]: Without dead ends: 93 [2023-12-16 19:13:00,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 19:13:00,152 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 73 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:00,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-16 19:13:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-16 19:13:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.565217391304348) internal successors, (144), 92 states have internal predecessors, (144), 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:13:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 144 transitions. [2023-12-16 19:13:00,168 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 144 transitions. Word has length 37 [2023-12-16 19:13:00,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:00,168 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 144 transitions. [2023-12-16 19:13:00,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:13:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2023-12-16 19:13:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 19:13:00,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:00,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:00,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:13:00,170 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:00,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash 891809921, now seen corresponding path program 1 times [2023-12-16 19:13:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:00,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482513580] [2023-12-16 19:13:00,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:00,480 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:13:00,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:00,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482513580] [2023-12-16 19:13:00,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482513580] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:00,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:00,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:13:00,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381843782] [2023-12-16 19:13:00,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:00,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:13:00,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:00,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:13:00,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:13:00,483 INFO L87 Difference]: Start difference. First operand 93 states and 144 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 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:13:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:00,604 INFO L93 Difference]: Finished difference Result 239 states and 365 transitions. [2023-12-16 19:13:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:13:00,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 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) Word has length 38 [2023-12-16 19:13:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:00,605 INFO L225 Difference]: With dead ends: 239 [2023-12-16 19:13:00,605 INFO L226 Difference]: Without dead ends: 174 [2023-12-16 19:13:00,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:13:00,607 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 219 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:00,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 445 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:13:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-16 19:13:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 105. [2023-12-16 19:13:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.5192307692307692) internal successors, (158), 104 states have internal predecessors, (158), 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:13:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2023-12-16 19:13:00,618 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 38 [2023-12-16 19:13:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:00,621 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2023-12-16 19:13:00,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 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:13:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2023-12-16 19:13:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 19:13:00,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:00,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:00,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:13:00,626 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:00,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:00,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1314511747, now seen corresponding path program 1 times [2023-12-16 19:13:00,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:00,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183933264] [2023-12-16 19:13:00,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:00,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:00,803 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:13:00,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:00,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183933264] [2023-12-16 19:13:00,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183933264] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:00,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:00,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:13:00,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482026462] [2023-12-16 19:13:00,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:00,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:13:00,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:00,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:13:00,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:13:00,804 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 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:13:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:00,846 INFO L93 Difference]: Finished difference Result 240 states and 361 transitions. [2023-12-16 19:13:00,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:13:00,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 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) Word has length 38 [2023-12-16 19:13:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:00,849 INFO L225 Difference]: With dead ends: 240 [2023-12-16 19:13:00,849 INFO L226 Difference]: Without dead ends: 166 [2023-12-16 19:13:00,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:13:00,850 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 205 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:00,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 293 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-16 19:13:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 105. [2023-12-16 19:13:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.5) internal successors, (156), 104 states have internal predecessors, (156), 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:13:00,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 156 transitions. [2023-12-16 19:13:00,854 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 156 transitions. Word has length 38 [2023-12-16 19:13:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:00,854 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 156 transitions. [2023-12-16 19:13:00,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 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:13:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 156 transitions. [2023-12-16 19:13:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 19:13:00,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:00,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:00,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:13:00,856 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:00,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1404447889, now seen corresponding path program 1 times [2023-12-16 19:13:00,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:00,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145621918] [2023-12-16 19:13:00,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:00,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:01,133 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:13:01,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:01,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145621918] [2023-12-16 19:13:01,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145621918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:01,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:01,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:13:01,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716147287] [2023-12-16 19:13:01,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:01,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:13:01,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:01,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:13:01,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:13:01,135 INFO L87 Difference]: Start difference. First operand 105 states and 156 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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:13:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:01,208 INFO L93 Difference]: Finished difference Result 249 states and 368 transitions. [2023-12-16 19:13:01,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:13:01,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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 39 [2023-12-16 19:13:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:01,209 INFO L225 Difference]: With dead ends: 249 [2023-12-16 19:13:01,209 INFO L226 Difference]: Without dead ends: 184 [2023-12-16 19:13:01,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:13:01,211 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 308 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:01,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 491 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-16 19:13:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 115. [2023-12-16 19:13:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.4912280701754386) internal successors, (170), 114 states have internal predecessors, (170), 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:13:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 170 transitions. [2023-12-16 19:13:01,216 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 170 transitions. Word has length 39 [2023-12-16 19:13:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:01,217 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 170 transitions. [2023-12-16 19:13:01,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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:13:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 170 transitions. [2023-12-16 19:13:01,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 19:13:01,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:01,218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:01,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:13:01,219 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:01,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:01,219 INFO L85 PathProgramCache]: Analyzing trace with hash 223455951, now seen corresponding path program 1 times [2023-12-16 19:13:01,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:01,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406311516] [2023-12-16 19:13:01,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:01,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:01,387 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:13:01,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:01,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406311516] [2023-12-16 19:13:01,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406311516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:01,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:01,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:13:01,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506199380] [2023-12-16 19:13:01,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:01,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:13:01,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:01,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:13:01,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:13:01,390 INFO L87 Difference]: Start difference. First operand 115 states and 170 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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:13:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:01,447 INFO L93 Difference]: Finished difference Result 199 states and 294 transitions. [2023-12-16 19:13:01,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:13:01,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2023-12-16 19:13:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:01,449 INFO L225 Difference]: With dead ends: 199 [2023-12-16 19:13:01,449 INFO L226 Difference]: Without dead ends: 123 [2023-12-16 19:13:01,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:13:01,449 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 98 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:01,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 320 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-16 19:13:01,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2023-12-16 19:13:01,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 120 states have internal predecessors, (176), 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:13:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2023-12-16 19:13:01,453 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 39 [2023-12-16 19:13:01,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:01,453 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2023-12-16 19:13:01,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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:13:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2023-12-16 19:13:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 19:13:01,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:01,454 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:01,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 19:13:01,454 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:01,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash 646157777, now seen corresponding path program 1 times [2023-12-16 19:13:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:01,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848852700] [2023-12-16 19:13:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:01,644 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:13:01,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:01,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848852700] [2023-12-16 19:13:01,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848852700] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:01,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:01,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:13:01,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311694866] [2023-12-16 19:13:01,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:01,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:13:01,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:01,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:13:01,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:13:01,646 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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:13:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:01,723 INFO L93 Difference]: Finished difference Result 277 states and 403 transitions. [2023-12-16 19:13:01,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:13:01,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2023-12-16 19:13:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:01,725 INFO L225 Difference]: With dead ends: 277 [2023-12-16 19:13:01,725 INFO L226 Difference]: Without dead ends: 195 [2023-12-16 19:13:01,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:13:01,725 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 148 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:01,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 343 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:13:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-16 19:13:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 127. [2023-12-16 19:13:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 126 states have internal predecessors, (182), 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:13:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 182 transitions. [2023-12-16 19:13:01,729 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 182 transitions. Word has length 39 [2023-12-16 19:13:01,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:01,729 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 182 transitions. [2023-12-16 19:13:01,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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:13:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2023-12-16 19:13:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 19:13:01,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:01,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:01,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:13:01,730 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:01,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:01,730 INFO L85 PathProgramCache]: Analyzing trace with hash 512144271, now seen corresponding path program 1 times [2023-12-16 19:13:01,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:01,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687949006] [2023-12-16 19:13:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:01,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:02,003 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:13:02,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:02,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687949006] [2023-12-16 19:13:02,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687949006] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:02,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:02,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:13:02,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279291091] [2023-12-16 19:13:02,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:02,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:13:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:02,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:13:02,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:13:02,004 INFO L87 Difference]: Start difference. First operand 127 states and 182 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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:13:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:02,101 INFO L93 Difference]: Finished difference Result 211 states and 302 transitions. [2023-12-16 19:13:02,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:13:02,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2023-12-16 19:13:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:02,102 INFO L225 Difference]: With dead ends: 211 [2023-12-16 19:13:02,102 INFO L226 Difference]: Without dead ends: 129 [2023-12-16 19:13:02,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:13:02,103 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 149 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:02,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 315 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-16 19:13:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2023-12-16 19:13:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.4333333333333333) internal successors, (172), 120 states have internal predecessors, (172), 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:13:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 172 transitions. [2023-12-16 19:13:02,106 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 172 transitions. Word has length 39 [2023-12-16 19:13:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:02,106 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 172 transitions. [2023-12-16 19:13:02,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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:13:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 172 transitions. [2023-12-16 19:13:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 19:13:02,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:02,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:02,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 19:13:02,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:02,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash 533816907, now seen corresponding path program 1 times [2023-12-16 19:13:02,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:02,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907870749] [2023-12-16 19:13:02,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:02,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:02,357 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:13:02,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:02,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907870749] [2023-12-16 19:13:02,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907870749] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:02,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:02,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 19:13:02,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986175723] [2023-12-16 19:13:02,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:02,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 19:13:02,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:02,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 19:13:02,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-16 19:13:02,358 INFO L87 Difference]: Start difference. First operand 121 states and 172 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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:13:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:02,560 INFO L93 Difference]: Finished difference Result 271 states and 384 transitions. [2023-12-16 19:13:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 19:13:02,561 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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 40 [2023-12-16 19:13:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:02,561 INFO L225 Difference]: With dead ends: 271 [2023-12-16 19:13:02,562 INFO L226 Difference]: Without dead ends: 201 [2023-12-16 19:13:02,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-16 19:13:02,562 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 365 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:02,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 650 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:13:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-16 19:13:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 127. [2023-12-16 19:13:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.4285714285714286) internal successors, (180), 126 states have internal predecessors, (180), 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:13:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 180 transitions. [2023-12-16 19:13:02,566 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 180 transitions. Word has length 40 [2023-12-16 19:13:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:02,566 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 180 transitions. [2023-12-16 19:13:02,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 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:13:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2023-12-16 19:13:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 19:13:02,567 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:02,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:02,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 19:13:02,567 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:02,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash -746046771, now seen corresponding path program 1 times [2023-12-16 19:13:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716133611] [2023-12-16 19:13:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:02,700 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:13:02,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:02,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716133611] [2023-12-16 19:13:02,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716133611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:02,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:02,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:13:02,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553281384] [2023-12-16 19:13:02,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:02,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:13:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:13:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:13:02,702 INFO L87 Difference]: Start difference. First operand 127 states and 180 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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:13:02,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:02,740 INFO L93 Difference]: Finished difference Result 291 states and 409 transitions. [2023-12-16 19:13:02,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:13:02,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2023-12-16 19:13:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:02,741 INFO L225 Difference]: With dead ends: 291 [2023-12-16 19:13:02,741 INFO L226 Difference]: Without dead ends: 215 [2023-12-16 19:13:02,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:13:02,742 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 183 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:02,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 306 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-16 19:13:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 139. [2023-12-16 19:13:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 138 states have internal predecessors, (194), 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:13:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2023-12-16 19:13:02,746 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 194 transitions. Word has length 40 [2023-12-16 19:13:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:02,746 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 194 transitions. [2023-12-16 19:13:02,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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:13:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2023-12-16 19:13:02,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 19:13:02,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:02,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:02,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 19:13:02,747 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:02,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:02,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2134655997, now seen corresponding path program 1 times [2023-12-16 19:13:02,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:02,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842837934] [2023-12-16 19:13:02,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:02,895 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:13:02,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:02,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842837934] [2023-12-16 19:13:02,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842837934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:02,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:02,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:13:02,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864660278] [2023-12-16 19:13:02,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:02,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:13:02,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:02,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:13:02,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:13:02,897 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:13:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:02,923 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2023-12-16 19:13:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:13:02,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 40 [2023-12-16 19:13:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:02,924 INFO L225 Difference]: With dead ends: 221 [2023-12-16 19:13:02,924 INFO L226 Difference]: Without dead ends: 139 [2023-12-16 19:13:02,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:13:02,925 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 139 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:02,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 222 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:02,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-16 19:13:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2023-12-16 19:13:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 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:13:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 190 transitions. [2023-12-16 19:13:02,929 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 190 transitions. Word has length 40 [2023-12-16 19:13:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:02,930 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 190 transitions. [2023-12-16 19:13:02,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:13:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 190 transitions. [2023-12-16 19:13:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 19:13:02,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:02,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:02,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 19:13:02,930 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:02,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:02,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1924439625, now seen corresponding path program 1 times [2023-12-16 19:13:02,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:02,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900600294] [2023-12-16 19:13:02,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:13:03,008 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:13:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:13:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900600294] [2023-12-16 19:13:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900600294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:13:03,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:13:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:13:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692453494] [2023-12-16 19:13:03,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:13:03,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:13:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:13:03,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:13:03,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:13:03,010 INFO L87 Difference]: Start difference. First operand 139 states and 190 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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:13:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:13:03,035 INFO L93 Difference]: Finished difference Result 226 states and 309 transitions. [2023-12-16 19:13:03,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:13:03,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2023-12-16 19:13:03,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:13:03,036 INFO L225 Difference]: With dead ends: 226 [2023-12-16 19:13:03,036 INFO L226 Difference]: Without dead ends: 147 [2023-12-16 19:13:03,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:13:03,037 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 66 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:13:03,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 244 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:13:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-16 19:13:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2023-12-16 19:13:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.375) internal successors, (198), 144 states have internal predecessors, (198), 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:13:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 198 transitions. [2023-12-16 19:13:03,041 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 198 transitions. Word has length 41 [2023-12-16 19:13:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:13:03,041 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 198 transitions. [2023-12-16 19:13:03,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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:13:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 198 transitions. [2023-12-16 19:13:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 19:13:03,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:13:03,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:03,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 19:13:03,042 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:13:03,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:13:03,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1783721657, now seen corresponding path program 1 times [2023-12-16 19:13:03,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:13:03,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761020016] [2023-12-16 19:13:03,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:13:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:13:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:13:03,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:13:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:13:03,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:13:03,105 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:13:03,106 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:13:03,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 19:13:03,109 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:13:03,112 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:13:03,140 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:13:03,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:13:03 BoogieIcfgContainer [2023-12-16 19:13:03,150 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:13:03,150 INFO L158 Benchmark]: Toolchain (without parser) took 6031.30ms. Allocated memory was 276.8MB in the beginning and 469.8MB in the end (delta: 192.9MB). Free memory was 225.5MB in the beginning and 316.7MB in the end (delta: -91.2MB). Peak memory consumption was 102.6MB. Max. memory is 8.0GB. [2023-12-16 19:13:03,151 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 229.6MB. Free memory is still 180.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:13:03,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.29ms. Allocated memory is still 276.8MB. Free memory was 225.1MB in the beginning and 209.7MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 19:13:03,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.08ms. Allocated memory is still 276.8MB. Free memory was 209.7MB in the beginning and 201.8MB in the end (delta: 7.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-16 19:13:03,151 INFO L158 Benchmark]: Boogie Preprocessor took 74.00ms. Allocated memory is still 276.8MB. Free memory was 201.8MB in the beginning and 196.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 19:13:03,151 INFO L158 Benchmark]: RCFGBuilder took 526.10ms. Allocated memory is still 276.8MB. Free memory was 196.1MB in the beginning and 224.3MB in the end (delta: -28.1MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-12-16 19:13:03,151 INFO L158 Benchmark]: TraceAbstraction took 5088.55ms. Allocated memory was 276.8MB in the beginning and 469.8MB in the end (delta: 192.9MB). Free memory was 223.8MB in the beginning and 316.7MB in the end (delta: -93.0MB). Peak memory consumption was 100.5MB. Max. memory is 8.0GB. [2023-12-16 19:13:03,152 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 229.6MB. Free memory is still 180.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.29ms. Allocated memory is still 276.8MB. Free memory was 225.1MB in the beginning and 209.7MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.08ms. Allocated memory is still 276.8MB. Free memory was 209.7MB in the beginning and 201.8MB in the end (delta: 7.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.00ms. Allocated memory is still 276.8MB. Free memory was 201.8MB in the beginning and 196.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 526.10ms. Allocated memory is still 276.8MB. Free memory was 196.1MB in the beginning and 224.3MB in the end (delta: -28.1MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5088.55ms. Allocated memory was 276.8MB in the beginning and 469.8MB in the end (delta: 192.9MB). Free memory was 223.8MB in the beginning and 316.7MB in the end (delta: -93.0MB). Peak memory consumption was 100.5MB. 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 bitwiseOr at line 117, overapproximation of bitwiseAnd at line 122. 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_26 mask_SORT_26 = (SORT_26)-1 >> (sizeof(SORT_26) * 8 - 2); [L33] const SORT_26 msb_SORT_26 = (SORT_26)1 << (2 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_15 = 0; [L37] const SORT_5 var_21 = 2; [L38] const SORT_5 var_23 = 1; [L39] const SORT_1 var_39 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L43] SORT_1 input_4; [L44] SORT_5 input_6; [L45] SORT_5 input_7; [L46] SORT_1 input_8; [L47] SORT_5 input_9; [L48] SORT_5 input_10; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, var_11=0, var_15=0, var_21=2, var_23=1, var_39=1] [L50] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, var_11=0, var_15=0, var_21=2, var_23=1, var_39=1] [L51] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, var_11=0, var_15=0, var_21=2, var_23=1, var_39=1] [L52] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, var_11=0, var_15=0, var_21=2, var_23=1, var_39=1] [L53] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] SORT_1 init_13_arg_1 = var_11; [L56] state_12 = init_13_arg_1 [L57] SORT_5 init_17_arg_1 = var_15; [L58] state_16 = init_17_arg_1 [L59] SORT_1 init_19_arg_1 = var_11; [L60] state_18 = init_19_arg_1 [L61] SORT_5 init_30_arg_1 = var_15; [L62] state_29 = init_30_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_15=0, var_21=2, var_23=1, var_39=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] EXPR input_2 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_15=0, var_21=2, var_23=1, var_39=1] [L66] input_2 = input_2 & mask_SORT_1 [L67] input_3 = __VERIFIER_nondet_uchar() [L68] EXPR input_3 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_15=0, var_21=2, var_23=1, var_39=1] [L68] input_3 = input_3 & mask_SORT_1 [L69] input_4 = __VERIFIER_nondet_uchar() [L70] input_6 = __VERIFIER_nondet_uchar() [L71] input_7 = __VERIFIER_nondet_uchar() [L72] input_8 = __VERIFIER_nondet_uchar() [L73] input_9 = __VERIFIER_nondet_uchar() [L74] input_10 = __VERIFIER_nondet_uchar() [L77] SORT_1 var_14_arg_0 = state_12; [L78] SORT_1 var_14 = ~var_14_arg_0; [L79] SORT_1 var_20_arg_0 = state_18; [L80] SORT_5 var_20_arg_1 = state_16; [L81] SORT_5 var_20_arg_2 = input_7; [L82] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_23=1, var_39=1] [L83] EXPR var_20 & mask_SORT_5 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_23=1, var_39=1] [L83] var_20 = var_20 & mask_SORT_5 [L84] SORT_5 var_24_arg_0 = var_20; [L85] SORT_5 var_24_arg_1 = var_23; [L86] SORT_1 var_24 = var_24_arg_0 == var_24_arg_1; [L87] SORT_1 var_25_arg_0 = var_24; [L88] SORT_1 var_25 = ~var_25_arg_0; [L89] SORT_5 var_22_arg_0 = var_20; [L90] SORT_5 var_22_arg_1 = var_21; [L91] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L92] SORT_1 var_27_arg_0 = var_25; [L93] SORT_1 var_27_arg_1 = var_22; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27_arg_0=255, var_27_arg_1=0, var_39=1] [L94] EXPR ((SORT_26)var_27_arg_0 << 1) | var_27_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27_arg_0=255, var_27_arg_1=0, var_39=1] [L94] SORT_26 var_27 = ((SORT_26)var_27_arg_0 << 1) | var_27_arg_1; [L95] EXPR var_27 & mask_SORT_26 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27=254, var_27_arg_0=255, var_27_arg_1=0, var_39=1] [L95] var_27 = var_27 & mask_SORT_26 [L96] SORT_26 var_28_arg_0 = var_27; [L97] SORT_1 var_28 = var_28_arg_0 == mask_SORT_26; [L98] SORT_1 var_31_arg_0 = state_18; [L99] SORT_5 var_31_arg_1 = state_29; [L100] SORT_5 var_31_arg_2 = input_7; [L101] SORT_5 var_31 = var_31_arg_0 ? var_31_arg_1 : var_31_arg_2; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_39=1] [L102] EXPR var_31 & mask_SORT_5 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_39=1] [L102] var_31 = var_31 & mask_SORT_5 [L103] SORT_5 var_32_arg_0 = var_31; [L104] SORT_5 var_32_arg_1 = var_21; [L105] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L106] SORT_1 var_33_arg_0 = var_25; [L107] SORT_1 var_33_arg_1 = var_32; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=2, var_33_arg_0=255, var_33_arg_1=0, var_39=1] [L108] EXPR ((SORT_26)var_33_arg_0 << 1) | var_33_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=2, var_33_arg_0=255, var_33_arg_1=0, var_39=1] [L108] SORT_26 var_33 = ((SORT_26)var_33_arg_0 << 1) | var_33_arg_1; [L109] EXPR var_33 & mask_SORT_26 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=2, var_33=254, var_33_arg_0=255, var_33_arg_1=0, var_39=1] [L109] var_33 = var_33 & mask_SORT_26 [L110] SORT_26 var_34_arg_0 = var_33; [L111] SORT_1 var_34 = var_34_arg_0 == mask_SORT_26; [L112] SORT_1 var_35_arg_0 = var_28; [L113] SORT_1 var_35_arg_1 = var_34; [L114] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L115] SORT_1 var_36_arg_0 = var_14; [L116] SORT_1 var_36_arg_1 = var_35; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=2, var_33=3, var_33_arg_0=255, var_33_arg_1=0, var_34=1, var_34_arg_0=3, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_36_arg_0=255, var_36_arg_1=1, var_39=1] [L117] EXPR var_36_arg_0 | var_36_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=2, var_33=3, var_33_arg_0=255, var_33_arg_1=0, var_34=1, var_34_arg_0=3, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_36_arg_0=255, var_36_arg_1=1, var_39=1] [L117] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L118] SORT_1 var_40_arg_0 = var_36; [L119] SORT_1 var_40 = ~var_40_arg_0; [L120] SORT_1 var_41_arg_0 = var_39; [L121] SORT_1 var_41_arg_1 = var_40; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=2, var_33=3, var_33_arg_0=255, var_33_arg_1=0, var_34=1, var_34_arg_0=3, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_36=0, var_36_arg_0=255, var_36_arg_1=1, var_39=1, var_40=255, var_40_arg_0=0, var_41_arg_0=1, var_41_arg_1=255] [L122] EXPR var_41_arg_0 & var_41_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=2, var_33=3, var_33_arg_0=255, var_33_arg_1=0, var_34=1, var_34_arg_0=3, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_36=0, var_36_arg_0=255, var_36_arg_1=1, var_39=1, var_40=255, var_40_arg_0=0, var_41_arg_0=1, var_41_arg_1=255] [L122] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L123] EXPR var_41 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_30_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_26=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=1, var_24=0, var_24_arg_0=0, var_24_arg_1=1, var_25=255, var_25_arg_0=0, var_27=3, var_27_arg_0=255, var_27_arg_1=0, var_28=1, var_28_arg_0=3, var_31=0, var_31_arg_0=0, var_31_arg_1=0, var_31_arg_2=0, var_32=0, var_32_arg_0=0, var_32_arg_1=2, var_33=3, var_33_arg_0=255, var_33_arg_1=0, var_34=1, var_34_arg_0=3, var_35=1, var_35_arg_0=1, var_35_arg_1=1, var_36=0, var_36_arg_0=255, var_36_arg_1=1, var_39=1, var_40=255, var_40_arg_0=0, var_41=1, var_41_arg_0=1, var_41_arg_1=255] [L123] var_41 = var_41 & mask_SORT_1 [L124] SORT_1 bad_42_arg_0 = var_41; [L125] CALL __VERIFIER_assert(!(bad_42_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, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3017 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3017 mSDsluCounter, 5349 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3725 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 707 IncrementalHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 1624 mSDtfsCounter, 707 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=15, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 571 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 613 NumberOfCodeBlocks, 613 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 557 ConstructedInterpolants, 0 QuantifiedInterpolants, 2177 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:13:03,166 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...