/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.h_b04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:30:01,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:30:01,718 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:30:01,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:30:01,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:30:01,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:30:01,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:30:01,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:30:01,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:30:01,748 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:30:01,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:30:01,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:30:01,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:30:01,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:30:01,751 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:30:01,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:30:01,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:30:01,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:30:01,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:30:01,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:30:01,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:30:01,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:30:01,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:30:01,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:30:01,753 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:30:01,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:30:01,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:30:01,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:30:01,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:30:01,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:30:01,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:30:01,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:30:01,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:30:01,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:30:01,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:30:01,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:30:01,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:30:01,756 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:30:01,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:30:01,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:30:01,756 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:30:01,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:30:01,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:30:01,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:30:01,986 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:30:01,986 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:30:01,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2023-12-16 19:30:03,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:30:03,263 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:30:03,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2023-12-16 19:30:03,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de63fc3b/abfa8c5ca3134121bc48f311930dee5c/FLAGe967a41a8 [2023-12-16 19:30:03,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de63fc3b/abfa8c5ca3134121bc48f311930dee5c [2023-12-16 19:30:03,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:30:03,680 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:30:03,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:30:03,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:30:03,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:30:03,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:30:03" (1/1) ... [2023-12-16 19:30:03,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b7a334d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03, skipping insertion in model container [2023-12-16 19:30:03,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:30:03" (1/1) ... [2023-12-16 19:30:03,709 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:30:03,860 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.h_b04.c[1245,1258] [2023-12-16 19:30:03,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:30:03,926 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:30:03,935 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.h_b04.c[1245,1258] [2023-12-16 19:30:03,961 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:30:03,971 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:30:03,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03 WrapperNode [2023-12-16 19:30:03,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:30:03,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:30:03,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:30:03,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:30:03,978 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:30:03" (1/1) ... [2023-12-16 19:30:03,985 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:30:03" (1/1) ... [2023-12-16 19:30:04,020 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 236 [2023-12-16 19:30:04,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:30:04,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:30:04,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:30:04,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:30:04,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03" (1/1) ... [2023-12-16 19:30:04,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03" (1/1) ... [2023-12-16 19:30:04,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03" (1/1) ... [2023-12-16 19:30:04,060 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-16 19:30:04,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03" (1/1) ... [2023-12-16 19:30:04,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03" (1/1) ... [2023-12-16 19:30:04,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03" (1/1) ... [2023-12-16 19:30:04,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03" (1/1) ... [2023-12-16 19:30:04,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03" (1/1) ... [2023-12-16 19:30:04,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03" (1/1) ... [2023-12-16 19:30:04,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:30:04,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:30:04,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:30:04,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:30:04,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03" (1/1) ... [2023-12-16 19:30:04,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:30:04,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:30:04,158 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:30:04,236 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:30:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:30:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:30:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 19:30:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:30:04,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:30:04,337 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:30:04,338 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:30:04,643 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:30:04,661 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:30:04,662 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:30:04,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:30:04 BoogieIcfgContainer [2023-12-16 19:30:04,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:30:04,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:30:04,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:30:04,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:30:04,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:30:03" (1/3) ... [2023-12-16 19:30:04,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c097e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:30:04, skipping insertion in model container [2023-12-16 19:30:04,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:30:03" (2/3) ... [2023-12-16 19:30:04,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c097e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:30:04, skipping insertion in model container [2023-12-16 19:30:04,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:30:04" (3/3) ... [2023-12-16 19:30:04,670 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b04.c [2023-12-16 19:30:04,683 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:30:04,684 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:30:04,721 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:30:04,725 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;@3efbea9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:30:04,726 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:30:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 states have internal predecessors, (55), 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:30:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 19:30:04,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:04,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:04,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:04,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:04,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2037151720, now seen corresponding path program 1 times [2023-12-16 19:30:04,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:04,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241391660] [2023-12-16 19:30:04,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:04,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:05,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:05,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241391660] [2023-12-16 19:30:05,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241391660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:05,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:05,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:05,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286024317] [2023-12-16 19:30:05,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:05,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:30:05,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:05,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:30:05,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:30:05,163 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 states have internal predecessors, (55), 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 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:05,193 INFO L93 Difference]: Finished difference Result 60 states and 96 transitions. [2023-12-16 19:30:05,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:30:05,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-16 19:30:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:05,200 INFO L225 Difference]: With dead ends: 60 [2023-12-16 19:30:05,200 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 19:30:05,202 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:30:05,205 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 139 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:30:05,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 139 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 19:30:05,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-16 19:30:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2023-12-16 19:30:05,238 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 20 [2023-12-16 19:30:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:05,239 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2023-12-16 19:30:05,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2023-12-16 19:30:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 19:30:05,239 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:05,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:05,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:30:05,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:05,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:05,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1274531164, now seen corresponding path program 1 times [2023-12-16 19:30:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:05,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248936490] [2023-12-16 19:30:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:05,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:05,386 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:30:05,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:05,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248936490] [2023-12-16 19:30:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248936490] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:05,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:05,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435318671] [2023-12-16 19:30:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:05,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:30:05,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:05,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:30:05,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:30:05,389 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:05,419 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. [2023-12-16 19:30:05,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:30:05,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-16 19:30:05,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:05,420 INFO L225 Difference]: With dead ends: 63 [2023-12-16 19:30:05,421 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 19:30:05,421 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:30:05,422 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 137 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:30:05,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 137 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 19:30:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-12-16 19:30:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 36 states have internal predecessors, (55), 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:30:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2023-12-16 19:30:05,432 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 21 [2023-12-16 19:30:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:05,432 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2023-12-16 19:30:05,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2023-12-16 19:30:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 19:30:05,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:05,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:05,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:30:05,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:05,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:05,436 INFO L85 PathProgramCache]: Analyzing trace with hash 645328050, now seen corresponding path program 1 times [2023-12-16 19:30:05,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:05,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784840783] [2023-12-16 19:30:05,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:05,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:05,682 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:30:05,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:05,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784840783] [2023-12-16 19:30:05,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784840783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:05,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:05,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:30:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679083990] [2023-12-16 19:30:05,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:05,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:30:05,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:05,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:30:05,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:30:05,689 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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:30:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:05,796 INFO L93 Difference]: Finished difference Result 98 states and 144 transitions. [2023-12-16 19:30:05,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:30:05,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2023-12-16 19:30:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:05,799 INFO L225 Difference]: With dead ends: 98 [2023-12-16 19:30:05,799 INFO L226 Difference]: Without dead ends: 71 [2023-12-16 19:30:05,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:30:05,802 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 108 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:05,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 182 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-16 19:30:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2023-12-16 19:30:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 39 states have internal predecessors, (58), 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:30:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2023-12-16 19:30:05,811 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 22 [2023-12-16 19:30:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:05,812 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2023-12-16 19:30:05,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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:30:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2023-12-16 19:30:05,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 19:30:05,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:05,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:05,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:30:05,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:05,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:05,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1874631884, now seen corresponding path program 1 times [2023-12-16 19:30:05,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:05,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609527291] [2023-12-16 19:30:05,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:05,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:06,049 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:30:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609527291] [2023-12-16 19:30:06,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609527291] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:06,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:06,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97961138] [2023-12-16 19:30:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:06,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:30:06,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:06,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:30:06,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:30:06,051 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:30:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:06,080 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2023-12-16 19:30:06,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:30:06,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2023-12-16 19:30:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:06,082 INFO L225 Difference]: With dead ends: 74 [2023-12-16 19:30:06,082 INFO L226 Difference]: Without dead ends: 44 [2023-12-16 19:30:06,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:30:06,089 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 65 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:06,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 100 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-16 19:30:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2023-12-16 19:30:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 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:30:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2023-12-16 19:30:06,097 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 22 [2023-12-16 19:30:06,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:06,097 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2023-12-16 19:30:06,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:30:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2023-12-16 19:30:06,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 19:30:06,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:06,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:06,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:30:06,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:06,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:06,098 INFO L85 PathProgramCache]: Analyzing trace with hash -262787072, now seen corresponding path program 1 times [2023-12-16 19:30:06,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:06,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279620709] [2023-12-16 19:30:06,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:06,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:06,479 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:30:06,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:06,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279620709] [2023-12-16 19:30:06,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279620709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:06,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:06,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 19:30:06,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795354683] [2023-12-16 19:30:06,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:06,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 19:30:06,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:06,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 19:30:06,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:30:06,482 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:30:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:06,848 INFO L93 Difference]: Finished difference Result 128 states and 183 transitions. [2023-12-16 19:30:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 19:30:06,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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 23 [2023-12-16 19:30:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:06,850 INFO L225 Difference]: With dead ends: 128 [2023-12-16 19:30:06,850 INFO L226 Difference]: Without dead ends: 101 [2023-12-16 19:30:06,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-12-16 19:30:06,852 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 209 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:06,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 375 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:30:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-16 19:30:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 46. [2023-12-16 19:30:06,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.488888888888889) internal successors, (67), 45 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2023-12-16 19:30:06,860 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 23 [2023-12-16 19:30:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:06,860 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2023-12-16 19:30:06,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:30:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2023-12-16 19:30:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 19:30:06,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:06,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:06,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:30:06,862 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:06,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1512220290, now seen corresponding path program 1 times [2023-12-16 19:30:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:06,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462542940] [2023-12-16 19:30:06,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:06,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:07,159 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:30:07,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:07,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462542940] [2023-12-16 19:30:07,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462542940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:07,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:07,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964017178] [2023-12-16 19:30:07,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:07,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:30:07,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:07,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:30:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:30:07,161 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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:30:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:07,197 INFO L93 Difference]: Finished difference Result 122 states and 173 transitions. [2023-12-16 19:30:07,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:30:07,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2023-12-16 19:30:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:07,198 INFO L225 Difference]: With dead ends: 122 [2023-12-16 19:30:07,198 INFO L226 Difference]: Without dead ends: 86 [2023-12-16 19:30:07,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:30:07,199 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 93 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:07,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 146 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-16 19:30:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 52. [2023-12-16 19:30:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 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:30:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2023-12-16 19:30:07,203 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 23 [2023-12-16 19:30:07,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:07,203 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2023-12-16 19:30:07,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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:30:07,203 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2023-12-16 19:30:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 19:30:07,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:07,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:07,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:30:07,204 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:07,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:07,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1905247300, now seen corresponding path program 1 times [2023-12-16 19:30:07,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:07,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116063506] [2023-12-16 19:30:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:07,415 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:30:07,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116063506] [2023-12-16 19:30:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116063506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:07,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:07,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:30:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953749433] [2023-12-16 19:30:07,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:07,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:30:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:07,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:30:07,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:30:07,417 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:30:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:07,644 INFO L93 Difference]: Finished difference Result 156 states and 213 transitions. [2023-12-16 19:30:07,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 19:30:07,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 23 [2023-12-16 19:30:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:07,645 INFO L225 Difference]: With dead ends: 156 [2023-12-16 19:30:07,645 INFO L226 Difference]: Without dead ends: 114 [2023-12-16 19:30:07,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-16 19:30:07,647 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 226 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:07,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 295 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:30:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-16 19:30:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 54. [2023-12-16 19:30:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 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:30:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 75 transitions. [2023-12-16 19:30:07,660 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 75 transitions. Word has length 23 [2023-12-16 19:30:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:07,660 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 75 transitions. [2023-12-16 19:30:07,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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:30:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 75 transitions. [2023-12-16 19:30:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 19:30:07,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:07,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:07,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:30:07,661 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:07,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:07,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1658705908, now seen corresponding path program 1 times [2023-12-16 19:30:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:07,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439849174] [2023-12-16 19:30:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:07,755 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:30:07,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:07,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439849174] [2023-12-16 19:30:07,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439849174] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:07,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:07,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:07,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501273172] [2023-12-16 19:30:07,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:07,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:30:07,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:07,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:30:07,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:30:07,757 INFO L87 Difference]: Start difference. First operand 54 states and 75 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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:30:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:07,844 INFO L93 Difference]: Finished difference Result 144 states and 195 transitions. [2023-12-16 19:30:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:30:07,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-16 19:30:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:07,845 INFO L225 Difference]: With dead ends: 144 [2023-12-16 19:30:07,845 INFO L226 Difference]: Without dead ends: 100 [2023-12-16 19:30:07,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:30:07,848 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 110 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:07,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 75 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:30:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-16 19:30:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 63. [2023-12-16 19:30:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 62 states have internal predecessors, (88), 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:30:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2023-12-16 19:30:07,853 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 24 [2023-12-16 19:30:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:07,853 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2023-12-16 19:30:07,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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:30:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2023-12-16 19:30:07,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 19:30:07,856 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:07,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:07,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:30:07,856 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:07,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2049455374, now seen corresponding path program 1 times [2023-12-16 19:30:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:07,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652420646] [2023-12-16 19:30:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:07,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:07,997 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:30:07,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:07,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652420646] [2023-12-16 19:30:07,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652420646] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:07,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:07,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:07,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773467232] [2023-12-16 19:30:07,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:07,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:30:07,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:07,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:30:07,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:30:07,999 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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:30:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:08,032 INFO L93 Difference]: Finished difference Result 133 states and 179 transitions. [2023-12-16 19:30:08,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:30:08,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-16 19:30:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:08,034 INFO L225 Difference]: With dead ends: 133 [2023-12-16 19:30:08,034 INFO L226 Difference]: Without dead ends: 87 [2023-12-16 19:30:08,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:30:08,038 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 102 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:08,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 130 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:08,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-16 19:30:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2023-12-16 19:30:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2023-12-16 19:30:08,051 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 24 [2023-12-16 19:30:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:08,051 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2023-12-16 19:30:08,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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:30:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2023-12-16 19:30:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 19:30:08,053 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:08,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:08,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 19:30:08,053 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:08,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:08,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1802186394, now seen corresponding path program 1 times [2023-12-16 19:30:08,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:08,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888988751] [2023-12-16 19:30:08,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:08,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:08,190 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:30:08,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:08,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888988751] [2023-12-16 19:30:08,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888988751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:08,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:30:08,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:30:08,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762122090] [2023-12-16 19:30:08,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:08,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:30:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:08,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:30:08,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:30:08,192 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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:30:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:08,263 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2023-12-16 19:30:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:30:08,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-16 19:30:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:08,264 INFO L225 Difference]: With dead ends: 118 [2023-12-16 19:30:08,264 INFO L226 Difference]: Without dead ends: 71 [2023-12-16 19:30:08,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:30:08,265 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 82 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:08,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 75 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:30:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-16 19:30:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2023-12-16 19:30:08,269 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:30:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2023-12-16 19:30:08,269 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 24 [2023-12-16 19:30:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:08,270 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2023-12-16 19:30:08,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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:30:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2023-12-16 19:30:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 19:30:08,271 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:08,271 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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:30:08,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:30:08,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:08,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:08,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1154856000, now seen corresponding path program 1 times [2023-12-16 19:30:08,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:08,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803626262] [2023-12-16 19:30:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:08,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:08,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:08,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803626262] [2023-12-16 19:30:08,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803626262] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:30:08,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389797313] [2023-12-16 19:30:08,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:08,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:30:08,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:30:08,494 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:30:08,521 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:30:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:08,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-16 19:30:08,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:30:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:08,823 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 19:30:08,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389797313] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:30:08,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 19:30:08,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2023-12-16 19:30:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427350725] [2023-12-16 19:30:08,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:30:08,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 19:30:08,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:08,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 19:30:08,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-12-16 19:30:08,831 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:08,941 INFO L93 Difference]: Finished difference Result 115 states and 153 transitions. [2023-12-16 19:30:08,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 19:30:08,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-12-16 19:30:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:08,942 INFO L225 Difference]: With dead ends: 115 [2023-12-16 19:30:08,943 INFO L226 Difference]: Without dead ends: 71 [2023-12-16 19:30:08,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2023-12-16 19:30:08,944 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 55 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:08,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 93 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:30:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-16 19:30:08,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2023-12-16 19:30:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 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:30:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2023-12-16 19:30:08,949 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 40 [2023-12-16 19:30:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:08,949 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2023-12-16 19:30:08,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2023-12-16 19:30:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 19:30:08,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:08,951 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1] [2023-12-16 19:30:08,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 19:30:09,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-16 19:30:09,159 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:09,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash -509127684, now seen corresponding path program 1 times [2023-12-16 19:30:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:09,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973432676] [2023-12-16 19:30:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:09,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:09,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:09,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973432676] [2023-12-16 19:30:09,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973432676] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:30:09,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417237419] [2023-12-16 19:30:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:09,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:30:09,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:30:09,504 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:30:09,529 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:30:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:09,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-16 19:30:09,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:30:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:09,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:30:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:10,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417237419] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:30:10,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:30:10,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 12] total 27 [2023-12-16 19:30:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140854617] [2023-12-16 19:30:10,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:30:10,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-16 19:30:10,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:10,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-16 19:30:10,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2023-12-16 19:30:10,740 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 28 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 27 states have internal predecessors, (99), 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:30:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:11,629 INFO L93 Difference]: Finished difference Result 186 states and 242 transitions. [2023-12-16 19:30:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 19:30:11,629 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 27 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-16 19:30:11,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:11,631 INFO L225 Difference]: With dead ends: 186 [2023-12-16 19:30:11,631 INFO L226 Difference]: Without dead ends: 142 [2023-12-16 19:30:11,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=434, Invalid=1822, Unknown=0, NotChecked=0, Total=2256 [2023-12-16 19:30:11,633 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 381 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:11,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 418 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:30:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-16 19:30:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 101. [2023-12-16 19:30:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 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:30:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2023-12-16 19:30:11,639 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 41 [2023-12-16 19:30:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:11,639 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2023-12-16 19:30:11,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.5357142857142856) internal successors, (99), 27 states have internal predecessors, (99), 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:30:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2023-12-16 19:30:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 19:30:11,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:11,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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:30:11,648 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:30:11,846 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,SelfDestructingSolverStorable11 [2023-12-16 19:30:11,846 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:11,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:11,846 INFO L85 PathProgramCache]: Analyzing trace with hash -652608170, now seen corresponding path program 1 times [2023-12-16 19:30:11,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:11,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933523357] [2023-12-16 19:30:11,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:11,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:12,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:12,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933523357] [2023-12-16 19:30:12,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933523357] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:30:12,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421358501] [2023-12-16 19:30:12,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:12,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:30:12,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:30:12,258 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:30:12,279 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:30:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:12,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-16 19:30:12,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:30:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:12,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:30:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:13,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421358501] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:30:13,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:30:13,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 23 [2023-12-16 19:30:13,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16077854] [2023-12-16 19:30:13,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:30:13,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 19:30:13,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:13,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 19:30:13,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2023-12-16 19:30:13,540 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 23 states have internal predecessors, (95), 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:30:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:14,028 INFO L93 Difference]: Finished difference Result 197 states and 254 transitions. [2023-12-16 19:30:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 19:30:14,029 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-12-16 19:30:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:14,029 INFO L225 Difference]: With dead ends: 197 [2023-12-16 19:30:14,029 INFO L226 Difference]: Without dead ends: 122 [2023-12-16 19:30:14,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 19:30:14,030 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 320 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:14,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 378 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:30:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-16 19:30:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2023-12-16 19:30:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 103 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:30:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2023-12-16 19:30:14,036 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 41 [2023-12-16 19:30:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:14,037 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2023-12-16 19:30:14,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 23 states have internal predecessors, (95), 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:30:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2023-12-16 19:30:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 19:30:14,037 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:14,037 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:14,054 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:30:14,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:30:14,244 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:14,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:14,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2100926384, now seen corresponding path program 1 times [2023-12-16 19:30:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:14,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135783702] [2023-12-16 19:30:14,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:14,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:14,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135783702] [2023-12-16 19:30:14,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135783702] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:30:14,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696170780] [2023-12-16 19:30:14,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:14,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:30:14,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:30:15,001 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:30:15,060 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:30:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:15,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 83 conjunts are in the unsatisfiable core [2023-12-16 19:30:15,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:30:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:15,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:30:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 35 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:16,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696170780] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:30:16,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:30:16,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 33 [2023-12-16 19:30:16,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888589187] [2023-12-16 19:30:16,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:30:16,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-16 19:30:16,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:16,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-16 19:30:16,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2023-12-16 19:30:16,048 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand has 33 states, 33 states have (on average 4.787878787878788) internal successors, (158), 33 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:20,094 INFO L93 Difference]: Finished difference Result 393 states and 508 transitions. [2023-12-16 19:30:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-12-16 19:30:20,094 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.787878787878788) internal successors, (158), 33 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-12-16 19:30:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:20,095 INFO L225 Difference]: With dead ends: 393 [2023-12-16 19:30:20,095 INFO L226 Difference]: Without dead ends: 349 [2023-12-16 19:30:20,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2949 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1995, Invalid=9995, Unknown=0, NotChecked=0, Total=11990 [2023-12-16 19:30:20,098 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 1015 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:20,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 655 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 19:30:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-12-16 19:30:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 99. [2023-12-16 19:30:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 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:30:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2023-12-16 19:30:20,106 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 57 [2023-12-16 19:30:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:20,106 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2023-12-16 19:30:20,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.787878787878788) internal successors, (158), 33 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2023-12-16 19:30:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 19:30:20,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:20,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:20,115 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:30:20,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:30:20,313 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:20,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:20,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1957445898, now seen corresponding path program 1 times [2023-12-16 19:30:20,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:20,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467888726] [2023-12-16 19:30:20,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:20,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:21,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:30:21,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467888726] [2023-12-16 19:30:21,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467888726] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 19:30:21,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740525024] [2023-12-16 19:30:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:21,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 19:30:21,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:30:21,034 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:30:21,062 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:30:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:30:21,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-16 19:30:21,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 19:30:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:21,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 19:30:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 19:30:22,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740525024] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 19:30:22,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 19:30:22,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 14] total 31 [2023-12-16 19:30:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378931523] [2023-12-16 19:30:22,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 19:30:22,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-16 19:30:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:30:22,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-16 19:30:22,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2023-12-16 19:30:22,009 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand has 31 states, 31 states have (on average 5.032258064516129) internal successors, (156), 31 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:30:23,700 INFO L93 Difference]: Finished difference Result 230 states and 288 transitions. [2023-12-16 19:30:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-16 19:30:23,700 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.032258064516129) internal successors, (156), 31 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-12-16 19:30:23,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:30:23,718 INFO L225 Difference]: With dead ends: 230 [2023-12-16 19:30:23,718 INFO L226 Difference]: Without dead ends: 157 [2023-12-16 19:30:23,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1047, Invalid=3923, Unknown=0, NotChecked=0, Total=4970 [2023-12-16 19:30:23,726 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 388 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 19:30:23,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 563 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 19:30:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-12-16 19:30:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 77. [2023-12-16 19:30:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 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:30:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2023-12-16 19:30:23,736 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 57 [2023-12-16 19:30:23,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:30:23,737 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2023-12-16 19:30:23,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.032258064516129) internal successors, (156), 31 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 19:30:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2023-12-16 19:30:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-16 19:30:23,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:30:23,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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:30:23,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-16 19:30:23,943 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,SelfDestructingSolverStorable14 [2023-12-16 19:30:23,943 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:30:23,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:30:23,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1670063938, now seen corresponding path program 1 times [2023-12-16 19:30:23,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:30:23,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450907421] [2023-12-16 19:30:23,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:30:23,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:30:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:30:24,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 19:30:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 19:30:24,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 19:30:24,320 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 19:30:24,321 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:30:24,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 19:30:24,324 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 19:30:24,327 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:30:24,423 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:30:24,423 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:30:24,423 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 19:30:24,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:30:24 BoogieIcfgContainer [2023-12-16 19:30:24,460 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:30:24,461 INFO L158 Benchmark]: Toolchain (without parser) took 20781.19ms. Allocated memory was 298.8MB in the beginning and 584.1MB in the end (delta: 285.2MB). Free memory was 246.7MB in the beginning and 205.1MB in the end (delta: 41.6MB). Peak memory consumption was 327.4MB. Max. memory is 8.0GB. [2023-12-16 19:30:24,461 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 180.4MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:30:24,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.42ms. Allocated memory is still 298.8MB. Free memory was 246.2MB in the beginning and 233.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 19:30:24,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.24ms. Allocated memory is still 298.8MB. Free memory was 233.1MB in the beginning and 228.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 19:30:24,462 INFO L158 Benchmark]: Boogie Preprocessor took 56.01ms. Allocated memory is still 298.8MB. Free memory was 228.9MB in the beginning and 225.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 19:30:24,462 INFO L158 Benchmark]: RCFGBuilder took 574.47ms. Allocated memory is still 298.8MB. Free memory was 225.2MB in the beginning and 200.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-16 19:30:24,463 INFO L158 Benchmark]: TraceAbstraction took 19796.85ms. Allocated memory was 298.8MB in the beginning and 584.1MB in the end (delta: 285.2MB). Free memory was 199.5MB in the beginning and 205.1MB in the end (delta: -5.6MB). Peak memory consumption was 280.2MB. Max. memory is 8.0GB. [2023-12-16 19:30:24,466 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.10ms. Allocated memory is still 180.4MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.42ms. Allocated memory is still 298.8MB. Free memory was 246.2MB in the beginning and 233.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.24ms. Allocated memory is still 298.8MB. Free memory was 233.1MB in the beginning and 228.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.01ms. Allocated memory is still 298.8MB. Free memory was 228.9MB in the beginning and 225.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 574.47ms. Allocated memory is still 298.8MB. Free memory was 225.2MB in the beginning and 200.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 19796.85ms. Allocated memory was 298.8MB in the beginning and 584.1MB in the end (delta: 285.2MB). Free memory was 199.5MB in the beginning and 205.1MB in the end (delta: -5.6MB). Peak memory consumption was 280.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 97. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 8); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (8 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 32); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (32 - 1); [L35] const SORT_4 var_8 = 0; [L36] const SORT_12 var_14 = 1; [L37] const SORT_1 var_25 = 1; [L38] const SORT_1 var_42 = 0; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L42] SORT_4 input_5; [L43] SORT_1 input_6; [L44] SORT_1 input_7; [L45] SORT_4 input_29; [L46] SORT_4 input_31; [L47] SORT_4 input_33; [L48] SORT_4 input_35; [L49] SORT_4 input_37; [L50] SORT_4 input_39; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, var_14=1, var_25=1, var_42=0, var_8=0] [L52] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, state_9=0, var_14=1, var_25=1, var_42=0, var_8=0] [L53] SORT_4 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, state_17=0, state_9=0, var_14=1, var_25=1, var_42=0, var_8=0] [L54] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] SORT_4 init_10_arg_1 = var_8; [L57] state_9 = init_10_arg_1 [L58] SORT_4 init_18_arg_1 = var_8; [L59] state_17 = init_18_arg_1 [L60] SORT_1 init_44_arg_1 = var_42; [L61] state_43 = init_44_arg_1 VAL [init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0, var_8=0] [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, state_17=0, state_43=0, state_9=0, var_11=0, var_11_arg_0=0, var_13_arg_0=0, var_14=1, var_25=1, var_42=0, var_8=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, state_17=0, state_43=0, state_9=0, var_11=0, var_11_arg_0=0, var_13_arg_0=0, var_14=1, var_25=1, var_42=0, var_8=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, state_17=0, state_43=0, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20_arg_0=0, var_25=1, var_42=0, var_8=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, state_17=0, state_43=0, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20_arg_0=0, var_25=1, var_42=0, var_8=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, state_17=0, state_43=0, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_42=0, var_8=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, state_17=0, state_43=0, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_42=0, var_8=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, state_17=0, state_43=0, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_8=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, state_17=0, state_43=0, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_8=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, state_17=0, state_43=0, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_8=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L105] RET __VERIFIER_assert(!(bad_28_arg_0)) [L107] SORT_1 var_45_arg_0 = state_43; [L108] SORT_4 var_45_arg_1 = input_5; [L109] SORT_4 var_45_arg_2 = state_9; [L110] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L111] SORT_4 next_46_arg_1 = var_45; [L112] SORT_1 var_47_arg_0 = state_43; [L113] SORT_4 var_47_arg_1 = input_5; [L114] SORT_4 var_47_arg_2 = state_17; [L115] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L116] SORT_4 next_48_arg_1 = var_47; [L117] SORT_1 var_49_arg_0 = state_43; [L118] SORT_1 var_49_arg_1 = var_42; [L119] SORT_1 var_49_arg_2 = var_25; [L120] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, input_5=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=0, next_48_arg_1=0, state_17=0, state_43=0, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_45_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_49=1, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L121] EXPR var_49 & mask_SORT_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, input_5=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=0, next_48_arg_1=0, state_17=0, state_43=0, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_45_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_49=1, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L121] var_49 = var_49 & mask_SORT_1 [L122] SORT_1 next_50_arg_1 = var_49; [L124] state_9 = next_46_arg_1 [L125] state_17 = next_48_arg_1 [L126] state_43 = next_50_arg_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, input_5=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=0, next_48_arg_1=0, next_50_arg_1=1, state_17=0, state_43=1, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_45_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_49=1, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=0, next_48_arg_1=0, next_50_arg_1=1, state_17=0, state_43=1, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_45_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_49=1, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=0, next_48_arg_1=0, next_50_arg_1=1, state_17=0, state_43=1, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_45_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_49=1, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=0, next_48_arg_1=0, next_50_arg_1=1, state_17=0, state_43=1, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_45_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_49=1, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=0, next_48_arg_1=0, next_50_arg_1=1, state_17=0, state_43=1, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_45_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_49=1, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=0, next_48_arg_1=0, next_50_arg_1=1, state_17=0, state_43=1, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_45_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_49=1, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=0, next_48_arg_1=0, next_50_arg_1=1, state_17=0, state_43=1, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_45_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_49=1, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=0, next_48_arg_1=0, next_50_arg_1=1, state_17=0, state_43=1, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_45_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_49=1, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=0, next_48_arg_1=0, next_50_arg_1=1, state_17=0, state_43=1, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_45_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_49=1, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=0, next_48_arg_1=0, next_50_arg_1=1, state_17=0, state_43=1, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=0, var_45_arg_0=0, var_45_arg_1=0, var_45_arg_2=0, var_47=0, var_47_arg_0=0, var_47_arg_1=0, var_47_arg_2=0, var_49=1, var_49_arg_0=0, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L105] RET __VERIFIER_assert(!(bad_28_arg_0)) [L107] SORT_1 var_45_arg_0 = state_43; [L108] SORT_4 var_45_arg_1 = input_5; [L109] SORT_4 var_45_arg_2 = state_9; [L110] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L111] SORT_4 next_46_arg_1 = var_45; [L112] SORT_1 var_47_arg_0 = state_43; [L113] SORT_4 var_47_arg_1 = input_5; [L114] SORT_4 var_47_arg_2 = state_17; [L115] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L116] SORT_4 next_48_arg_1 = var_47; [L117] SORT_1 var_49_arg_0 = state_43; [L118] SORT_1 var_49_arg_1 = var_42; [L119] SORT_1 var_49_arg_2 = var_25; [L120] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, input_5=255, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=255, next_48_arg_1=255, next_50_arg_1=1, state_17=0, state_43=1, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=255, var_45_arg_0=1, var_45_arg_1=255, var_45_arg_2=0, var_47=255, var_47_arg_0=1, var_47_arg_1=255, var_47_arg_2=0, var_49=0, var_49_arg_0=1, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L121] EXPR var_49 & mask_SORT_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, input_5=255, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=255, next_48_arg_1=255, next_50_arg_1=1, state_17=0, state_43=1, state_9=0, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=255, var_45_arg_0=1, var_45_arg_1=255, var_45_arg_2=0, var_47=255, var_47_arg_0=1, var_47_arg_1=255, var_47_arg_2=0, var_49=0, var_49_arg_0=1, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L121] var_49 = var_49 & mask_SORT_1 [L122] SORT_1 next_50_arg_1 = var_49; [L124] state_9 = next_46_arg_1 [L125] state_17 = next_48_arg_1 [L126] state_43 = next_50_arg_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, input_5=255, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=255, next_48_arg_1=255, next_50_arg_1=0, state_17=255, state_43=0, state_9=255, var_11=0, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=255, var_45_arg_0=1, var_45_arg_1=255, var_45_arg_2=0, var_47=255, var_47_arg_0=1, var_47_arg_1=255, var_47_arg_2=0, var_49=0, var_49_arg_0=1, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=255, next_48_arg_1=255, next_50_arg_1=0, state_17=255, state_43=0, state_9=255, var_11=1, var_11_arg_0=255, var_13=0, var_13_arg_0=1, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=255, var_45_arg_0=1, var_45_arg_1=255, var_45_arg_2=0, var_47=255, var_47_arg_0=1, var_47_arg_1=255, var_47_arg_2=0, var_49=0, var_49_arg_0=1, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=255, next_48_arg_1=255, next_50_arg_1=0, state_17=255, state_43=0, state_9=255, var_11=1, var_11_arg_0=255, var_13=0, var_13_arg_0=1, var_14=1, var_15=0, var_15_arg_0=0, var_15_arg_1=1, var_16=255, var_16_arg_0=0, var_19=0, var_19_arg_0=0, var_20=0, var_20_arg_0=0, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=255, var_45_arg_0=1, var_45_arg_1=255, var_45_arg_2=0, var_47=255, var_47_arg_0=1, var_47_arg_1=255, var_47_arg_2=0, var_49=0, var_49_arg_0=1, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=255, next_48_arg_1=255, next_50_arg_1=0, state_17=255, state_43=0, state_9=255, var_11=1, var_11_arg_0=255, var_13=1, var_13_arg_0=1, var_14=1, var_15=1, var_15_arg_0=1, var_15_arg_1=1, var_16=254, var_16_arg_0=1, var_19=1, var_19_arg_0=255, var_20=0, var_20_arg_0=1, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=255, var_45_arg_0=1, var_45_arg_1=255, var_45_arg_2=0, var_47=255, var_47_arg_0=1, var_47_arg_1=255, var_47_arg_2=0, var_49=0, var_49_arg_0=1, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=255, next_48_arg_1=255, next_50_arg_1=0, state_17=255, state_43=0, state_9=255, var_11=1, var_11_arg_0=255, var_13=1, var_13_arg_0=1, var_14=1, var_15=1, var_15_arg_0=1, var_15_arg_1=1, var_16=254, var_16_arg_0=1, var_19=1, var_19_arg_0=255, var_20=0, var_20_arg_0=1, var_21=0, var_21_arg_0=0, var_21_arg_1=1, var_22=255, var_22_arg_0=255, var_22_arg_1=0, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=255, var_45_arg_0=1, var_45_arg_1=255, var_45_arg_2=0, var_47=255, var_47_arg_0=1, var_47_arg_1=255, var_47_arg_2=0, var_49=0, var_49_arg_0=1, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=255, next_48_arg_1=255, next_50_arg_1=0, state_17=255, state_43=0, state_9=255, var_11=1, var_11_arg_0=255, var_13=1, var_13_arg_0=1, var_14=1, var_15=1, var_15_arg_0=1, var_15_arg_1=1, var_16=254, var_16_arg_0=1, var_19=1, var_19_arg_0=255, var_20=1, var_20_arg_0=1, var_21=1, var_21_arg_0=1, var_21_arg_1=1, var_22=255, var_22_arg_0=254, var_22_arg_1=1, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=255, var_45_arg_0=1, var_45_arg_1=255, var_45_arg_2=0, var_47=255, var_47_arg_0=1, var_47_arg_1=255, var_47_arg_2=0, var_49=0, var_49_arg_0=1, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=255, next_48_arg_1=255, next_50_arg_1=0, state_17=255, state_43=0, state_9=255, var_11=1, var_11_arg_0=255, var_13=1, var_13_arg_0=1, var_14=1, var_15=1, var_15_arg_0=1, var_15_arg_1=1, var_16=254, var_16_arg_0=1, var_19=1, var_19_arg_0=255, var_20=1, var_20_arg_0=1, var_21=1, var_21_arg_0=1, var_21_arg_1=1, var_22=255, var_22_arg_0=254, var_22_arg_1=1, var_25=1, var_26=0, var_26_arg_0=255, var_27=0, var_27_arg_0=1, var_27_arg_1=0, var_42=0, var_45=255, var_45_arg_0=1, var_45_arg_1=255, var_45_arg_2=0, var_47=255, var_47_arg_0=1, var_47_arg_1=255, var_47_arg_2=0, var_49=0, var_49_arg_0=1, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=255, next_48_arg_1=255, next_50_arg_1=0, state_17=255, state_43=0, state_9=255, var_11=1, var_11_arg_0=255, var_13=1, var_13_arg_0=1, var_14=1, var_15=1, var_15_arg_0=1, var_15_arg_1=1, var_16=254, var_16_arg_0=1, var_19=1, var_19_arg_0=255, var_20=1, var_20_arg_0=1, var_21=1, var_21_arg_0=1, var_21_arg_1=1, var_22=254, var_22_arg_0=254, var_22_arg_1=1, var_25=1, var_26=1, var_26_arg_0=254, var_27=0, var_27_arg_0=1, var_27_arg_1=1, var_42=0, var_45=255, var_45_arg_0=1, var_45_arg_1=255, var_45_arg_2=0, var_47=255, var_47_arg_0=1, var_47_arg_1=255, var_47_arg_2=0, var_49=0, var_49_arg_0=1, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=255, next_48_arg_1=255, next_50_arg_1=0, state_17=255, state_43=0, state_9=255, var_11=1, var_11_arg_0=255, var_13=1, var_13_arg_0=1, var_14=1, var_15=1, var_15_arg_0=1, var_15_arg_1=1, var_16=254, var_16_arg_0=1, var_19=1, var_19_arg_0=255, var_20=1, var_20_arg_0=1, var_21=1, var_21_arg_0=1, var_21_arg_1=1, var_22=254, var_22_arg_0=254, var_22_arg_1=1, var_25=1, var_26=1, var_26_arg_0=254, var_27=0, var_27_arg_0=1, var_27_arg_1=1, var_42=0, var_45=255, var_45_arg_0=1, var_45_arg_1=255, var_45_arg_2=0, var_47=255, var_47_arg_0=1, var_47_arg_1=255, var_47_arg_2=0, var_49=0, var_49_arg_0=1, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [bad_28_arg_0=0, init_10_arg_1=0, init_18_arg_1=0, init_44_arg_1=0, mask_SORT_12=4294967295, mask_SORT_1=1, mask_SORT_4=255, msb_SORT_12=2147483648, msb_SORT_1=1, msb_SORT_4=128, next_46_arg_1=255, next_48_arg_1=255, next_50_arg_1=0, state_17=255, state_43=0, state_9=255, var_11=1, var_11_arg_0=255, var_13=1, var_13_arg_0=1, var_14=1, var_15=1, var_15_arg_0=1, var_15_arg_1=1, var_16=254, var_16_arg_0=1, var_19=1, var_19_arg_0=255, var_20=1, var_20_arg_0=1, var_21=1, var_21_arg_0=1, var_21_arg_1=1, var_22=254, var_22_arg_0=254, var_22_arg_1=1, var_25=1, var_26=1, var_26_arg_0=254, var_27=1, var_27_arg_0=1, var_27_arg_1=1, var_42=0, var_45=255, var_45_arg_0=1, var_45_arg_1=255, var_45_arg_2=0, var_47=255, var_47_arg_0=1, var_47_arg_1=255, var_47_arg_2=0, var_49=0, var_49_arg_0=1, var_49_arg_1=0, var_49_arg_2=1, var_8=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3156 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3156 mSDsluCounter, 3761 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3098 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3281 IncrementalHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 663 mSDtfsCounter, 3281 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 750 GetRequests, 408 SyntacticMatches, 2 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4689 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=13, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 654 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 756 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 870 ConstructedInterpolants, 18 QuantifiedInterpolants, 7909 SizeOfPredicates, 104 NumberOfNonLiveVariables, 1718 ConjunctsInSsa, 288 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 281/356 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:30:24,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...