/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.twocount32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:59:05,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:59:05,648 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:59:05,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:59:05,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:59:05,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:59:05,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:59:05,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:59:05,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:59:05,694 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:59:05,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:59:05,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:59:05,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:59:05,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:59:05,697 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:59:05,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:59:05,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:59:05,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:59:05,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:59:05,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:59:05,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:59:05,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:59:05,699 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:59:05,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:59:05,700 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:59:05,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:59:05,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:59:05,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:59:05,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:59:05,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:59:05,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:59:05,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:59:05,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:59:05,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:59:05,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:59:05,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:59:05,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:59:05,704 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:59:05,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:59:05,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:59:05,704 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:59:05,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:59:05,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:59:05,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:59:05,982 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:59:05,982 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:59:05,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2023-12-16 19:59:07,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:59:07,334 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:59:07,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2023-12-16 19:59:07,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51d07687/99d4f0e5c36c4ae18997ad8fd02f8e11/FLAG29e1062a5 [2023-12-16 19:59:07,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51d07687/99d4f0e5c36c4ae18997ad8fd02f8e11 [2023-12-16 19:59:07,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:59:07,357 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:59:07,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:59:07,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:59:07,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:59:07,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:59:07" (1/1) ... [2023-12-16 19:59:07,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1128e40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07, skipping insertion in model container [2023-12-16 19:59:07,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:59:07" (1/1) ... [2023-12-16 19:59:07,383 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:59:07,499 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.twocount32.c[1260,1273] [2023-12-16 19:59:07,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:59:07,539 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:59:07,547 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.twocount32.c[1260,1273] [2023-12-16 19:59:07,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:59:07,572 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:59:07,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07 WrapperNode [2023-12-16 19:59:07,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:59:07,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:59:07,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:59:07,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:59:07,579 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:59:07" (1/1) ... [2023-12-16 19:59:07,586 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:59:07" (1/1) ... [2023-12-16 19:59:07,615 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2023-12-16 19:59:07,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:59:07,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:59:07,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:59:07,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:59:07,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07" (1/1) ... [2023-12-16 19:59:07,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07" (1/1) ... [2023-12-16 19:59:07,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07" (1/1) ... [2023-12-16 19:59:07,651 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 19:59:07,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07" (1/1) ... [2023-12-16 19:59:07,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07" (1/1) ... [2023-12-16 19:59:07,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07" (1/1) ... [2023-12-16 19:59:07,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07" (1/1) ... [2023-12-16 19:59:07,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07" (1/1) ... [2023-12-16 19:59:07,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07" (1/1) ... [2023-12-16 19:59:07,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:59:07,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:59:07,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:59:07,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:59:07,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07" (1/1) ... [2023-12-16 19:59:07,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:59:07,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:59:07,726 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:59:07,759 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:59:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:59:07,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:59:07,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:59:07,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:59:07,863 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:59:07,865 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:59:08,104 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:59:08,131 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:59:08,131 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:59:08,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:59:08 BoogieIcfgContainer [2023-12-16 19:59:08,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:59:08,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:59:08,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:59:08,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:59:08,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:59:07" (1/3) ... [2023-12-16 19:59:08,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cc3b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:59:08, skipping insertion in model container [2023-12-16 19:59:08,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:59:07" (2/3) ... [2023-12-16 19:59:08,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cc3b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:59:08, skipping insertion in model container [2023-12-16 19:59:08,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:59:08" (3/3) ... [2023-12-16 19:59:08,144 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount32.c [2023-12-16 19:59:08,158 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:59:08,158 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:59:08,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:59:08,199 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;@76de7624, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:59:08,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:59:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 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:59:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 19:59:08,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:08,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:59:08,213 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:08,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1162187761, now seen corresponding path program 1 times [2023-12-16 19:59:08,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:08,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211973197] [2023-12-16 19:59:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:08,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:08,731 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:59:08,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:08,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211973197] [2023-12-16 19:59:08,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211973197] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:59:08,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:59:08,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:59:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194125353] [2023-12-16 19:59:08,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:59:08,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:59:08,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:08,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:59:08,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:59:08,763 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 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 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:59:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:08,812 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2023-12-16 19:59:08,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:59:08,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2023-12-16 19:59:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:08,828 INFO L225 Difference]: With dead ends: 57 [2023-12-16 19:59:08,828 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 19:59:08,830 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:59:08,833 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 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:59:08,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:59:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 19:59:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-16 19:59:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 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:59:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 48 transitions. [2023-12-16 19:59:08,859 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 48 transitions. Word has length 14 [2023-12-16 19:59:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:08,859 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 48 transitions. [2023-12-16 19:59:08,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:59:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions. [2023-12-16 19:59:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 19:59:08,860 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:08,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:59:08,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:59:08,860 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:08,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:08,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1666357215, now seen corresponding path program 1 times [2023-12-16 19:59:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:08,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920631245] [2023-12-16 19:59:08,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:08,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:09,039 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:59:09,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:09,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920631245] [2023-12-16 19:59:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920631245] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:59:09,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:59:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:59:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655770454] [2023-12-16 19:59:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:59:09,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:59:09,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:09,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:59:09,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:59:09,047 INFO L87 Difference]: Start difference. First operand 32 states and 48 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:59:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:09,081 INFO L93 Difference]: Finished difference Result 60 states and 89 transitions. [2023-12-16 19:59:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:59:09,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 19:59:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:09,085 INFO L225 Difference]: With dead ends: 60 [2023-12-16 19:59:09,085 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 19:59:09,086 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:59:09,087 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 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:59:09,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:59:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 19:59:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2023-12-16 19:59:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 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:59:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2023-12-16 19:59:09,098 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 15 [2023-12-16 19:59:09,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:09,098 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2023-12-16 19:59:09,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:59:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2023-12-16 19:59:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-16 19:59:09,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:09,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:59:09,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:59:09,100 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:09,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash -327898519, now seen corresponding path program 1 times [2023-12-16 19:59:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037609626] [2023-12-16 19:59:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:09,328 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:59:09,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037609626] [2023-12-16 19:59:09,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037609626] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:59:09,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:59:09,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:59:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222763753] [2023-12-16 19:59:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:59:09,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:59:09,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:09,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:59:09,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:59:09,330 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:59:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:09,417 INFO L93 Difference]: Finished difference Result 84 states and 123 transitions. [2023-12-16 19:59:09,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:59:09,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2023-12-16 19:59:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:09,421 INFO L225 Difference]: With dead ends: 84 [2023-12-16 19:59:09,421 INFO L226 Difference]: Without dead ends: 57 [2023-12-16 19:59:09,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:59:09,424 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 125 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 125 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:59:09,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 125 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:59:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-16 19:59:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2023-12-16 19:59:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 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:59:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2023-12-16 19:59:09,429 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 16 [2023-12-16 19:59:09,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:09,429 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2023-12-16 19:59:09,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:59:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2023-12-16 19:59:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 19:59:09,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:09,430 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:59:09,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:59:09,431 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:09,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash 892453359, now seen corresponding path program 1 times [2023-12-16 19:59:09,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:09,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965551406] [2023-12-16 19:59:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:09,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:09,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965551406] [2023-12-16 19:59:09,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965551406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:59:09,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:59:09,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:59:09,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366913166] [2023-12-16 19:59:09,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:59:09,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:59:09,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:09,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:59:09,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:59:09,993 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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:59:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:10,195 INFO L93 Difference]: Finished difference Result 105 states and 151 transitions. [2023-12-16 19:59:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:59:10,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2023-12-16 19:59:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:10,198 INFO L225 Difference]: With dead ends: 105 [2023-12-16 19:59:10,199 INFO L226 Difference]: Without dead ends: 78 [2023-12-16 19:59:10,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 19:59:10,207 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 158 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:59:10,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 139 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:59:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-16 19:59:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2023-12-16 19:59:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 49 states have internal predecessors, (71), 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:59:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2023-12-16 19:59:10,218 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 31 [2023-12-16 19:59:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:10,218 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2023-12-16 19:59:10,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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:59:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2023-12-16 19:59:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 19:59:10,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:10,219 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:59:10,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:59:10,220 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:10,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash -320544669, now seen corresponding path program 1 times [2023-12-16 19:59:10,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:10,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210763512] [2023-12-16 19:59:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:10,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:10,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:10,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210763512] [2023-12-16 19:59:10,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210763512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:59:10,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:59:10,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:59:10,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132079374] [2023-12-16 19:59:10,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:59:10,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:59:10,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:10,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:59:10,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:59:10,670 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:59:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:10,818 INFO L93 Difference]: Finished difference Result 104 states and 147 transitions. [2023-12-16 19:59:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:59:10,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-16 19:59:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:10,819 INFO L225 Difference]: With dead ends: 104 [2023-12-16 19:59:10,820 INFO L226 Difference]: Without dead ends: 73 [2023-12-16 19:59:10,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:59:10,821 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 145 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:59:10,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 95 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:59:10,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-16 19:59:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2023-12-16 19:59:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 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:59:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2023-12-16 19:59:10,838 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 32 [2023-12-16 19:59:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:10,839 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2023-12-16 19:59:10,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:59:10,839 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2023-12-16 19:59:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 19:59:10,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:10,840 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:59:10,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:59:10,840 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:10,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1183309803, now seen corresponding path program 1 times [2023-12-16 19:59:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443041980] [2023-12-16 19:59:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:10,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:11,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:11,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443041980] [2023-12-16 19:59:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443041980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:59:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:59:11,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:59:11,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928507663] [2023-12-16 19:59:11,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:59:11,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:59:11,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:11,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:59:11,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:59:11,222 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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:59:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:11,407 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2023-12-16 19:59:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:59:11,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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 33 [2023-12-16 19:59:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:11,410 INFO L225 Difference]: With dead ends: 104 [2023-12-16 19:59:11,410 INFO L226 Difference]: Without dead ends: 73 [2023-12-16 19:59:11,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-16 19:59:11,411 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 140 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:59:11,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 103 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:59:11,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-16 19:59:11,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2023-12-16 19:59:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 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:59:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2023-12-16 19:59:11,427 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 33 [2023-12-16 19:59:11,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:11,427 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2023-12-16 19:59:11,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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:59:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2023-12-16 19:59:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 19:59:11,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:11,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:59:11,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:59:11,429 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:11,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1117512787, now seen corresponding path program 1 times [2023-12-16 19:59:11,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:11,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642096201] [2023-12-16 19:59:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:11,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:11,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:11,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642096201] [2023-12-16 19:59:11,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642096201] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:59:11,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798196945] [2023-12-16 19:59:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:11,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:59:11,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:59:11,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:59:11,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 19:59:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:11,874 WARN L260 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 100 conjunts are in the unsatisfiable core [2023-12-16 19:59:11,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:59:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:12,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:59:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:13,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798196945] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:59:13,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:59:13,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 20] total 41 [2023-12-16 19:59:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704102617] [2023-12-16 19:59:13,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:59:13,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-16 19:59:13,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:13,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-16 19:59:13,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2023-12-16 19:59:13,313 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 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:59:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:15,227 INFO L93 Difference]: Finished difference Result 232 states and 330 transitions. [2023-12-16 19:59:15,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-12-16 19:59:15,228 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 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 33 [2023-12-16 19:59:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:15,230 INFO L225 Difference]: With dead ends: 232 [2023-12-16 19:59:15,230 INFO L226 Difference]: Without dead ends: 205 [2023-12-16 19:59:15,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2395 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1774, Invalid=6598, Unknown=0, NotChecked=0, Total=8372 [2023-12-16 19:59:15,236 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1078 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 19:59:15,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 458 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 19:59:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-12-16 19:59:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 92. [2023-12-16 19:59:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 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:59:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2023-12-16 19:59:15,251 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 33 [2023-12-16 19:59:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:15,252 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2023-12-16 19:59:15,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.292682926829268) internal successors, (94), 41 states have internal predecessors, (94), 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:59:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2023-12-16 19:59:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 19:59:15,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:15,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:59:15,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 19:59:15,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:59:15,461 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:15,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash -120987079, now seen corresponding path program 1 times [2023-12-16 19:59:15,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:15,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588263506] [2023-12-16 19:59:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:15,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:15,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588263506] [2023-12-16 19:59:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588263506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:59:15,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:59:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:59:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426902681] [2023-12-16 19:59:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:59:15,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:59:15,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:15,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:59:15,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:59:15,905 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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:59:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:16,015 INFO L93 Difference]: Finished difference Result 163 states and 221 transitions. [2023-12-16 19:59:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:59:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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 33 [2023-12-16 19:59:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:16,016 INFO L225 Difference]: With dead ends: 163 [2023-12-16 19:59:16,017 INFO L226 Difference]: Without dead ends: 104 [2023-12-16 19:59:16,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:59:16,018 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 89 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:59:16,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 93 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:59:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-16 19:59:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2023-12-16 19:59:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 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:59:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 134 transitions. [2023-12-16 19:59:16,023 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 134 transitions. Word has length 33 [2023-12-16 19:59:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:16,024 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 134 transitions. [2023-12-16 19:59:16,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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:59:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 134 transitions. [2023-12-16 19:59:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 19:59:16,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:16,025 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:59:16,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:59:16,025 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:16,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash -707793093, now seen corresponding path program 1 times [2023-12-16 19:59:16,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:16,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737265536] [2023-12-16 19:59:16,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:16,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:16,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:16,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737265536] [2023-12-16 19:59:16,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737265536] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:59:16,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153940484] [2023-12-16 19:59:16,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:16,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:59:16,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:59:16,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:59:16,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 19:59:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:16,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 19:59:16,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:59:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:16,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:59:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:16,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153940484] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:59:16,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:59:16,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-12-16 19:59:16,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74194163] [2023-12-16 19:59:16,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:59:16,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 19:59:16,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:16,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 19:59:16,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-16 19:59:16,329 INFO L87 Difference]: Start difference. First operand 99 states and 134 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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:59:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:16,464 INFO L93 Difference]: Finished difference Result 357 states and 475 transitions. [2023-12-16 19:59:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 19:59:16,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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 33 [2023-12-16 19:59:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:16,466 INFO L225 Difference]: With dead ends: 357 [2023-12-16 19:59:16,466 INFO L226 Difference]: Without dead ends: 234 [2023-12-16 19:59:16,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-12-16 19:59:16,470 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 75 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:59:16,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 335 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:59:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-12-16 19:59:16,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 148. [2023-12-16 19:59:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 147 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:59:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 194 transitions. [2023-12-16 19:59:16,479 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 194 transitions. Word has length 33 [2023-12-16 19:59:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:16,479 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 194 transitions. [2023-12-16 19:59:16,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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:59:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 194 transitions. [2023-12-16 19:59:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 19:59:16,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:16,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 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:59:16,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 19:59:16,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-16 19:59:16,690 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:16,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:16,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1496773719, now seen corresponding path program 1 times [2023-12-16 19:59:16,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:16,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348727360] [2023-12-16 19:59:16,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:16,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:16,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:16,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348727360] [2023-12-16 19:59:16,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348727360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:59:16,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:59:16,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:59:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537132004] [2023-12-16 19:59:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:59:16,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:59:16,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:16,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:59:16,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:59:16,874 INFO L87 Difference]: Start difference. First operand 148 states and 194 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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:59:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:16,916 INFO L93 Difference]: Finished difference Result 244 states and 323 transitions. [2023-12-16 19:59:16,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:59:16,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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 33 [2023-12-16 19:59:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:16,917 INFO L225 Difference]: With dead ends: 244 [2023-12-16 19:59:16,917 INFO L226 Difference]: Without dead ends: 144 [2023-12-16 19:59:16,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:59:16,918 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 49 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:59:16,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 102 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:59:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-16 19:59:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 66. [2023-12-16 19:59:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 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:59:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2023-12-16 19:59:16,942 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 33 [2023-12-16 19:59:16,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:16,942 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2023-12-16 19:59:16,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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:59:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2023-12-16 19:59:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 19:59:16,943 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:16,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:59:16,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:59:16,944 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:16,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash -485043931, now seen corresponding path program 1 times [2023-12-16 19:59:16,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:16,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402601089] [2023-12-16 19:59:16,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:17,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:17,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402601089] [2023-12-16 19:59:17,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402601089] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:59:17,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759575570] [2023-12-16 19:59:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:17,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:59:17,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:59:17,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:59:17,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 19:59:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:17,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-16 19:59:17,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:59:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:17,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:59:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:18,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759575570] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:59:18,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:59:18,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 28 [2023-12-16 19:59:18,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065765079] [2023-12-16 19:59:18,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:59:18,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-16 19:59:18,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-16 19:59:18,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2023-12-16 19:59:18,356 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 28 states have internal predecessors, (71), 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:59:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:20,265 INFO L93 Difference]: Finished difference Result 233 states and 305 transitions. [2023-12-16 19:59:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-16 19:59:20,266 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 28 states have internal predecessors, (71), 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:59:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:20,267 INFO L225 Difference]: With dead ends: 233 [2023-12-16 19:59:20,267 INFO L226 Difference]: Without dead ends: 200 [2023-12-16 19:59:20,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=955, Invalid=4447, Unknown=0, NotChecked=0, Total=5402 [2023-12-16 19:59:20,269 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1000 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:59:20,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 501 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:59:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-16 19:59:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 91. [2023-12-16 19:59:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 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:59:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 119 transitions. [2023-12-16 19:59:20,279 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 119 transitions. Word has length 34 [2023-12-16 19:59:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:20,279 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 119 transitions. [2023-12-16 19:59:20,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 28 states have internal predecessors, (71), 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:59:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 119 transitions. [2023-12-16 19:59:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-16 19:59:20,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:20,280 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:59:20,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 19:59:20,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:59:20,489 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:20,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash -554150557, now seen corresponding path program 1 times [2023-12-16 19:59:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:20,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620149351] [2023-12-16 19:59:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 19:59:21,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:21,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620149351] [2023-12-16 19:59:21,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620149351] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:59:21,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097158466] [2023-12-16 19:59:21,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:21,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:59:21,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:59:21,090 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:59:21,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 19:59:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:21,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 134 conjunts are in the unsatisfiable core [2023-12-16 19:59:21,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:59:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:22,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:59:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 17 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:24,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097158466] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:59:24,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:59:24,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 22, 23] total 49 [2023-12-16 19:59:24,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108311569] [2023-12-16 19:59:24,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:59:24,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-16 19:59:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-16 19:59:24,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2099, Unknown=0, NotChecked=0, Total=2450 [2023-12-16 19:59:24,289 INFO L87 Difference]: Start difference. First operand 91 states and 119 transitions. Second operand has 50 states, 50 states have (on average 3.62) internal successors, (181), 49 states have internal predecessors, (181), 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:59:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:31,117 INFO L93 Difference]: Finished difference Result 594 states and 785 transitions. [2023-12-16 19:59:31,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-12-16 19:59:31,118 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.62) internal successors, (181), 49 states have internal predecessors, (181), 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 68 [2023-12-16 19:59:31,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:31,120 INFO L225 Difference]: With dead ends: 594 [2023-12-16 19:59:31,120 INFO L226 Difference]: Without dead ends: 536 [2023-12-16 19:59:31,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4269 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=3326, Invalid=13444, Unknown=0, NotChecked=0, Total=16770 [2023-12-16 19:59:31,126 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1852 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1852 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 2555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:59:31,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1852 Valid, 501 Invalid, 2555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 19:59:31,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-12-16 19:59:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 110. [2023-12-16 19:59:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.311926605504587) internal successors, (143), 109 states have internal predecessors, (143), 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:59:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 143 transitions. [2023-12-16 19:59:31,136 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 143 transitions. Word has length 68 [2023-12-16 19:59:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:31,136 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 143 transitions. [2023-12-16 19:59:31,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.62) internal successors, (181), 49 states have internal predecessors, (181), 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:59:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 143 transitions. [2023-12-16 19:59:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-16 19:59:31,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:31,137 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:59:31,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 19:59:31,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:59:31,346 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:31,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:31,347 INFO L85 PathProgramCache]: Analyzing trace with hash 829628105, now seen corresponding path program 1 times [2023-12-16 19:59:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:31,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891578988] [2023-12-16 19:59:31,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:31,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 61 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-16 19:59:31,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:31,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891578988] [2023-12-16 19:59:31,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891578988] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:59:31,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866904414] [2023-12-16 19:59:31,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:31,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:59:31,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:59:31,937 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:59:31,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 19:59:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:32,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-16 19:59:32,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:59:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 33 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:59:32,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:59:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-16 19:59:32,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866904414] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:59:32,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:59:32,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 27 [2023-12-16 19:59:32,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784709005] [2023-12-16 19:59:32,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:59:32,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-16 19:59:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:32,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-16 19:59:32,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2023-12-16 19:59:32,710 INFO L87 Difference]: Start difference. First operand 110 states and 143 transitions. Second operand has 28 states, 28 states have (on average 5.75) internal successors, (161), 27 states have internal predecessors, (161), 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:59:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:34,390 INFO L93 Difference]: Finished difference Result 440 states and 564 transitions. [2023-12-16 19:59:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-16 19:59:34,391 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.75) internal successors, (161), 27 states have internal predecessors, (161), 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 69 [2023-12-16 19:59:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:34,393 INFO L225 Difference]: With dead ends: 440 [2023-12-16 19:59:34,393 INFO L226 Difference]: Without dead ends: 357 [2023-12-16 19:59:34,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=892, Invalid=3140, Unknown=0, NotChecked=0, Total=4032 [2023-12-16 19:59:34,395 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 382 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 19:59:34,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 830 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 19:59:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-12-16 19:59:34,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 144. [2023-12-16 19:59:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.2727272727272727) internal successors, (182), 143 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:59:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2023-12-16 19:59:34,407 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 69 [2023-12-16 19:59:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:34,412 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions. [2023-12-16 19:59:34,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.75) internal successors, (161), 27 states have internal predecessors, (161), 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:59:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2023-12-16 19:59:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-16 19:59:34,413 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:34,413 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:59:34,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 19:59:34,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-16 19:59:34,614 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:34,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:34,614 INFO L85 PathProgramCache]: Analyzing trace with hash -199784115, now seen corresponding path program 1 times [2023-12-16 19:59:34,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:34,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714062040] [2023-12-16 19:59:34,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:36,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:59:36,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714062040] [2023-12-16 19:59:36,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714062040] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:59:36,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602638385] [2023-12-16 19:59:36,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:36,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:59:36,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:59:36,007 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 19:59:36,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 19:59:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:59:36,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 135 conjunts are in the unsatisfiable core [2023-12-16 19:59:36,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:59:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 61 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 19:59:37,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:59:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:59:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602638385] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:59:43,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:59:43,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 26] total 54 [2023-12-16 19:59:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795285767] [2023-12-16 19:59:43,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:59:43,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-16 19:59:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:59:43,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-16 19:59:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2506, Unknown=0, NotChecked=0, Total=2970 [2023-12-16 19:59:43,023 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand has 55 states, 55 states have (on average 2.963636363636364) internal successors, (163), 54 states have internal predecessors, (163), 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:59:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:59:50,963 INFO L93 Difference]: Finished difference Result 838 states and 1082 transitions. [2023-12-16 19:59:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-12-16 19:59:50,963 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.963636363636364) internal successors, (163), 54 states have internal predecessors, (163), 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 69 [2023-12-16 19:59:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:59:50,966 INFO L225 Difference]: With dead ends: 838 [2023-12-16 19:59:50,966 INFO L226 Difference]: Without dead ends: 721 [2023-12-16 19:59:50,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8236 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=4994, Invalid=19498, Unknown=0, NotChecked=0, Total=24492 [2023-12-16 19:59:50,970 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2543 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2543 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:59:50,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2543 Valid, 423 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1817 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 19:59:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2023-12-16 19:59:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 183. [2023-12-16 19:59:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.2582417582417582) internal successors, (229), 182 states have internal predecessors, (229), 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:59:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 229 transitions. [2023-12-16 19:59:50,996 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 229 transitions. Word has length 69 [2023-12-16 19:59:50,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:59:50,996 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 229 transitions. [2023-12-16 19:59:50,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.963636363636364) internal successors, (163), 54 states have internal predecessors, (163), 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:59:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 229 transitions. [2023-12-16 19:59:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-16 19:59:50,997 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:59:50,997 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:59:51,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 19:59:51,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:59:51,204 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:59:51,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:59:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1356744291, now seen corresponding path program 2 times [2023-12-16 19:59:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:59:51,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686897704] [2023-12-16 19:59:51,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:59:51,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:59:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:59:51,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:59:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:59:51,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:59:51,454 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:59:51,455 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:59:51,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 19:59:51,459 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:59:51,462 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:59:51,540 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:59:51,540 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:59:51,540 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:59:51,540 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:59:51,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:59:51 BoogieIcfgContainer [2023-12-16 19:59:51,562 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:59:51,563 INFO L158 Benchmark]: Toolchain (without parser) took 44205.44ms. Allocated memory was 208.7MB in the beginning and 497.0MB in the end (delta: 288.4MB). Free memory was 161.8MB in the beginning and 319.7MB in the end (delta: -157.9MB). Peak memory consumption was 131.3MB. Max. memory is 8.0GB. [2023-12-16 19:59:51,563 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 208.7MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:59:51,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.54ms. Allocated memory is still 208.7MB. Free memory was 161.8MB in the beginning and 150.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 19:59:51,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.03ms. Allocated memory is still 208.7MB. Free memory was 150.0MB in the beginning and 147.1MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 19:59:51,564 INFO L158 Benchmark]: Boogie Preprocessor took 66.37ms. Allocated memory is still 208.7MB. Free memory was 147.1MB in the beginning and 144.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 19:59:51,564 INFO L158 Benchmark]: RCFGBuilder took 448.50ms. Allocated memory is still 208.7MB. Free memory was 144.4MB in the beginning and 125.9MB in the end (delta: 18.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 19:59:51,565 INFO L158 Benchmark]: TraceAbstraction took 43424.92ms. Allocated memory was 208.7MB in the beginning and 497.0MB in the end (delta: 288.4MB). Free memory was 125.1MB in the beginning and 319.7MB in the end (delta: -194.6MB). Peak memory consumption was 94.6MB. Max. memory is 8.0GB. [2023-12-16 19:59:51,566 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.12ms. Allocated memory is still 208.7MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.54ms. Allocated memory is still 208.7MB. Free memory was 161.8MB in the beginning and 150.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.03ms. Allocated memory is still 208.7MB. Free memory was 150.0MB in the beginning and 147.1MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.37ms. Allocated memory is still 208.7MB. Free memory was 147.1MB in the beginning and 144.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 448.50ms. Allocated memory is still 208.7MB. Free memory was 144.4MB in the beginning and 125.9MB in the end (delta: 18.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 43424.92ms. Allocated memory was 208.7MB in the beginning and 497.0MB in the end (delta: 288.4MB). Free memory was 125.1MB in the beginning and 319.7MB in the end (delta: -194.6MB). Peak memory consumption was 94.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 22]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 82. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 32); [L31] const SORT_2 msb_SORT_2 = (SORT_2)1 << (32 - 1); [L33] const SORT_2 var_4 = 0; [L34] const SORT_2 var_9 = 1; [L35] const SORT_2 var_16 = 3; [L37] SORT_1 input_3; [L39] EXPR __VERIFIER_nondet_uint() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, var_16=3, var_4=0, var_9=1] [L39] SORT_2 state_5 = __VERIFIER_nondet_uint() & mask_SORT_2; [L40] EXPR __VERIFIER_nondet_uint() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, state_5=0, var_16=3, var_4=0, var_9=1] [L40] SORT_2 state_6 = __VERIFIER_nondet_uint() & mask_SORT_2; [L42] SORT_2 init_7_arg_1 = var_4; [L43] state_5 = init_7_arg_1 [L44] SORT_2 init_8_arg_1 = var_4; [L45] state_6 = init_8_arg_1 VAL [init_7_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, state_5=0, state_6=0, var_16=3, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, state_5=0, state_6=0, var_16=3, var_4=0, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, state_5=0, state_6=0, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, state_5=0, state_6=0, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, state_5=0, state_6=0, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=1, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13_arg_0=255, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=1, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13_arg_0=255, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=1, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=1, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=1, next_15_arg_1=1, state_5=1, state_6=1, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=2, next_15_arg_1=1, state_5=1, state_6=1, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=1, var_13_arg_0=255, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=2, next_15_arg_1=1, state_5=1, state_6=1, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=1, var_13_arg_0=255, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=2, next_15_arg_1=1, state_5=1, state_6=1, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=2, next_15_arg_1=1, state_5=1, state_6=1, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=2, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=3, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=2, var_13_arg_0=255, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=3, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=2, var_13_arg_0=255, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=3, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=3, next_15_arg_1=2, state_5=2, state_6=2, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=1, var_17_arg_0=3, var_17_arg_1=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=1, var_17_arg_0=3, var_17_arg_1=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=4294967295, msb_SORT_1=1, msb_SORT_2=2147483648, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=1, var_17_arg_0=3, var_17_arg_1=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=1, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_9=1] [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L22] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.3s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7638 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7638 mSDsluCounter, 3951 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3452 mSDsCounter, 460 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7514 IncrementalHoareTripleChecker+Invalid, 7974 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 460 mSolverCounterUnsat, 499 mSDtfsCounter, 7514 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1054 GetRequests, 467 SyntacticMatches, 14 SemanticMatches, 573 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17192 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=14, InterpolantAutomatonStates: 391, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1645 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 889 NumberOfCodeBlocks, 889 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1099 ConstructedInterpolants, 0 QuantifiedInterpolants, 18323 SizeOfPredicates, 206 NumberOfNonLiveVariables, 1754 ConjunctsInSsa, 478 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 424/793 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:59:51,595 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...