/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-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label09.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 12:18:45,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 12:18:46,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 12:18:46,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 12:18:46,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 12:18:46,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 12:18:46,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 12:18:46,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 12:18:46,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 12:18:46,077 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 12:18:46,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 12:18:46,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 12:18:46,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 12:18:46,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 12:18:46,078 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 12:18:46,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 12:18:46,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 12:18:46,079 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 12:18:46,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 12:18:46,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 12:18:46,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 12:18:46,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 12:18:46,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 12:18:46,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 12:18:46,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 12:18:46,086 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 12:18:46,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 12:18:46,087 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 12:18:46,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 12:18:46,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 12:18:46,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 12:18:46,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 12:18:46,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 12:18:46,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 12:18:46,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 12:18:46,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 12:18:46,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 12:18:46,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 12:18:46,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 12:18:46,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 12:18:46,090 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 12:18:46,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 12:18:46,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 12:18:46,090 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 -> false [2023-12-20 12:18:46,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 12:18:46,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 12:18:46,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 12:18:46,319 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 12:18:46,319 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 12:18:46,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label09.c [2023-12-20 12:18:47,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 12:18:48,049 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 12:18:48,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label09.c [2023-12-20 12:18:48,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f29314a/cb5745031adf48e89fed420e082a30b2/FLAG70ac347eb [2023-12-20 12:18:48,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f29314a/cb5745031adf48e89fed420e082a30b2 [2023-12-20 12:18:48,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 12:18:48,090 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 12:18:48,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 12:18:48,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 12:18:48,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 12:18:48,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:18:48" (1/1) ... [2023-12-20 12:18:48,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c86cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:48, skipping insertion in model container [2023-12-20 12:18:48,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:18:48" (1/1) ... [2023-12-20 12:18:48,185 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 12:18:48,424 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label09.c[6391,6404] [2023-12-20 12:18:48,485 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label09.c[14139,14152] [2023-12-20 12:18:49,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 12:18:49,108 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 12:18:49,137 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label09.c[6391,6404] [2023-12-20 12:18:49,151 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label09.c[14139,14152] [2023-12-20 12:18:49,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 12:18:49,449 INFO L206 MainTranslator]: Completed translation [2023-12-20 12:18:49,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49 WrapperNode [2023-12-20 12:18:49,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 12:18:49,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 12:18:49,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 12:18:49,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 12:18:49,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (1/1) ... [2023-12-20 12:18:49,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (1/1) ... [2023-12-20 12:18:49,761 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4981 [2023-12-20 12:18:49,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 12:18:49,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 12:18:49,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 12:18:49,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 12:18:49,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (1/1) ... [2023-12-20 12:18:49,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (1/1) ... [2023-12-20 12:18:49,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (1/1) ... [2023-12-20 12:18:49,914 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 12:18:49,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (1/1) ... [2023-12-20 12:18:49,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (1/1) ... [2023-12-20 12:18:50,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (1/1) ... [2023-12-20 12:18:50,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (1/1) ... [2023-12-20 12:18:50,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (1/1) ... [2023-12-20 12:18:50,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (1/1) ... [2023-12-20 12:18:50,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 12:18:50,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 12:18:50,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 12:18:50,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 12:18:50,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (1/1) ... [2023-12-20 12:18:50,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 12:18:50,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:18:50,157 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-20 12:18:50,173 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-20 12:18:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 12:18:50,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 12:18:50,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 12:18:50,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 12:18:50,334 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 12:18:50,335 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 12:18:53,289 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 12:18:53,328 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 12:18:53,328 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-20 12:18:53,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:18:53 BoogieIcfgContainer [2023-12-20 12:18:53,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 12:18:53,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 12:18:53,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 12:18:53,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 12:18:53,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 12:18:48" (1/3) ... [2023-12-20 12:18:53,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f74d888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:18:53, skipping insertion in model container [2023-12-20 12:18:53,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:49" (2/3) ... [2023-12-20 12:18:53,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f74d888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:18:53, skipping insertion in model container [2023-12-20 12:18:53,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:18:53" (3/3) ... [2023-12-20 12:18:53,334 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label09.c [2023-12-20 12:18:53,345 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 12:18:53,345 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-20 12:18:53,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 12:18:53,388 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;@4ed14e20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 12:18:53,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-20 12:18:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 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-20 12:18:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-20 12:18:53,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:53,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:53,400 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:53,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1947968790, now seen corresponding path program 1 times [2023-12-20 12:18:53,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:53,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622208895] [2023-12-20 12:18:53,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:53,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:53,518 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-20 12:18:53,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:53,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622208895] [2023-12-20 12:18:53,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622208895] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:53,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:53,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 12:18:53,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732307804] [2023-12-20 12:18:53,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:53,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 12:18:53,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:53,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 12:18:53,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 12:18:53,543 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-20 12:18:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:53,598 INFO L93 Difference]: Finished difference Result 1594 states and 3146 transitions. [2023-12-20 12:18:53,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 12:18:53,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2023-12-20 12:18:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:53,610 INFO L225 Difference]: With dead ends: 1594 [2023-12-20 12:18:53,610 INFO L226 Difference]: Without dead ends: 803 [2023-12-20 12:18:53,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 12:18:53,616 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:53,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1521 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2023-12-20 12:18:53,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2023-12-20 12:18:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.898876404494382) internal successors, (1521), 802 states have internal predecessors, (1521), 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-20 12:18:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2023-12-20 12:18:53,664 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2023-12-20 12:18:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:53,664 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2023-12-20 12:18:53,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-20 12:18:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2023-12-20 12:18:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-20 12:18:53,665 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:53,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:53,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 12:18:53,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:53,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1760192492, now seen corresponding path program 1 times [2023-12-20 12:18:53,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:53,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896979583] [2023-12-20 12:18:53,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:53,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:53,781 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-20 12:18:53,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:53,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896979583] [2023-12-20 12:18:53,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896979583] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:53,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:53,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 12:18:53,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354604907] [2023-12-20 12:18:53,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:53,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:18:53,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:53,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:18:53,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:18:53,784 INFO L87 Difference]: Start difference. First operand 803 states and 1521 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-20 12:18:53,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:53,853 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2023-12-20 12:18:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 12:18:53,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-12-20 12:18:53,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:53,858 INFO L225 Difference]: With dead ends: 864 [2023-12-20 12:18:53,858 INFO L226 Difference]: Without dead ends: 832 [2023-12-20 12:18:53,859 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-20 12:18:53,860 INFO L413 NwaCegarLoop]: 1516 mSDtfsCounter, 45 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:53,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4527 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-12-20 12:18:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2023-12-20 12:18:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.8789013732833957) internal successors, (1505), 802 states have internal predecessors, (1505), 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-20 12:18:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2023-12-20 12:18:53,887 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2023-12-20 12:18:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:53,888 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2023-12-20 12:18:53,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-20 12:18:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2023-12-20 12:18:53,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-20 12:18:53,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:53,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:53,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 12:18:53,891 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:53,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1166183952, now seen corresponding path program 1 times [2023-12-20 12:18:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:53,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722151145] [2023-12-20 12:18:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:53,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:54,073 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-20 12:18:54,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:54,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722151145] [2023-12-20 12:18:54,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722151145] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:54,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:54,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 12:18:54,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629666752] [2023-12-20 12:18:54,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:54,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 12:18:54,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 12:18:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:18:54,079 INFO L87 Difference]: Start difference. First operand 803 states and 1505 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:54,260 INFO L93 Difference]: Finished difference Result 977 states and 1781 transitions. [2023-12-20 12:18:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 12:18:54,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-20 12:18:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:54,265 INFO L225 Difference]: With dead ends: 977 [2023-12-20 12:18:54,265 INFO L226 Difference]: Without dead ends: 948 [2023-12-20 12:18:54,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 12:18:54,267 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 4578 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:54,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 1841 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 12:18:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2023-12-20 12:18:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 830. [2023-12-20 12:18:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8695652173913044) internal successors, (1548), 829 states have internal predecessors, (1548), 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-20 12:18:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1548 transitions. [2023-12-20 12:18:54,289 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1548 transitions. Word has length 32 [2023-12-20 12:18:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:54,290 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1548 transitions. [2023-12-20 12:18:54,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1548 transitions. [2023-12-20 12:18:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 12:18:54,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:54,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:54,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 12:18:54,291 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:54,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash 160996032, now seen corresponding path program 1 times [2023-12-20 12:18:54,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:54,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445329706] [2023-12-20 12:18:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:54,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:54,371 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-20 12:18:54,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:54,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445329706] [2023-12-20 12:18:54,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445329706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:54,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:54,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:54,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955432723] [2023-12-20 12:18:54,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:54,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:54,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:54,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:54,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:54,373 INFO L87 Difference]: Start difference. First operand 830 states and 1548 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:54,396 INFO L93 Difference]: Finished difference Result 931 states and 1707 transitions. [2023-12-20 12:18:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:54,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-20 12:18:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:54,399 INFO L225 Difference]: With dead ends: 931 [2023-12-20 12:18:54,399 INFO L226 Difference]: Without dead ends: 875 [2023-12-20 12:18:54,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:54,400 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 1464 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:54,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1540 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2023-12-20 12:18:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2023-12-20 12:18:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8530424799081515) internal successors, (1614), 872 states have internal predecessors, (1614), 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-20 12:18:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1614 transitions. [2023-12-20 12:18:54,414 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1614 transitions. Word has length 34 [2023-12-20 12:18:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:54,415 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1614 transitions. [2023-12-20 12:18:54,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1614 transitions. [2023-12-20 12:18:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 12:18:54,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:54,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:54,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 12:18:54,417 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:54,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:54,417 INFO L85 PathProgramCache]: Analyzing trace with hash 163140984, now seen corresponding path program 1 times [2023-12-20 12:18:54,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:54,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495653441] [2023-12-20 12:18:54,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:54,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:54,531 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-20 12:18:54,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:54,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495653441] [2023-12-20 12:18:54,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495653441] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:54,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 12:18:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898779883] [2023-12-20 12:18:54,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:54,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 12:18:54,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:54,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 12:18:54,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:18:54,534 INFO L87 Difference]: Start difference. First operand 873 states and 1614 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:54,595 INFO L93 Difference]: Finished difference Result 974 states and 1770 transitions. [2023-12-20 12:18:54,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:18:54,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-20 12:18:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:54,598 INFO L225 Difference]: With dead ends: 974 [2023-12-20 12:18:54,598 INFO L226 Difference]: Without dead ends: 875 [2023-12-20 12:18:54,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-20 12:18:54,604 INFO L413 NwaCegarLoop]: 1497 mSDtfsCounter, 4411 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4411 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:54,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4411 Valid, 1579 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2023-12-20 12:18:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2023-12-20 12:18:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8507462686567164) internal successors, (1612), 872 states have internal predecessors, (1612), 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-20 12:18:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1612 transitions. [2023-12-20 12:18:54,622 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1612 transitions. Word has length 34 [2023-12-20 12:18:54,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:54,622 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1612 transitions. [2023-12-20 12:18:54,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1612 transitions. [2023-12-20 12:18:54,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-20 12:18:54,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:54,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:54,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 12:18:54,628 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:54,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash 634048377, now seen corresponding path program 1 times [2023-12-20 12:18:54,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:54,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741677292] [2023-12-20 12:18:54,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:54,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:18:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741677292] [2023-12-20 12:18:54,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741677292] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:54,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:54,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 12:18:54,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288289627] [2023-12-20 12:18:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:54,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:18:54,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:54,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:18:54,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:18:54,733 INFO L87 Difference]: Start difference. First operand 873 states and 1612 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:54,761 INFO L93 Difference]: Finished difference Result 881 states and 1621 transitions. [2023-12-20 12:18:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 12:18:54,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-20 12:18:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:54,766 INFO L225 Difference]: With dead ends: 881 [2023-12-20 12:18:54,766 INFO L226 Difference]: Without dead ends: 879 [2023-12-20 12:18:54,766 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-20 12:18:54,766 INFO L413 NwaCegarLoop]: 1501 mSDtfsCounter, 1 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:54,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4495 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2023-12-20 12:18:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2023-12-20 12:18:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 875 states have (on average 1.8457142857142856) internal successors, (1615), 876 states have internal predecessors, (1615), 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-20 12:18:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1615 transitions. [2023-12-20 12:18:54,780 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1615 transitions. Word has length 35 [2023-12-20 12:18:54,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:54,781 INFO L495 AbstractCegarLoop]: Abstraction has 877 states and 1615 transitions. [2023-12-20 12:18:54,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1615 transitions. [2023-12-20 12:18:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-20 12:18:54,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:54,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:54,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 12:18:54,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:54,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:54,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1174229944, now seen corresponding path program 1 times [2023-12-20 12:18:54,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:54,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740155567] [2023-12-20 12:18:54,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:54,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:54,819 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-20 12:18:54,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740155567] [2023-12-20 12:18:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740155567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:54,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:54,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:54,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541700849] [2023-12-20 12:18:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:54,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:54,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:54,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:54,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:54,820 INFO L87 Difference]: Start difference. First operand 877 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:54,842 INFO L93 Difference]: Finished difference Result 991 states and 1788 transitions. [2023-12-20 12:18:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:54,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-20 12:18:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:54,845 INFO L225 Difference]: With dead ends: 991 [2023-12-20 12:18:54,845 INFO L226 Difference]: Without dead ends: 931 [2023-12-20 12:18:54,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:54,847 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 1474 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:54,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2023-12-20 12:18:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2023-12-20 12:18:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 927 states have (on average 1.825242718446602) internal successors, (1692), 928 states have internal predecessors, (1692), 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-20 12:18:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1692 transitions. [2023-12-20 12:18:54,865 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1692 transitions. Word has length 36 [2023-12-20 12:18:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:54,866 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1692 transitions. [2023-12-20 12:18:54,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1692 transitions. [2023-12-20 12:18:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-20 12:18:54,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:54,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:54,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 12:18:54,866 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:54,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash 548573880, now seen corresponding path program 1 times [2023-12-20 12:18:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201938595] [2023-12-20 12:18:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:54,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:54,904 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-20 12:18:54,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:54,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201938595] [2023-12-20 12:18:54,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201938595] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:54,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:54,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:54,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29534755] [2023-12-20 12:18:54,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:54,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:54,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:54,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:54,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:54,906 INFO L87 Difference]: Start difference. First operand 929 states and 1692 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:54,928 INFO L93 Difference]: Finished difference Result 1211 states and 2112 transitions. [2023-12-20 12:18:54,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:54,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-20 12:18:54,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:54,932 INFO L225 Difference]: With dead ends: 1211 [2023-12-20 12:18:54,932 INFO L226 Difference]: Without dead ends: 1058 [2023-12-20 12:18:54,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:54,933 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 1472 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:54,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2023-12-20 12:18:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1056. [2023-12-20 12:18:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1054 states have (on average 1.777988614800759) internal successors, (1874), 1055 states have internal predecessors, (1874), 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-20 12:18:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1874 transitions. [2023-12-20 12:18:54,952 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1874 transitions. Word has length 36 [2023-12-20 12:18:54,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:54,953 INFO L495 AbstractCegarLoop]: Abstraction has 1056 states and 1874 transitions. [2023-12-20 12:18:54,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1874 transitions. [2023-12-20 12:18:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-20 12:18:54,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:54,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:54,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 12:18:54,954 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:54,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:54,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1437307320, now seen corresponding path program 1 times [2023-12-20 12:18:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:54,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002391507] [2023-12-20 12:18:54,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:54,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:54,994 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-20 12:18:54,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:54,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002391507] [2023-12-20 12:18:54,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002391507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:54,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:54,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:54,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587663777] [2023-12-20 12:18:54,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:54,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:54,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:54,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:54,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:54,997 INFO L87 Difference]: Start difference. First operand 1056 states and 1874 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:55,023 INFO L93 Difference]: Finished difference Result 1568 states and 2616 transitions. [2023-12-20 12:18:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:55,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-20 12:18:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:55,028 INFO L225 Difference]: With dead ends: 1568 [2023-12-20 12:18:55,030 INFO L226 Difference]: Without dead ends: 1288 [2023-12-20 12:18:55,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:55,034 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 1470 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:55,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1586 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2023-12-20 12:18:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1286. [2023-12-20 12:18:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1284 states have (on average 1.705607476635514) internal successors, (2190), 1285 states have internal predecessors, (2190), 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-20 12:18:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2190 transitions. [2023-12-20 12:18:55,060 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2190 transitions. Word has length 36 [2023-12-20 12:18:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:55,061 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 2190 transitions. [2023-12-20 12:18:55,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2190 transitions. [2023-12-20 12:18:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-20 12:18:55,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:55,062 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:55,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 12:18:55,062 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:55,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:55,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1394266792, now seen corresponding path program 1 times [2023-12-20 12:18:55,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:55,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997499182] [2023-12-20 12:18:55,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 12:18:55,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:55,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997499182] [2023-12-20 12:18:55,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997499182] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:55,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:55,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 12:18:55,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399478049] [2023-12-20 12:18:55,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:55,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 12:18:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 12:18:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:18:55,185 INFO L87 Difference]: Start difference. First operand 1286 states and 2190 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:55,278 INFO L93 Difference]: Finished difference Result 2794 states and 4342 transitions. [2023-12-20 12:18:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:18:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-20 12:18:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:55,288 INFO L225 Difference]: With dead ends: 2794 [2023-12-20 12:18:55,289 INFO L226 Difference]: Without dead ends: 2424 [2023-12-20 12:18:55,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 12:18:55,291 INFO L413 NwaCegarLoop]: 1540 mSDtfsCounter, 3031 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3031 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:55,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3031 Valid, 3153 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2023-12-20 12:18:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1726. [2023-12-20 12:18:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.6299303944315546) internal successors, (2810), 1725 states have internal predecessors, (2810), 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-20 12:18:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2810 transitions. [2023-12-20 12:18:55,329 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2810 transitions. Word has length 50 [2023-12-20 12:18:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:55,329 INFO L495 AbstractCegarLoop]: Abstraction has 1726 states and 2810 transitions. [2023-12-20 12:18:55,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2810 transitions. [2023-12-20 12:18:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-20 12:18:55,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:55,330 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:55,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 12:18:55,330 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:55,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash 768610728, now seen corresponding path program 1 times [2023-12-20 12:18:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:55,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216160639] [2023-12-20 12:18:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 12:18:55,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216160639] [2023-12-20 12:18:55,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216160639] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:55,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:55,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 12:18:55,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544271884] [2023-12-20 12:18:55,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:55,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 12:18:55,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:55,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 12:18:55,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:18:55,482 INFO L87 Difference]: Start difference. First operand 1726 states and 2810 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:55,573 INFO L93 Difference]: Finished difference Result 3302 states and 5062 transitions. [2023-12-20 12:18:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:18:55,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-12-20 12:18:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:55,580 INFO L225 Difference]: With dead ends: 3302 [2023-12-20 12:18:55,581 INFO L226 Difference]: Without dead ends: 2792 [2023-12-20 12:18:55,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 12:18:55,583 INFO L413 NwaCegarLoop]: 1539 mSDtfsCounter, 3035 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3035 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:55,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3035 Valid, 3130 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2023-12-20 12:18:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2418. [2023-12-20 12:18:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5653973509933774) internal successors, (3782), 2417 states have internal predecessors, (3782), 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-20 12:18:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3782 transitions. [2023-12-20 12:18:55,641 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3782 transitions. Word has length 50 [2023-12-20 12:18:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:55,642 INFO L495 AbstractCegarLoop]: Abstraction has 2418 states and 3782 transitions. [2023-12-20 12:18:55,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:18:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3782 transitions. [2023-12-20 12:18:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-20 12:18:55,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:55,643 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:55,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 12:18:55,644 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:55,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:55,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1657344168, now seen corresponding path program 1 times [2023-12-20 12:18:55,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:55,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110377206] [2023-12-20 12:18:55,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:55,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-20 12:18:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:55,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110377206] [2023-12-20 12:18:55,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110377206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:55,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:55,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 12:18:55,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909659432] [2023-12-20 12:18:55,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:55,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 12:18:55,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:55,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 12:18:55,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:18:55,725 INFO L87 Difference]: Start difference. First operand 2418 states and 3782 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-20 12:18:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:55,830 INFO L93 Difference]: Finished difference Result 3810 states and 5778 transitions. [2023-12-20 12:18:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:18:55,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 50 [2023-12-20 12:18:55,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:55,841 INFO L225 Difference]: With dead ends: 3810 [2023-12-20 12:18:55,841 INFO L226 Difference]: Without dead ends: 3300 [2023-12-20 12:18:55,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 12:18:55,843 INFO L413 NwaCegarLoop]: 1538 mSDtfsCounter, 3041 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:55,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3134 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2023-12-20 12:18:55,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2926. [2023-12-20 12:18:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2924 states have (on average 1.5383036935704515) internal successors, (4498), 2925 states have internal predecessors, (4498), 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-20 12:18:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4498 transitions. [2023-12-20 12:18:55,921 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4498 transitions. Word has length 50 [2023-12-20 12:18:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:55,921 INFO L495 AbstractCegarLoop]: Abstraction has 2926 states and 4498 transitions. [2023-12-20 12:18:55,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-20 12:18:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4498 transitions. [2023-12-20 12:18:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-20 12:18:55,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:55,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:55,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-20 12:18:55,922 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:55,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:55,923 INFO L85 PathProgramCache]: Analyzing trace with hash 711524920, now seen corresponding path program 1 times [2023-12-20 12:18:55,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:55,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351749049] [2023-12-20 12:18:55,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:55,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:18:55,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:55,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351749049] [2023-12-20 12:18:55,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351749049] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:55,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:55,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:55,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272979584] [2023-12-20 12:18:55,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:55,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:55,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:55,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:55,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:55,996 INFO L87 Difference]: Start difference. First operand 2926 states and 4498 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-20 12:18:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:56,066 INFO L93 Difference]: Finished difference Result 5078 states and 7536 transitions. [2023-12-20 12:18:56,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:56,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2023-12-20 12:18:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:56,074 INFO L225 Difference]: With dead ends: 5078 [2023-12-20 12:18:56,074 INFO L226 Difference]: Without dead ends: 2928 [2023-12-20 12:18:56,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:56,078 INFO L413 NwaCegarLoop]: 1520 mSDtfsCounter, 29 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3011 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:56,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3011 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2023-12-20 12:18:56,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2926. [2023-12-20 12:18:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2924 states have (on average 1.5212038303693571) internal successors, (4448), 2925 states have internal predecessors, (4448), 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-20 12:18:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4448 transitions. [2023-12-20 12:18:56,149 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4448 transitions. Word has length 51 [2023-12-20 12:18:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:56,149 INFO L495 AbstractCegarLoop]: Abstraction has 2926 states and 4448 transitions. [2023-12-20 12:18:56,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-20 12:18:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4448 transitions. [2023-12-20 12:18:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-20 12:18:56,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:56,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:56,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 12:18:56,150 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:56,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:56,151 INFO L85 PathProgramCache]: Analyzing trace with hash -220010704, now seen corresponding path program 1 times [2023-12-20 12:18:56,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:56,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510193149] [2023-12-20 12:18:56,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:18:56,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:56,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510193149] [2023-12-20 12:18:56,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510193149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:56,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:56,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:56,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589902533] [2023-12-20 12:18:56,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:56,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:56,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:56,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:56,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:56,209 INFO L87 Difference]: Start difference. First operand 2926 states and 4448 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-20 12:18:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:56,247 INFO L93 Difference]: Finished difference Result 3772 states and 5635 transitions. [2023-12-20 12:18:56,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:56,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2023-12-20 12:18:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:56,252 INFO L225 Difference]: With dead ends: 3772 [2023-12-20 12:18:56,252 INFO L226 Difference]: Without dead ends: 1622 [2023-12-20 12:18:56,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:56,254 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 23 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:56,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3008 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2023-12-20 12:18:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1615. [2023-12-20 12:18:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1613 states have (on average 1.6261624302541848) internal successors, (2623), 1614 states have internal predecessors, (2623), 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-20 12:18:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2623 transitions. [2023-12-20 12:18:56,289 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2623 transitions. Word has length 52 [2023-12-20 12:18:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:56,289 INFO L495 AbstractCegarLoop]: Abstraction has 1615 states and 2623 transitions. [2023-12-20 12:18:56,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-20 12:18:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2623 transitions. [2023-12-20 12:18:56,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-20 12:18:56,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:56,290 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:56,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 12:18:56,290 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:56,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:56,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2127630598, now seen corresponding path program 1 times [2023-12-20 12:18:56,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:56,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741920970] [2023-12-20 12:18:56,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:56,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:18:56,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:56,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741920970] [2023-12-20 12:18:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741920970] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:56,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670890964] [2023-12-20 12:18:56,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:56,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:56,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:56,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:56,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:56,346 INFO L87 Difference]: Start difference. First operand 1615 states and 2623 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-20 12:18:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:56,369 INFO L93 Difference]: Finished difference Result 2033 states and 3201 transitions. [2023-12-20 12:18:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:56,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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) Word has length 53 [2023-12-20 12:18:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:56,386 INFO L225 Difference]: With dead ends: 2033 [2023-12-20 12:18:56,386 INFO L226 Difference]: Without dead ends: 1203 [2023-12-20 12:18:56,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:56,387 INFO L413 NwaCegarLoop]: 1512 mSDtfsCounter, 25 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:56,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2987 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 12:18:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2023-12-20 12:18:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1201. [2023-12-20 12:18:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1199 states have (on average 1.6997497914929107) internal successors, (2038), 1200 states have internal predecessors, (2038), 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-20 12:18:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2038 transitions. [2023-12-20 12:18:56,461 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2038 transitions. Word has length 53 [2023-12-20 12:18:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:56,462 INFO L495 AbstractCegarLoop]: Abstraction has 1201 states and 2038 transitions. [2023-12-20 12:18:56,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-20 12:18:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2038 transitions. [2023-12-20 12:18:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-20 12:18:56,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:56,463 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:56,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-20 12:18:56,463 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:56,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:56,463 INFO L85 PathProgramCache]: Analyzing trace with hash -778516140, now seen corresponding path program 1 times [2023-12-20 12:18:56,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:56,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878782816] [2023-12-20 12:18:56,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:56,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:18:57,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:57,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878782816] [2023-12-20 12:18:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878782816] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:18:57,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791271214] [2023-12-20 12:18:57,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:57,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:18:57,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:18:57,598 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-20 12:18:57,637 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-20 12:18:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:57,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-20 12:18:57,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:18:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 12:18:57,807 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:18:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 12:18:58,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791271214] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:18:58,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:18:58,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2023-12-20 12:18:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278578859] [2023-12-20 12:18:58,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:18:58,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-20 12:18:58,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:58,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-20 12:18:58,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-20 12:18:58,002 INFO L87 Difference]: Start difference. First operand 1201 states and 2038 transitions. Second operand has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 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-20 12:18:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:59,423 INFO L93 Difference]: Finished difference Result 3210 states and 4685 transitions. [2023-12-20 12:18:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-20 12:18:59,424 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 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 55 [2023-12-20 12:18:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:59,428 INFO L225 Difference]: With dead ends: 3210 [2023-12-20 12:18:59,428 INFO L226 Difference]: Without dead ends: 2794 [2023-12-20 12:18:59,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=504, Invalid=2148, Unknown=0, NotChecked=0, Total=2652 [2023-12-20 12:18:59,434 INFO L413 NwaCegarLoop]: 1491 mSDtfsCounter, 17132 mSDsluCounter, 6163 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17132 SdHoareTripleChecker+Valid, 7654 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:59,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17132 Valid, 7654 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 12:18:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2023-12-20 12:18:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2612. [2023-12-20 12:18:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2610 states have (on average 1.4624521072796934) internal successors, (3817), 2611 states have internal predecessors, (3817), 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-20 12:18:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 3817 transitions. [2023-12-20 12:18:59,498 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 3817 transitions. Word has length 55 [2023-12-20 12:18:59,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:59,498 INFO L495 AbstractCegarLoop]: Abstraction has 2612 states and 3817 transitions. [2023-12-20 12:18:59,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 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-20 12:18:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3817 transitions. [2023-12-20 12:18:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-20 12:18:59,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:59,500 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:18:59,507 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-20 12:18:59,705 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,SelfDestructingSolverStorable15 [2023-12-20 12:18:59,705 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:59,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:59,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1880919838, now seen corresponding path program 1 times [2023-12-20 12:18:59,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:59,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171205486] [2023-12-20 12:18:59,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:59,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:00,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:19:00,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171205486] [2023-12-20 12:19:00,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171205486] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:19:00,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328742040] [2023-12-20 12:19:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:00,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:19:00,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:19:00,038 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-20 12:19:00,057 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-20 12:19:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:00,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 12:19:00,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:19:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:00,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:19:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:01,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328742040] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:19:01,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:19:01,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 28 [2023-12-20 12:19:01,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404267423] [2023-12-20 12:19:01,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:19:01,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-20 12:19:01,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:19:01,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-20 12:19:01,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2023-12-20 12:19:01,174 INFO L87 Difference]: Start difference. First operand 2612 states and 3817 transitions. Second operand has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 28 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:19:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:19:01,664 INFO L93 Difference]: Finished difference Result 4798 states and 6605 transitions. [2023-12-20 12:19:01,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-20 12:19:01,664 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 28 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2023-12-20 12:19:01,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:19:01,668 INFO L225 Difference]: With dead ends: 4798 [2023-12-20 12:19:01,668 INFO L226 Difference]: Without dead ends: 3271 [2023-12-20 12:19:01,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2023-12-20 12:19:01,670 INFO L413 NwaCegarLoop]: 1485 mSDtfsCounter, 9147 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9147 SdHoareTripleChecker+Valid, 6104 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 12:19:01,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9147 Valid, 6104 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 12:19:01,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2023-12-20 12:19:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 3117. [2023-12-20 12:19:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3117 states, 3115 states have (on average 1.4314606741573033) internal successors, (4459), 3116 states have internal predecessors, (4459), 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-20 12:19:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4459 transitions. [2023-12-20 12:19:01,749 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4459 transitions. Word has length 56 [2023-12-20 12:19:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:19:01,750 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 4459 transitions. [2023-12-20 12:19:01,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 28 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:19:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4459 transitions. [2023-12-20 12:19:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-20 12:19:01,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:19:01,750 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:19:01,770 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-20 12:19:01,955 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,SelfDestructingSolverStorable16 [2023-12-20 12:19:01,955 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:19:01,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:19:01,956 INFO L85 PathProgramCache]: Analyzing trace with hash 444638178, now seen corresponding path program 1 times [2023-12-20 12:19:01,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:19:01,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480457218] [2023-12-20 12:19:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:01,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:19:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:19:02,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480457218] [2023-12-20 12:19:02,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480457218] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:19:02,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794557017] [2023-12-20 12:19:02,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:02,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:19:02,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:19:02,173 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-20 12:19:02,219 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-20 12:19:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:02,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 12:19:02,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:19:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:02,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:19:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:03,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794557017] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:19:03,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:19:03,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29 [2023-12-20 12:19:03,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057282963] [2023-12-20 12:19:03,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:19:03,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-20 12:19:03,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:19:03,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-20 12:19:03,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2023-12-20 12:19:03,309 INFO L87 Difference]: Start difference. First operand 3117 states and 4459 transitions. Second operand has 29 states, 29 states have (on average 4.827586206896552) internal successors, (140), 29 states have internal predecessors, (140), 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-20 12:19:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:19:04,151 INFO L93 Difference]: Finished difference Result 6681 states and 9005 transitions. [2023-12-20 12:19:04,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-20 12:19:04,151 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.827586206896552) internal successors, (140), 29 states have internal predecessors, (140), 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 56 [2023-12-20 12:19:04,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:19:04,157 INFO L225 Difference]: With dead ends: 6681 [2023-12-20 12:19:04,157 INFO L226 Difference]: Without dead ends: 4659 [2023-12-20 12:19:04,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=606, Invalid=1944, Unknown=0, NotChecked=0, Total=2550 [2023-12-20 12:19:04,160 INFO L413 NwaCegarLoop]: 1493 mSDtfsCounter, 10747 mSDsluCounter, 7745 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10747 SdHoareTripleChecker+Valid, 9238 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 12:19:04,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10747 Valid, 9238 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 12:19:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2023-12-20 12:19:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 3153. [2023-12-20 12:19:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3153 states, 3151 states have (on average 1.4224055855284037) internal successors, (4482), 3152 states have internal predecessors, (4482), 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-20 12:19:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 3153 states and 4482 transitions. [2023-12-20 12:19:04,300 INFO L78 Accepts]: Start accepts. Automaton has 3153 states and 4482 transitions. Word has length 56 [2023-12-20 12:19:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:19:04,300 INFO L495 AbstractCegarLoop]: Abstraction has 3153 states and 4482 transitions. [2023-12-20 12:19:04,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.827586206896552) internal successors, (140), 29 states have internal predecessors, (140), 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-20 12:19:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3153 states and 4482 transitions. [2023-12-20 12:19:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-20 12:19:04,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:19:04,302 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:19:04,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-20 12:19:04,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-20 12:19:04,507 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:19:04,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:19:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1673533154, now seen corresponding path program 1 times [2023-12-20 12:19:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:19:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692435989] [2023-12-20 12:19:04,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:19:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:04,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:19:04,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692435989] [2023-12-20 12:19:04,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692435989] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:19:04,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957581995] [2023-12-20 12:19:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:04,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:19:04,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:19:04,705 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-20 12:19:04,748 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-20 12:19:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:04,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 12:19:04,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:19:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:05,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:19:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:05,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957581995] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:19:05,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:19:05,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29 [2023-12-20 12:19:05,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689509383] [2023-12-20 12:19:05,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:19:05,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-20 12:19:05,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:19:05,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-20 12:19:05,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2023-12-20 12:19:05,730 INFO L87 Difference]: Start difference. First operand 3153 states and 4482 transitions. Second operand has 29 states, 29 states have (on average 5.241379310344827) internal successors, (152), 29 states have internal predecessors, (152), 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-20 12:19:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:19:06,324 INFO L93 Difference]: Finished difference Result 7668 states and 10192 transitions. [2023-12-20 12:19:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-20 12:19:06,325 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.241379310344827) internal successors, (152), 29 states have internal predecessors, (152), 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 56 [2023-12-20 12:19:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:19:06,333 INFO L225 Difference]: With dead ends: 7668 [2023-12-20 12:19:06,333 INFO L226 Difference]: Without dead ends: 5793 [2023-12-20 12:19:06,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=480, Invalid=1412, Unknown=0, NotChecked=0, Total=1892 [2023-12-20 12:19:06,336 INFO L413 NwaCegarLoop]: 1484 mSDtfsCounter, 7549 mSDsluCounter, 4658 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7549 SdHoareTripleChecker+Valid, 6142 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 12:19:06,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7549 Valid, 6142 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 12:19:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states. [2023-12-20 12:19:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5793 to 5403. [2023-12-20 12:19:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5403 states, 5401 states have (on average 1.3417885576745048) internal successors, (7247), 5402 states have internal predecessors, (7247), 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-20 12:19:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 7247 transitions. [2023-12-20 12:19:06,448 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 7247 transitions. Word has length 56 [2023-12-20 12:19:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:19:06,448 INFO L495 AbstractCegarLoop]: Abstraction has 5403 states and 7247 transitions. [2023-12-20 12:19:06,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.241379310344827) internal successors, (152), 29 states have internal predecessors, (152), 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-20 12:19:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 7247 transitions. [2023-12-20 12:19:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-20 12:19:06,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:19:06,449 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:19:06,453 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-20 12:19:06,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:19:06,653 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:19:06,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:19:06,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1226562386, now seen corresponding path program 1 times [2023-12-20 12:19:06,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:19:06,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686021452] [2023-12-20 12:19:06,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:06,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:19:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:07,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:19:07,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686021452] [2023-12-20 12:19:07,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686021452] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:19:07,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201714562] [2023-12-20 12:19:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:07,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:19:07,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:19:07,263 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-20 12:19:07,263 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-20 12:19:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:07,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-20 12:19:07,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:19:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:08,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:19:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:11,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201714562] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:19:11,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:19:11,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 22] total 49 [2023-12-20 12:19:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757640767] [2023-12-20 12:19:11,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:19:11,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-20 12:19:11,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:19:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-20 12:19:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1982, Unknown=0, NotChecked=0, Total=2352 [2023-12-20 12:19:11,333 INFO L87 Difference]: Start difference. First operand 5403 states and 7247 transitions. Second operand has 49 states, 49 states have (on average 3.183673469387755) internal successors, (156), 49 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-20 12:19:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:19:37,083 INFO L93 Difference]: Finished difference Result 10701 states and 13861 transitions. [2023-12-20 12:19:37,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2023-12-20 12:19:37,084 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.183673469387755) internal successors, (156), 49 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-20 12:19:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:19:37,093 INFO L225 Difference]: With dead ends: 10701 [2023-12-20 12:19:37,093 INFO L226 Difference]: Without dead ends: 6557 [2023-12-20 12:19:37,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9267 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=5230, Invalid=20530, Unknown=0, NotChecked=0, Total=25760 [2023-12-20 12:19:37,101 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 16440 mSDsluCounter, 16712 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16440 SdHoareTripleChecker+Valid, 18185 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-20 12:19:37,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16440 Valid, 18185 Invalid, 1664 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [139 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-20 12:19:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2023-12-20 12:19:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 3607. [2023-12-20 12:19:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3607 states, 3605 states have (on average 1.3933425797503467) internal successors, (5023), 3606 states have internal predecessors, (5023), 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-20 12:19:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 5023 transitions. [2023-12-20 12:19:37,308 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 5023 transitions. Word has length 57 [2023-12-20 12:19:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:19:37,308 INFO L495 AbstractCegarLoop]: Abstraction has 3607 states and 5023 transitions. [2023-12-20 12:19:37,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.183673469387755) internal successors, (156), 49 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-20 12:19:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 5023 transitions. [2023-12-20 12:19:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-20 12:19:37,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:19:37,309 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:19:37,313 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-20 12:19:37,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:19:37,514 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:19:37,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:19:37,514 INFO L85 PathProgramCache]: Analyzing trace with hash -305078432, now seen corresponding path program 1 times [2023-12-20 12:19:37,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:19:37,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754156856] [2023-12-20 12:19:37,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:37,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:19:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:37,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:19:37,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754156856] [2023-12-20 12:19:37,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754156856] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:19:37,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779226013] [2023-12-20 12:19:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:37,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:19:37,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:19:37,882 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:19:37,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 12:19:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:38,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-20 12:19:38,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:19:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:38,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:19:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:39,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779226013] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:19:39,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:19:39,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2023-12-20 12:19:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909699065] [2023-12-20 12:19:39,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:19:39,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-20 12:19:39,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:19:39,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-20 12:19:39,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2023-12-20 12:19:39,224 INFO L87 Difference]: Start difference. First operand 3607 states and 5023 transitions. Second operand has 32 states, 32 states have (on average 4.5) internal successors, (144), 32 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:19:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:19:41,091 INFO L93 Difference]: Finished difference Result 9843 states and 12953 transitions. [2023-12-20 12:19:41,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-20 12:19:41,092 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.5) internal successors, (144), 32 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-12-20 12:19:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:19:41,103 INFO L225 Difference]: With dead ends: 9843 [2023-12-20 12:19:41,103 INFO L226 Difference]: Without dead ends: 8589 [2023-12-20 12:19:41,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=665, Invalid=3117, Unknown=0, NotChecked=0, Total=3782 [2023-12-20 12:19:41,107 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 12546 mSDsluCounter, 13460 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12546 SdHoareTripleChecker+Valid, 14933 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 12:19:41,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12546 Valid, 14933 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 12:19:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8589 states. [2023-12-20 12:19:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8589 to 3404. [2023-12-20 12:19:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3404 states, 3402 states have (on average 1.403586125808348) internal successors, (4775), 3403 states have internal predecessors, (4775), 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-20 12:19:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4775 transitions. [2023-12-20 12:19:41,241 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4775 transitions. Word has length 59 [2023-12-20 12:19:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:19:41,241 INFO L495 AbstractCegarLoop]: Abstraction has 3404 states and 4775 transitions. [2023-12-20 12:19:41,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.5) internal successors, (144), 32 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:19:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4775 transitions. [2023-12-20 12:19:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-20 12:19:41,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:19:41,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:19:41,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-20 12:19:41,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:19:41,447 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:19:41,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:19:41,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2096123822, now seen corresponding path program 1 times [2023-12-20 12:19:41,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:19:41,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284523077] [2023-12-20 12:19:41,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:19:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:41,539 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-20 12:19:41,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:19:41,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284523077] [2023-12-20 12:19:41,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284523077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:19:41,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:19:41,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:19:41,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417839154] [2023-12-20 12:19:41,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:19:41,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:19:41,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:19:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:19:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:19:41,540 INFO L87 Difference]: Start difference. First operand 3404 states and 4775 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:19:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:19:46,601 INFO L93 Difference]: Finished difference Result 5659 states and 9084 transitions. [2023-12-20 12:19:46,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 12:19:46,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2023-12-20 12:19:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:19:46,609 INFO L225 Difference]: With dead ends: 5659 [2023-12-20 12:19:46,609 INFO L226 Difference]: Without dead ends: 4906 [2023-12-20 12:19:46,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:19:46,614 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 2312 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5357 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 6510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-20 12:19:46,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2312 Valid, 756 Invalid, 6510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5357 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-20 12:19:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2023-12-20 12:19:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 4906. [2023-12-20 12:19:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4906 states, 4904 states have (on average 1.4047716150081566) internal successors, (6889), 4905 states have internal predecessors, (6889), 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-20 12:19:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 6889 transitions. [2023-12-20 12:19:46,813 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 6889 transitions. Word has length 66 [2023-12-20 12:19:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:19:46,813 INFO L495 AbstractCegarLoop]: Abstraction has 4906 states and 6889 transitions. [2023-12-20 12:19:46,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:19:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 6889 transitions. [2023-12-20 12:19:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-20 12:19:46,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:19:46,814 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:19:46,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-20 12:19:46,815 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:19:46,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:19:46,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1595721674, now seen corresponding path program 1 times [2023-12-20 12:19:46,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:19:46,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575652854] [2023-12-20 12:19:46,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:46,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:19:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:47,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:19:47,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575652854] [2023-12-20 12:19:47,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575652854] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:19:47,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323747860] [2023-12-20 12:19:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:47,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:19:47,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:19:47,499 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:19:47,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 12:19:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:47,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-20 12:19:47,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:19:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:48,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:19:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:19:50,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323747860] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:19:50,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:19:50,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 50 [2023-12-20 12:19:50,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506131075] [2023-12-20 12:19:50,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:19:50,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-20 12:19:50,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:19:50,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-20 12:19:50,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2256, Unknown=0, NotChecked=0, Total=2450 [2023-12-20 12:19:50,644 INFO L87 Difference]: Start difference. First operand 4906 states and 6889 transitions. Second operand has 50 states, 50 states have (on average 5.24) internal successors, (262), 50 states have internal predecessors, (262), 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-20 12:20:17,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:20:17,892 INFO L93 Difference]: Finished difference Result 8484 states and 11305 transitions. [2023-12-20 12:20:17,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2023-12-20 12:20:17,892 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.24) internal successors, (262), 50 states have internal predecessors, (262), 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 93 [2023-12-20 12:20:17,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:20:17,903 INFO L225 Difference]: With dead ends: 8484 [2023-12-20 12:20:17,903 INFO L226 Difference]: Without dead ends: 7426 [2023-12-20 12:20:17,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12776 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=5590, Invalid=34610, Unknown=0, NotChecked=0, Total=40200 [2023-12-20 12:20:17,909 INFO L413 NwaCegarLoop]: 1533 mSDtfsCounter, 26238 mSDsluCounter, 30935 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26238 SdHoareTripleChecker+Valid, 32468 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-20 12:20:17,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26238 Valid, 32468 Invalid, 2873 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [238 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-20 12:20:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2023-12-20 12:20:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 4273. [2023-12-20 12:20:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4273 states, 4271 states have (on average 1.4162959494263638) internal successors, (6049), 4272 states have internal predecessors, (6049), 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-20 12:20:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 6049 transitions. [2023-12-20 12:20:18,057 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 6049 transitions. Word has length 93 [2023-12-20 12:20:18,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:20:18,057 INFO L495 AbstractCegarLoop]: Abstraction has 4273 states and 6049 transitions. [2023-12-20 12:20:18,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.24) internal successors, (262), 50 states have internal predecessors, (262), 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-20 12:20:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 6049 transitions. [2023-12-20 12:20:18,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-20 12:20:18,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:20:18,059 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:20:18,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-20 12:20:18,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:20:18,265 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:20:18,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:20:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash 718276290, now seen corresponding path program 1 times [2023-12-20 12:20:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:20:18,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024498229] [2023-12-20 12:20:18,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:20:18,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:20:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:20:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 28 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:20:18,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:20:18,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024498229] [2023-12-20 12:20:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024498229] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:20:18,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273159612] [2023-12-20 12:20:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:20:18,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:20:18,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:20:18,671 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:20:18,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 12:20:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:20:18,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-20 12:20:18,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:20:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:20:19,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:20:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:20:22,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273159612] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:20:22,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:20:22,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 17] total 45 [2023-12-20 12:20:22,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655330809] [2023-12-20 12:20:22,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:20:22,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-20 12:20:22,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:20:22,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-20 12:20:22,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1799, Unknown=0, NotChecked=0, Total=1980 [2023-12-20 12:20:22,236 INFO L87 Difference]: Start difference. First operand 4273 states and 6049 transitions. Second operand has 45 states, 45 states have (on average 5.6) internal successors, (252), 45 states have internal predecessors, (252), 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-20 12:21:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:21:01,067 INFO L93 Difference]: Finished difference Result 23997 states and 30337 transitions. [2023-12-20 12:21:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2023-12-20 12:21:01,068 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 5.6) internal successors, (252), 45 states have internal predecessors, (252), 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 94 [2023-12-20 12:21:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:21:01,087 INFO L225 Difference]: With dead ends: 23997 [2023-12-20 12:21:01,088 INFO L226 Difference]: Without dead ends: 22198 [2023-12-20 12:21:01,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27847 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=10667, Invalid=64683, Unknown=0, NotChecked=0, Total=75350 [2023-12-20 12:21:01,095 INFO L413 NwaCegarLoop]: 1530 mSDtfsCounter, 23881 mSDsluCounter, 28193 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23881 SdHoareTripleChecker+Valid, 29723 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-20 12:21:01,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23881 Valid, 29723 Invalid, 2920 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [204 Valid, 2716 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-20 12:21:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22198 states. [2023-12-20 12:21:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22198 to 16956. [2023-12-20 12:21:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16956 states, 16954 states have (on average 1.2675474814203138) internal successors, (21490), 16955 states have internal predecessors, (21490), 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-20 12:21:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16956 states to 16956 states and 21490 transitions. [2023-12-20 12:21:02,334 INFO L78 Accepts]: Start accepts. Automaton has 16956 states and 21490 transitions. Word has length 94 [2023-12-20 12:21:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:21:02,334 INFO L495 AbstractCegarLoop]: Abstraction has 16956 states and 21490 transitions. [2023-12-20 12:21:02,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 5.6) internal successors, (252), 45 states have internal predecessors, (252), 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-20 12:21:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 16956 states and 21490 transitions. [2023-12-20 12:21:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-20 12:21:02,337 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:21:02,337 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2023-12-20 12:21:02,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-20 12:21:02,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-20 12:21:02,542 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:21:02,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:21:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1818613630, now seen corresponding path program 1 times [2023-12-20 12:21:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:21:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110816507] [2023-12-20 12:21:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:21:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 19 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:21:03,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:21:03,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110816507] [2023-12-20 12:21:03,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110816507] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:21:03,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382816727] [2023-12-20 12:21:03,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:03,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:21:03,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:21:03,287 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:21:03,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 12:21:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:03,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-20 12:21:03,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:21:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-20 12:21:05,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:21:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 12:21:07,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382816727] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:21:07,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:21:07,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 22] total 58 [2023-12-20 12:21:07,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263893006] [2023-12-20 12:21:07,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:21:07,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-20 12:21:07,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:21:07,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-20 12:21:07,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3050, Unknown=0, NotChecked=0, Total=3306 [2023-12-20 12:21:07,270 INFO L87 Difference]: Start difference. First operand 16956 states and 21490 transitions. Second operand has 58 states, 58 states have (on average 4.051724137931035) internal successors, (235), 58 states have internal predecessors, (235), 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-20 12:21:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:21:19,144 INFO L93 Difference]: Finished difference Result 26279 states and 32713 transitions. [2023-12-20 12:21:19,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-12-20 12:21:19,145 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 4.051724137931035) internal successors, (235), 58 states have internal predecessors, (235), 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 95 [2023-12-20 12:21:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:21:19,162 INFO L225 Difference]: With dead ends: 26279 [2023-12-20 12:21:19,162 INFO L226 Difference]: Without dead ends: 20818 [2023-12-20 12:21:19,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4138 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2505, Invalid=14525, Unknown=0, NotChecked=0, Total=17030 [2023-12-20 12:21:19,169 INFO L413 NwaCegarLoop]: 1511 mSDtfsCounter, 28292 mSDsluCounter, 33665 mSDsCounter, 0 mSdLazyCounter, 3160 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28292 SdHoareTripleChecker+Valid, 35176 SdHoareTripleChecker+Invalid, 3253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-20 12:21:19,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28292 Valid, 35176 Invalid, 3253 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [93 Valid, 3160 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-20 12:21:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20818 states. [2023-12-20 12:21:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20818 to 19506. [2023-12-20 12:21:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19506 states, 19504 states have (on average 1.2605619360131255) internal successors, (24586), 19505 states have internal predecessors, (24586), 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-20 12:21:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19506 states to 19506 states and 24586 transitions. [2023-12-20 12:21:20,682 INFO L78 Accepts]: Start accepts. Automaton has 19506 states and 24586 transitions. Word has length 95 [2023-12-20 12:21:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:21:20,682 INFO L495 AbstractCegarLoop]: Abstraction has 19506 states and 24586 transitions. [2023-12-20 12:21:20,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 4.051724137931035) internal successors, (235), 58 states have internal predecessors, (235), 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-20 12:21:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 19506 states and 24586 transitions. [2023-12-20 12:21:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-20 12:21:20,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:21:20,684 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:21:20,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-20 12:21:20,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-20 12:21:20,890 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:21:20,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:21:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1090077478, now seen corresponding path program 1 times [2023-12-20 12:21:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:21:20,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087481] [2023-12-20 12:21:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:20,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:21:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:21:21,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:21:21,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087481] [2023-12-20 12:21:21,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087481] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:21:21,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466492347] [2023-12-20 12:21:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:21,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:21:21,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:21:21,354 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:21:21,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 12:21:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:21,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-20 12:21:21,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:21:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 21 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:21:22,147 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:21:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:21:23,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466492347] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:21:23,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:21:23,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-12-20 12:21:23,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103617934] [2023-12-20 12:21:23,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:21:23,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-20 12:21:23,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:21:23,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-20 12:21:23,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2023-12-20 12:21:23,212 INFO L87 Difference]: Start difference. First operand 19506 states and 24586 transitions. Second operand has 26 states, 26 states have (on average 8.153846153846153) internal successors, (212), 25 states have internal predecessors, (212), 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-20 12:21:25,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:21:25,239 INFO L93 Difference]: Finished difference Result 27876 states and 34923 transitions. [2023-12-20 12:21:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-20 12:21:25,240 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.153846153846153) internal successors, (212), 25 states have internal predecessors, (212), 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 95 [2023-12-20 12:21:25,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:21:25,258 INFO L225 Difference]: With dead ends: 27876 [2023-12-20 12:21:25,259 INFO L226 Difference]: Without dead ends: 19736 [2023-12-20 12:21:25,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=399, Invalid=1323, Unknown=0, NotChecked=0, Total=1722 [2023-12-20 12:21:25,267 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 13315 mSDsluCounter, 9080 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13315 SdHoareTripleChecker+Valid, 10580 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 12:21:25,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13315 Valid, 10580 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 12:21:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19736 states. [2023-12-20 12:21:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19736 to 19506. [2023-12-20 12:21:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19506 states, 19504 states have (on average 1.253281378178835) internal successors, (24444), 19505 states have internal predecessors, (24444), 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-20 12:21:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19506 states to 19506 states and 24444 transitions. [2023-12-20 12:21:26,873 INFO L78 Accepts]: Start accepts. Automaton has 19506 states and 24444 transitions. Word has length 95 [2023-12-20 12:21:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:21:26,875 INFO L495 AbstractCegarLoop]: Abstraction has 19506 states and 24444 transitions. [2023-12-20 12:21:26,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.153846153846153) internal successors, (212), 25 states have internal predecessors, (212), 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-20 12:21:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 19506 states and 24444 transitions. [2023-12-20 12:21:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-20 12:21:26,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:21:26,893 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-12-20 12:21:26,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-20 12:21:27,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-20 12:21:27,104 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:21:27,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:21:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash -855775142, now seen corresponding path program 1 times [2023-12-20 12:21:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:21:27,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756227579] [2023-12-20 12:21:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:21:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 28 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:21:27,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:21:27,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756227579] [2023-12-20 12:21:27,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756227579] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:21:27,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628470196] [2023-12-20 12:21:27,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:27,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:21:27,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:21:27,563 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:21:27,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-20 12:21:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:27,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-20 12:21:27,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:21:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 44 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:21:28,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:21:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 44 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:21:29,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628470196] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:21:29,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:21:29,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2023-12-20 12:21:29,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191424989] [2023-12-20 12:21:29,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:21:29,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-20 12:21:29,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:21:29,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-20 12:21:29,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2023-12-20 12:21:29,235 INFO L87 Difference]: Start difference. First operand 19506 states and 24444 transitions. Second operand has 29 states, 29 states have (on average 7.862068965517241) internal successors, (228), 29 states have internal predecessors, (228), 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-20 12:21:33,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:21:33,342 INFO L93 Difference]: Finished difference Result 38130 states and 47060 transitions. [2023-12-20 12:21:33,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-20 12:21:33,343 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.862068965517241) internal successors, (228), 29 states have internal predecessors, (228), 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 95 [2023-12-20 12:21:33,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:21:33,361 INFO L225 Difference]: With dead ends: 38130 [2023-12-20 12:21:33,362 INFO L226 Difference]: Without dead ends: 21732 [2023-12-20 12:21:33,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=908, Invalid=3784, Unknown=0, NotChecked=0, Total=4692 [2023-12-20 12:21:33,418 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 18131 mSDsluCounter, 9404 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18131 SdHoareTripleChecker+Valid, 10922 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 12:21:33,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18131 Valid, 10922 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 12:21:33,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21732 states. [2023-12-20 12:21:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21732 to 12078. [2023-12-20 12:21:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12078 states, 12076 states have (on average 1.2753395163961576) internal successors, (15401), 12077 states have internal predecessors, (15401), 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-20 12:21:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12078 states to 12078 states and 15401 transitions. [2023-12-20 12:21:34,375 INFO L78 Accepts]: Start accepts. Automaton has 12078 states and 15401 transitions. Word has length 95 [2023-12-20 12:21:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:21:34,376 INFO L495 AbstractCegarLoop]: Abstraction has 12078 states and 15401 transitions. [2023-12-20 12:21:34,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.862068965517241) internal successors, (228), 29 states have internal predecessors, (228), 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-20 12:21:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 12078 states and 15401 transitions. [2023-12-20 12:21:34,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-20 12:21:34,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:21:34,377 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-12-20 12:21:34,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-20 12:21:34,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-20 12:21:34,583 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:21:34,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:21:34,583 INFO L85 PathProgramCache]: Analyzing trace with hash 624828092, now seen corresponding path program 1 times [2023-12-20 12:21:34,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:21:34,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220851251] [2023-12-20 12:21:34,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:34,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:21:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 23 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:21:35,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:21:35,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220851251] [2023-12-20 12:21:35,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220851251] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:21:35,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939678092] [2023-12-20 12:21:35,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:35,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:21:35,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:21:35,758 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:21:35,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-20 12:21:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:35,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-20 12:21:35,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:21:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:21:37,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:21:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:21:40,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939678092] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:21:40,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:21:40,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 19] total 63 [2023-12-20 12:21:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876077258] [2023-12-20 12:21:40,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:21:40,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-12-20 12:21:40,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:21:40,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-12-20 12:21:40,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3679, Unknown=0, NotChecked=0, Total=3906 [2023-12-20 12:21:40,083 INFO L87 Difference]: Start difference. First operand 12078 states and 15401 transitions. Second operand has 63 states, 63 states have (on average 4.253968253968254) internal successors, (268), 63 states have internal predecessors, (268), 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-20 12:22:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:22:13,493 INFO L93 Difference]: Finished difference Result 23239 states and 28961 transitions. [2023-12-20 12:22:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2023-12-20 12:22:13,493 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.253968253968254) internal successors, (268), 63 states have internal predecessors, (268), 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 95 [2023-12-20 12:22:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:22:13,511 INFO L225 Difference]: With dead ends: 23239 [2023-12-20 12:22:13,511 INFO L226 Difference]: Without dead ends: 18660 [2023-12-20 12:22:13,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15817 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=6514, Invalid=45242, Unknown=0, NotChecked=0, Total=51756 [2023-12-20 12:22:13,518 INFO L413 NwaCegarLoop]: 1546 mSDtfsCounter, 17230 mSDsluCounter, 46200 mSDsCounter, 0 mSdLazyCounter, 4231 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17230 SdHoareTripleChecker+Valid, 47746 SdHoareTripleChecker+Invalid, 4497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 4231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:22:13,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17230 Valid, 47746 Invalid, 4497 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [266 Valid, 4231 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-20 12:22:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18660 states. [2023-12-20 12:22:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18660 to 12378. [2023-12-20 12:22:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12378 states, 12376 states have (on average 1.2689883645765998) internal successors, (15705), 12377 states have internal predecessors, (15705), 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-20 12:22:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12378 states to 12378 states and 15705 transitions. [2023-12-20 12:22:14,747 INFO L78 Accepts]: Start accepts. Automaton has 12378 states and 15705 transitions. Word has length 95 [2023-12-20 12:22:14,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:22:14,747 INFO L495 AbstractCegarLoop]: Abstraction has 12378 states and 15705 transitions. [2023-12-20 12:22:14,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.253968253968254) internal successors, (268), 63 states have internal predecessors, (268), 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-20 12:22:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 12378 states and 15705 transitions. [2023-12-20 12:22:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-20 12:22:14,749 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:22:14,749 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2023-12-20 12:22:14,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-20 12:22:14,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-20 12:22:14,954 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:22:14,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:22:14,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1455711360, now seen corresponding path program 1 times [2023-12-20 12:22:14,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:22:14,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82792550] [2023-12-20 12:22:14,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:22:14,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:22:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:22:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 32 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:22:15,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:22:15,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82792550] [2023-12-20 12:22:15,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82792550] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:22:15,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463129482] [2023-12-20 12:22:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:22:15,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:22:15,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:22:15,485 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:22:15,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-20 12:22:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:22:15,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 12:22:15,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:22:16,330 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 42 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:22:16,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:22:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 35 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:22:17,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463129482] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:22:17,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:22:17,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 44 [2023-12-20 12:22:17,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712851321] [2023-12-20 12:22:17,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:22:17,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-20 12:22:17,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:22:17,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-20 12:22:17,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2023-12-20 12:22:17,711 INFO L87 Difference]: Start difference. First operand 12378 states and 15705 transitions. Second operand has 44 states, 44 states have (on average 5.954545454545454) internal successors, (262), 44 states have internal predecessors, (262), 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-20 12:22:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:22:22,148 INFO L93 Difference]: Finished difference Result 23298 states and 28886 transitions. [2023-12-20 12:22:22,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-12-20 12:22:22,149 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 5.954545454545454) internal successors, (262), 44 states have internal predecessors, (262), 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 96 [2023-12-20 12:22:22,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:22:22,160 INFO L225 Difference]: With dead ends: 23298 [2023-12-20 12:22:22,160 INFO L226 Difference]: Without dead ends: 14481 [2023-12-20 12:22:22,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1702, Invalid=8600, Unknown=0, NotChecked=0, Total=10302 [2023-12-20 12:22:22,168 INFO L413 NwaCegarLoop]: 1549 mSDtfsCounter, 17636 mSDsluCounter, 27928 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17636 SdHoareTripleChecker+Valid, 29477 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 12:22:22,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17636 Valid, 29477 Invalid, 1341 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [111 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 12:22:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14481 states. [2023-12-20 12:22:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14481 to 10669. [2023-12-20 12:22:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10667 states have (on average 1.2739289397206337) internal successors, (13589), 10668 states have internal predecessors, (13589), 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-20 12:22:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 13589 transitions. [2023-12-20 12:22:23,198 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 13589 transitions. Word has length 96 [2023-12-20 12:22:23,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:22:23,198 INFO L495 AbstractCegarLoop]: Abstraction has 10669 states and 13589 transitions. [2023-12-20 12:22:23,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.954545454545454) internal successors, (262), 44 states have internal predecessors, (262), 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-20 12:22:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 13589 transitions. [2023-12-20 12:22:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-20 12:22:23,200 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:22:23,200 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-12-20 12:22:23,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-20 12:22:23,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-20 12:22:23,406 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:22:23,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:22:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash -350540742, now seen corresponding path program 1 times [2023-12-20 12:22:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:22:23,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301933419] [2023-12-20 12:22:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:22:23,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:22:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:22:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:22:24,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:22:24,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301933419] [2023-12-20 12:22:24,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301933419] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:22:24,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218501349] [2023-12-20 12:22:24,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:22:24,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:22:24,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:22:24,122 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:22:24,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-20 12:22:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:22:24,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-20 12:22:24,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:22:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:22:25,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:22:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:22:39,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218501349] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:22:39,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:22:39,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26, 25] total 68 [2023-12-20 12:22:39,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216071297] [2023-12-20 12:22:39,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:22:39,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-12-20 12:22:39,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:22:39,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-12-20 12:22:39,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=4172, Unknown=0, NotChecked=0, Total=4556 [2023-12-20 12:22:39,123 INFO L87 Difference]: Start difference. First operand 10669 states and 13589 transitions. Second operand has 68 states, 68 states have (on average 3.8970588235294117) internal successors, (265), 68 states have internal predecessors, (265), 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-20 12:23:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:23:40,320 INFO L93 Difference]: Finished difference Result 23000 states and 28328 transitions. [2023-12-20 12:23:40,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 326 states. [2023-12-20 12:23:40,321 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.8970588235294117) internal successors, (265), 68 states have internal predecessors, (265), 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 97 [2023-12-20 12:23:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:23:40,336 INFO L225 Difference]: With dead ends: 23000 [2023-12-20 12:23:40,336 INFO L226 Difference]: Without dead ends: 18030 [2023-12-20 12:23:40,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57002 ImplicationChecksByTransitivity, 57.6s TimeCoverageRelationStatistics Valid=17711, Invalid=132445, Unknown=0, NotChecked=0, Total=150156 [2023-12-20 12:23:40,345 INFO L413 NwaCegarLoop]: 1601 mSDtfsCounter, 34420 mSDsluCounter, 32052 mSDsCounter, 0 mSdLazyCounter, 5807 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34420 SdHoareTripleChecker+Valid, 33653 SdHoareTripleChecker+Invalid, 6013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 5807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-20 12:23:40,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34420 Valid, 33653 Invalid, 6013 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [206 Valid, 5807 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-20 12:23:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18030 states. [2023-12-20 12:23:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18030 to 14747. [2023-12-20 12:23:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14747 states, 14745 states have (on average 1.2542556798914886) internal successors, (18494), 14746 states have internal predecessors, (18494), 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-20 12:23:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14747 states to 14747 states and 18494 transitions. [2023-12-20 12:23:41,952 INFO L78 Accepts]: Start accepts. Automaton has 14747 states and 18494 transitions. Word has length 97 [2023-12-20 12:23:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:23:41,953 INFO L495 AbstractCegarLoop]: Abstraction has 14747 states and 18494 transitions. [2023-12-20 12:23:41,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.8970588235294117) internal successors, (265), 68 states have internal predecessors, (265), 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-20 12:23:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 14747 states and 18494 transitions. [2023-12-20 12:23:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-20 12:23:41,963 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:23:41,963 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-12-20 12:23:41,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-20 12:23:42,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:23:42,168 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:23:42,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:23:42,169 INFO L85 PathProgramCache]: Analyzing trace with hash 282527686, now seen corresponding path program 1 times [2023-12-20 12:23:42,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:23:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873150209] [2023-12-20 12:23:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:23:42,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:23:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:23:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 19 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:23:43,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:23:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873150209] [2023-12-20 12:23:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873150209] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:23:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367407590] [2023-12-20 12:23:43,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:23:43,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:23:43,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:23:43,048 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:23:43,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-20 12:23:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:23:43,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-20 12:23:43,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:23:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 20 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:23:46,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:23:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 19 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:23:52,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367407590] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:23:52,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:23:52,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29, 30] total 78 [2023-12-20 12:23:52,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995426081] [2023-12-20 12:23:52,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:23:52,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-12-20 12:23:52,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:23:52,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-12-20 12:23:52,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=5429, Unknown=0, NotChecked=0, Total=6006 [2023-12-20 12:23:52,432 INFO L87 Difference]: Start difference. First operand 14747 states and 18494 transitions. Second operand has 78 states, 78 states have (on average 3.5384615384615383) internal successors, (276), 78 states have internal predecessors, (276), 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-20 12:26:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:26:28,281 INFO L93 Difference]: Finished difference Result 27116 states and 33323 transitions. [2023-12-20 12:26:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 331 states. [2023-12-20 12:26:28,282 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 3.5384615384615383) internal successors, (276), 78 states have internal predecessors, (276), 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 98 [2023-12-20 12:26:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:26:28,301 INFO L225 Difference]: With dead ends: 27116 [2023-12-20 12:26:28,301 INFO L226 Difference]: Without dead ends: 24561 [2023-12-20 12:26:28,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64852 ImplicationChecksByTransitivity, 151.6s TimeCoverageRelationStatistics Valid=22046, Invalid=139156, Unknown=0, NotChecked=0, Total=161202 [2023-12-20 12:26:28,311 INFO L413 NwaCegarLoop]: 1553 mSDtfsCounter, 32742 mSDsluCounter, 36179 mSDsCounter, 0 mSdLazyCounter, 4263 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32742 SdHoareTripleChecker+Valid, 37732 SdHoareTripleChecker+Invalid, 4852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 4263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-20 12:26:28,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32742 Valid, 37732 Invalid, 4852 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [589 Valid, 4263 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-20 12:26:28,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24561 states. [2023-12-20 12:26:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24561 to 16132. [2023-12-20 12:26:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16132 states, 16130 states have (on average 1.2493490390576565) internal successors, (20152), 16131 states have internal predecessors, (20152), 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-20 12:26:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 20152 transitions. [2023-12-20 12:26:30,502 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 20152 transitions. Word has length 98 [2023-12-20 12:26:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:26:30,502 INFO L495 AbstractCegarLoop]: Abstraction has 16132 states and 20152 transitions. [2023-12-20 12:26:30,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.5384615384615383) internal successors, (276), 78 states have internal predecessors, (276), 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-20 12:26:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 20152 transitions. [2023-12-20 12:26:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-20 12:26:30,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:26:30,503 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-12-20 12:26:30,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-20 12:26:30,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:26:30,708 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:26:30,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:26:30,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1109689078, now seen corresponding path program 1 times [2023-12-20 12:26:30,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:26:30,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699797505] [2023-12-20 12:26:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:26:30,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:26:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:26:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 38 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:26:31,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:26:31,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699797505] [2023-12-20 12:26:31,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699797505] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:26:31,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157856978] [2023-12-20 12:26:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:26:31,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:26:31,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:26:31,747 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:26:31,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-20 12:26:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:26:31,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-20 12:26:31,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:26:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 39 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:26:34,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:26:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 38 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:26:37,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157856978] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:26:37,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:26:37,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 62 [2023-12-20 12:26:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065480064] [2023-12-20 12:26:37,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:26:37,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-12-20 12:26:37,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:26:37,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-12-20 12:26:37,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=3489, Unknown=0, NotChecked=0, Total=3782 [2023-12-20 12:26:37,213 INFO L87 Difference]: Start difference. First operand 16132 states and 20152 transitions. Second operand has 62 states, 62 states have (on average 4.080645161290323) internal successors, (253), 62 states have internal predecessors, (253), 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-20 12:26:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:26:51,069 INFO L93 Difference]: Finished difference Result 27431 states and 33500 transitions. [2023-12-20 12:26:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2023-12-20 12:26:51,073 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.080645161290323) internal successors, (253), 62 states have internal predecessors, (253), 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 98 [2023-12-20 12:26:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:26:51,092 INFO L225 Difference]: With dead ends: 27431 [2023-12-20 12:26:51,092 INFO L226 Difference]: Without dead ends: 22802 [2023-12-20 12:26:51,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10313 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=3769, Invalid=28811, Unknown=0, NotChecked=0, Total=32580 [2023-12-20 12:26:51,099 INFO L413 NwaCegarLoop]: 1568 mSDtfsCounter, 21982 mSDsluCounter, 30445 mSDsCounter, 0 mSdLazyCounter, 2807 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21982 SdHoareTripleChecker+Valid, 32013 SdHoareTripleChecker+Invalid, 2925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-20 12:26:51,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21982 Valid, 32013 Invalid, 2925 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [118 Valid, 2807 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-20 12:26:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22802 states. [2023-12-20 12:26:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22802 to 17322. [2023-12-20 12:26:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17322 states, 17320 states have (on average 1.246824480369515) internal successors, (21595), 17321 states have internal predecessors, (21595), 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-20 12:26:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17322 states to 17322 states and 21595 transitions. [2023-12-20 12:26:53,631 INFO L78 Accepts]: Start accepts. Automaton has 17322 states and 21595 transitions. Word has length 98 [2023-12-20 12:26:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:26:53,631 INFO L495 AbstractCegarLoop]: Abstraction has 17322 states and 21595 transitions. [2023-12-20 12:26:53,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.080645161290323) internal successors, (253), 62 states have internal predecessors, (253), 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-20 12:26:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 17322 states and 21595 transitions. [2023-12-20 12:26:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-20 12:26:53,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:26:53,647 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:26:53,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-20 12:26:53,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:26:53,852 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:26:53,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:26:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash 235494782, now seen corresponding path program 1 times [2023-12-20 12:26:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:26:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846261424] [2023-12-20 12:26:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:26:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:26:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:26:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 48 proven. 169 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 12:26:54,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:26:54,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846261424] [2023-12-20 12:26:54,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846261424] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:26:54,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189726172] [2023-12-20 12:26:54,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:26:54,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:26:54,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:26:54,527 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:26:54,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-20 12:26:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:26:54,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-20 12:26:54,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:26:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 39 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:26:57,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:27:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 38 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:27:10,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189726172] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:27:10,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:27:10,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 36, 36] total 89 [2023-12-20 12:27:10,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784052527] [2023-12-20 12:27:10,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:27:10,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2023-12-20 12:27:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:27:10,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2023-12-20 12:27:10,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=6844, Unknown=0, NotChecked=0, Total=7832 [2023-12-20 12:27:10,188 INFO L87 Difference]: Start difference. First operand 17322 states and 21595 transitions. Second operand has 89 states, 89 states have (on average 4.213483146067416) internal successors, (375), 89 states have internal predecessors, (375), 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-20 12:28:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:28:12,688 INFO L93 Difference]: Finished difference Result 27720 states and 34021 transitions. [2023-12-20 12:28:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2023-12-20 12:28:12,688 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 4.213483146067416) internal successors, (375), 89 states have internal predecessors, (375), 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 133 [2023-12-20 12:28:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:28:12,707 INFO L225 Difference]: With dead ends: 27720 [2023-12-20 12:28:12,707 INFO L226 Difference]: Without dead ends: 24542 [2023-12-20 12:28:12,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36384 ImplicationChecksByTransitivity, 58.1s TimeCoverageRelationStatistics Valid=12272, Invalid=87900, Unknown=0, NotChecked=0, Total=100172 [2023-12-20 12:28:12,715 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 30970 mSDsluCounter, 37811 mSDsCounter, 0 mSdLazyCounter, 5394 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30970 SdHoareTripleChecker+Valid, 39345 SdHoareTripleChecker+Invalid, 5666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 5394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-12-20 12:28:12,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30970 Valid, 39345 Invalid, 5666 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [272 Valid, 5394 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-12-20 12:28:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24542 states. [2023-12-20 12:28:16,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24542 to 22609. [2023-12-20 12:28:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22609 states, 22607 states have (on average 1.2366523643119387) internal successors, (27957), 22608 states have internal predecessors, (27957), 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-20 12:28:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22609 states to 22609 states and 27957 transitions. [2023-12-20 12:28:16,075 INFO L78 Accepts]: Start accepts. Automaton has 22609 states and 27957 transitions. Word has length 133 [2023-12-20 12:28:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:28:16,075 INFO L495 AbstractCegarLoop]: Abstraction has 22609 states and 27957 transitions. [2023-12-20 12:28:16,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 4.213483146067416) internal successors, (375), 89 states have internal predecessors, (375), 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-20 12:28:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 22609 states and 27957 transitions. [2023-12-20 12:28:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-20 12:28:16,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:28:16,078 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:28:16,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-20 12:28:16,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:28:16,284 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:28:16,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:28:16,284 INFO L85 PathProgramCache]: Analyzing trace with hash 372036368, now seen corresponding path program 1 times [2023-12-20 12:28:16,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:28:16,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78387053] [2023-12-20 12:28:16,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:28:16,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:28:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:28:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 32 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:28:17,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:28:17,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78387053] [2023-12-20 12:28:17,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78387053] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:28:17,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178176790] [2023-12-20 12:28:17,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:28:17,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:28:17,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:28:17,060 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:28:17,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-20 12:28:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:28:17,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-20 12:28:17,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:28:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 32 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:28:18,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:28:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 32 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:28:20,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178176790] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:28:20,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:28:20,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 19] total 57 [2023-12-20 12:28:20,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13749336] [2023-12-20 12:28:20,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:28:20,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-20 12:28:20,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:28:20,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-20 12:28:20,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2897, Unknown=0, NotChecked=0, Total=3192 [2023-12-20 12:28:20,864 INFO L87 Difference]: Start difference. First operand 22609 states and 27957 transitions. Second operand has 57 states, 57 states have (on average 6.315789473684211) internal successors, (360), 57 states have internal predecessors, (360), 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-20 12:28:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:28:37,483 INFO L93 Difference]: Finished difference Result 29732 states and 36505 transitions. [2023-12-20 12:28:37,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2023-12-20 12:28:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 6.315789473684211) internal successors, (360), 57 states have internal predecessors, (360), 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 134 [2023-12-20 12:28:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:28:37,499 INFO L225 Difference]: With dead ends: 29732 [2023-12-20 12:28:37,499 INFO L226 Difference]: Without dead ends: 20003 [2023-12-20 12:28:37,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17507 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=8771, Invalid=45285, Unknown=0, NotChecked=0, Total=54056 [2023-12-20 12:28:37,507 INFO L413 NwaCegarLoop]: 1520 mSDtfsCounter, 28623 mSDsluCounter, 27600 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28623 SdHoareTripleChecker+Valid, 29120 SdHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-20 12:28:37,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28623 Valid, 29120 Invalid, 2498 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [146 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-20 12:28:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20003 states. [2023-12-20 12:28:40,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20003 to 18685. [2023-12-20 12:28:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18685 states, 18683 states have (on average 1.2450891184499278) internal successors, (23262), 18684 states have internal predecessors, (23262), 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-20 12:28:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18685 states to 18685 states and 23262 transitions. [2023-12-20 12:28:40,450 INFO L78 Accepts]: Start accepts. Automaton has 18685 states and 23262 transitions. Word has length 134 [2023-12-20 12:28:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:28:40,450 INFO L495 AbstractCegarLoop]: Abstraction has 18685 states and 23262 transitions. [2023-12-20 12:28:40,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 6.315789473684211) internal successors, (360), 57 states have internal predecessors, (360), 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-20 12:28:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 18685 states and 23262 transitions. [2023-12-20 12:28:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-20 12:28:40,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:28:40,453 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 12:28:40,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-20 12:28:40,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:28:40,659 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:28:40,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:28:40,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1160518112, now seen corresponding path program 1 times [2023-12-20 12:28:40,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:28:40,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487920268] [2023-12-20 12:28:40,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:28:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:28:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:28:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 22 proven. 185 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-20 12:28:40,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:28:40,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487920268] [2023-12-20 12:28:40,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487920268] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:28:40,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289771468] [2023-12-20 12:28:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:28:40,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:28:40,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:28:40,915 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:28:40,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-20 12:28:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:28:41,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 12:28:41,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:28:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 39 proven. 168 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-20 12:28:41,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:28:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 172 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-20 12:28:41,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289771468] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:28:41,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:28:41,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2023-12-20 12:28:41,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482883446] [2023-12-20 12:28:41,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:28:41,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-20 12:28:41,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:28:41,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-20 12:28:41,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-12-20 12:28:41,599 INFO L87 Difference]: Start difference. First operand 18685 states and 23262 transitions. Second operand has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 17 states have internal predecessors, (262), 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-20 12:28:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:28:46,864 INFO L93 Difference]: Finished difference Result 43320 states and 53229 transitions. [2023-12-20 12:28:46,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-20 12:28:46,864 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 17 states have internal predecessors, (262), 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 134 [2023-12-20 12:28:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:28:46,888 INFO L225 Difference]: With dead ends: 43320 [2023-12-20 12:28:46,889 INFO L226 Difference]: Without dead ends: 27531 [2023-12-20 12:28:46,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-12-20 12:28:46,895 INFO L413 NwaCegarLoop]: 1559 mSDtfsCounter, 3152 mSDsluCounter, 10642 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3152 SdHoareTripleChecker+Valid, 12201 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 12:28:46,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3152 Valid, 12201 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 12:28:46,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27531 states. [2023-12-20 12:28:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27531 to 23279. [2023-12-20 12:28:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23279 states, 23277 states have (on average 1.1945267860978648) internal successors, (27805), 23278 states have internal predecessors, (27805), 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-20 12:28:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23279 states to 23279 states and 27805 transitions. [2023-12-20 12:28:50,571 INFO L78 Accepts]: Start accepts. Automaton has 23279 states and 27805 transitions. Word has length 134 [2023-12-20 12:28:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:28:50,571 INFO L495 AbstractCegarLoop]: Abstraction has 23279 states and 27805 transitions. [2023-12-20 12:28:50,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 17 states have internal predecessors, (262), 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-20 12:28:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 23279 states and 27805 transitions. [2023-12-20 12:28:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-20 12:28:50,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:28:50,573 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:28:50,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-20 12:28:50,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:28:50,779 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:28:50,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:28:50,779 INFO L85 PathProgramCache]: Analyzing trace with hash -536881968, now seen corresponding path program 1 times [2023-12-20 12:28:50,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:28:50,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470492307] [2023-12-20 12:28:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:28:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:28:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:28:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 48 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:28:52,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:28:52,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470492307] [2023-12-20 12:28:52,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470492307] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:28:52,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109472930] [2023-12-20 12:28:52,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:28:52,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:28:52,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:28:52,490 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 12:28:52,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-20 12:28:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:28:52,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-20 12:28:52,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:28:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 48 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:28:55,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:29:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 48 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:29:01,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109472930] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:29:01,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:29:01,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 30] total 87 [2023-12-20 12:29:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275315210] [2023-12-20 12:29:01,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:29:01,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2023-12-20 12:29:01,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:29:01,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2023-12-20 12:29:01,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=638, Invalid=6844, Unknown=0, NotChecked=0, Total=7482 [2023-12-20 12:29:01,836 INFO L87 Difference]: Start difference. First operand 23279 states and 27805 transitions. Second operand has 87 states, 87 states have (on average 4.2298850574712645) internal successors, (368), 87 states have internal predecessors, (368), 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-20 12:31:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:31:44,230 INFO L93 Difference]: Finished difference Result 44881 states and 53007 transitions. [2023-12-20 12:31:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 409 states. [2023-12-20 12:31:44,231 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 4.2298850574712645) internal successors, (368), 87 states have internal predecessors, (368), 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 134 [2023-12-20 12:31:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:31:44,260 INFO L225 Difference]: With dead ends: 44881 [2023-12-20 12:31:44,260 INFO L226 Difference]: Without dead ends: 32478 [2023-12-20 12:31:44,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 491 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96093 ImplicationChecksByTransitivity, 153.5s TimeCoverageRelationStatistics Valid=24947, Invalid=217609, Unknown=0, NotChecked=0, Total=242556 [2023-12-20 12:31:44,274 INFO L413 NwaCegarLoop]: 1562 mSDtfsCounter, 58625 mSDsluCounter, 38938 mSDsCounter, 0 mSdLazyCounter, 5766 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58625 SdHoareTripleChecker+Valid, 40500 SdHoareTripleChecker+Invalid, 6213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 5766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-20 12:31:44,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58625 Valid, 40500 Invalid, 6213 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [447 Valid, 5766 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-12-20 12:31:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32478 states. [2023-12-20 12:31:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32478 to 24707. [2023-12-20 12:31:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24707 states, 24705 states have (on average 1.1917425622343656) internal successors, (29442), 24706 states have internal predecessors, (29442), 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-20 12:31:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24707 states to 24707 states and 29442 transitions. [2023-12-20 12:31:48,701 INFO L78 Accepts]: Start accepts. Automaton has 24707 states and 29442 transitions. Word has length 134 [2023-12-20 12:31:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:31:48,701 INFO L495 AbstractCegarLoop]: Abstraction has 24707 states and 29442 transitions. [2023-12-20 12:31:48,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 4.2298850574712645) internal successors, (368), 87 states have internal predecessors, (368), 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-20 12:31:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 24707 states and 29442 transitions. [2023-12-20 12:31:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-20 12:31:48,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:31:48,704 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:31:48,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-20 12:31:48,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-20 12:31:48,907 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:31:48,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:31:48,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1048126494, now seen corresponding path program 1 times [2023-12-20 12:31:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:31:48,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187057675] [2023-12-20 12:31:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:31:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:31:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 12:31:48,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 12:31:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 12:31:49,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 12:31:49,062 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 12:31:49,063 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-20 12:31:49,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-20 12:31:49,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-20 12:31:49,069 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 12:31:49,073 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 12:31:49,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 12:31:49 BoogieIcfgContainer [2023-12-20 12:31:49,168 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 12:31:49,168 INFO L158 Benchmark]: Toolchain (without parser) took 781079.04ms. Allocated memory was 242.2MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 175.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 545.8MB. Max. memory is 8.0GB. [2023-12-20 12:31:49,169 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 12:31:49,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1358.46ms. Allocated memory is still 242.2MB. Free memory was 174.7MB in the beginning and 134.7MB in the end (delta: 40.0MB). Peak memory consumption was 71.5MB. Max. memory is 8.0GB. [2023-12-20 12:31:49,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 310.85ms. Allocated memory was 242.2MB in the beginning and 360.7MB in the end (delta: 118.5MB). Free memory was 134.7MB in the beginning and 256.7MB in the end (delta: -122.0MB). Peak memory consumption was 79.4MB. Max. memory is 8.0GB. [2023-12-20 12:31:49,169 INFO L158 Benchmark]: Boogie Preprocessor took 372.54ms. Allocated memory is still 360.7MB. Free memory was 256.7MB in the beginning and 225.8MB in the end (delta: 30.9MB). Peak memory consumption was 100.1MB. Max. memory is 8.0GB. [2023-12-20 12:31:49,169 INFO L158 Benchmark]: RCFGBuilder took 3192.47ms. Allocated memory was 360.7MB in the beginning and 634.4MB in the end (delta: 273.7MB). Free memory was 225.8MB in the beginning and 355.4MB in the end (delta: -129.7MB). Peak memory consumption was 192.8MB. Max. memory is 8.0GB. [2023-12-20 12:31:49,169 INFO L158 Benchmark]: TraceAbstraction took 775838.38ms. Allocated memory was 634.4MB in the beginning and 2.5GB in the end (delta: 1.8GB). Free memory was 354.4MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 332.2MB. Max. memory is 8.0GB. [2023-12-20 12:31:49,170 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1358.46ms. Allocated memory is still 242.2MB. Free memory was 174.7MB in the beginning and 134.7MB in the end (delta: 40.0MB). Peak memory consumption was 71.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 310.85ms. Allocated memory was 242.2MB in the beginning and 360.7MB in the end (delta: 118.5MB). Free memory was 134.7MB in the beginning and 256.7MB in the end (delta: -122.0MB). Peak memory consumption was 79.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 372.54ms. Allocated memory is still 360.7MB. Free memory was 256.7MB in the beginning and 225.8MB in the end (delta: 30.9MB). Peak memory consumption was 100.1MB. Max. memory is 8.0GB. * RCFGBuilder took 3192.47ms. Allocated memory was 360.7MB in the beginning and 634.4MB in the end (delta: 273.7MB). Free memory was 225.8MB in the beginning and 355.4MB in the end (delta: -129.7MB). Peak memory consumption was 192.8MB. Max. memory is 8.0GB. * TraceAbstraction took 775838.38ms. Allocated memory was 634.4MB in the beginning and 2.5GB in the end (delta: 1.8GB). Free memory was 354.4MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 332.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 - CounterExampleResult [Line: 292]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L35] msg_t nomsg = (msg_t )-1; [L36] char r1 ; [L37] port_t p1 ; [L38] char p1_old ; [L39] char p1_new ; [L40] char id1 ; [L41] char st1 ; [L42] msg_t send1 ; [L43] _Bool mode1 ; [L44] port_t p2 ; [L45] char p2_old ; [L46] char p2_new ; [L47] char id2 ; [L48] char st2 ; [L49] msg_t send2 ; [L50] _Bool mode2 ; [L51] port_t p3 ; [L52] char p3_old ; [L53] char p3_new ; [L54] char id3 ; [L55] char st3 ; [L56] msg_t send3 ; [L57] _Bool mode3 ; [L308] int inputC = 3; [L309] int inputF = 6; [L310] int inputA = 1; [L311] int inputB = 2; [L312] int inputD = 4; [L313] int inputE = 5; [L316] int a17 = -124; [L317] int a5 = 4; [L318] int a24 = 15; [L319] int a2 = 170; [L320] int a7 = 13; [L5128] COND TRUE __VERIFIER_nondet_int() [L5129] CALL main1() [L239] int c1 ; [L240] int i2 ; [L243] c1 = 0 [L244] r1 = __VERIFIER_nondet_char() [L245] id1 = __VERIFIER_nondet_char() [L246] st1 = __VERIFIER_nondet_char() [L247] send1 = __VERIFIER_nondet_char() [L248] mode1 = __VERIFIER_nondet_bool() [L249] id2 = __VERIFIER_nondet_char() [L250] st2 = __VERIFIER_nondet_char() [L251] send2 = __VERIFIER_nondet_char() [L252] mode2 = __VERIFIER_nondet_bool() [L253] id3 = __VERIFIER_nondet_char() [L254] st3 = __VERIFIER_nondet_char() [L255] send3 = __VERIFIER_nondet_char() [L256] mode3 = __VERIFIER_nondet_bool() [L257] CALL, EXPR init() [L138] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L141] COND TRUE (int )r1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L142] COND TRUE (int )id1 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L143] COND TRUE (int )st1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L144] COND TRUE (int )send1 == (int )id1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L145] COND TRUE (int )mode1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L146] COND TRUE (int )id2 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L147] COND TRUE (int )st2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L148] COND TRUE (int )send2 == (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L149] COND TRUE (int )mode2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L150] COND TRUE (int )id3 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L151] COND TRUE (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L152] COND TRUE (int )send3 == (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L153] COND TRUE (int )mode3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L154] COND TRUE (int )id1 != (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L155] COND TRUE (int )id1 != (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L156] COND TRUE (int )id2 != (int )id3 [L157] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0, tmp=1] [L206] return (tmp); [L257] RET, EXPR init() [L257] i2 = init() [L258] COND FALSE !(!(i2)) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=0, i2=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L259] p1_old = nomsg [L260] p1_new = nomsg [L261] p2_old = nomsg [L262] p2_new = nomsg [L263] p3_old = nomsg [L264] p3_new = nomsg [L265] i2 = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=0, i2=0, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L64] COND FALSE !(\read(mode1)) [L80] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L81] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L92] COND FALSE !(\read(mode2)) [L105] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L106] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L117] COND FALSE !(\read(mode3)) [L130] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L131] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=127, p1_old=-1, p2=0, p2_new=126, p2_old=-1, p3=0, p3_new=125, p3_old=-1, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=125, r1=0, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L64] COND TRUE \read(mode1) [L65] r1 = (char )((int )r1 + 1) [L66] m1 = p3_old [L67] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=126, send3=125, st1=0, st2=0, st3=0] [L72] COND FALSE !((int )m1 == (int )id1) [L75] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=125, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=127, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L92] COND TRUE \read(mode2) [L93] m2 = p1_old [L94] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L95] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=126, send3=125, st1=0, st2=0, st3=0] [L96] COND TRUE (int )m2 > (int )id2 [L97] send2 = m2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L103] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=126, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L117] COND TRUE \read(mode3) [L118] m3 = p2_old [L119] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=126, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L120] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=126, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=125, st1=0, st2=0, st3=0] [L121] COND TRUE (int )m3 > (int )id3 [L122] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=126, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L128] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=126, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=2, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L64] COND FALSE !(\read(mode1)) [L80] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L81] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L92] COND FALSE !(\read(mode2)) [L105] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L106] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L117] COND FALSE !(\read(mode3)) [L130] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L131] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=125, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=126, p3_old=-1, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=3, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=126, r1=1, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L64] COND TRUE \read(mode1) [L65] r1 = (char )((int )r1 + 1) [L66] m1 = p3_old [L67] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=125, send2=127, send3=126, st1=0, st2=0, st3=0] [L72] COND FALSE !((int )m1 == (int )id1) [L75] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=126, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=125, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L92] COND TRUE \read(mode2) [L93] m2 = p1_old [L94] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L95] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L96] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L99] COND FALSE !((int )m2 == (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=125, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L103] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=125, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L117] COND TRUE \read(mode3) [L118] m3 = p2_old [L119] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L120] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=126, st1=0, st2=0, st3=0] [L121] COND TRUE (int )m3 > (int )id3 [L122] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L128] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=4, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L64] COND FALSE !(\read(mode1)) [L80] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L81] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L92] COND FALSE !(\read(mode2)) [L105] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L106] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L117] COND FALSE !(\read(mode3)) [L130] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L131] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=126, p1_old=-1, p2=0, p2_new=127, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=5, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=127, r1=2, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L64] COND TRUE \read(mode1) [L65] r1 = (char )((int )r1 + 1) [L66] m1 = p3_old [L67] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=0, st2=0, st3=0] [L72] COND TRUE (int )m1 == (int )id1 [L73] st1 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L78] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=126, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L92] COND TRUE \read(mode2) [L93] m2 = p1_old [L94] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L95] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L96] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=0, st3=0] [L99] COND TRUE (int )m2 == (int )id2 [L100] st2 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=126, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L103] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=126, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=127, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L117] COND TRUE \read(mode3) [L118] m3 = p2_old [L119] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L120] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L121] COND TRUE (int )m3 > (int )id3 [L122] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L128] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L214] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L232] tmp = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0, tmp=0] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND TRUE ! arg VAL [\old(arg)=0, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=0, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] [L292] reach_error() VAL [\old(arg)=0, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=0, id1=127, id2=126, id3=125, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=126, send2=127, send3=127, st1=1, st2=1, st3=0] - UnprovableResult [Line: 508]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 807 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 775.7s, OverallIterations: 37, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 637.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 455209 SdHoareTripleChecker+Valid, 43.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 455209 mSDsluCounter, 522342 SdHoareTripleChecker+Invalid, 38.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 468323 mSDsCounter, 4262 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51510 IncrementalHoareTripleChecker+Invalid, 55772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4262 mSolverCounterUnsat, 54019 mSDtfsCounter, 51510 mSolverCounterSat, 1.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6586 GetRequests, 3084 SyntacticMatches, 10 SemanticMatches, 3492 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358580 ImplicationChecksByTransitivity, 584.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24707occurred in iteration=36, InterpolantAutomatonStates: 2683, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.9s AutomataMinimizationTime, 36 MinimizatonAttempts, 74134 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 100.9s InterpolantComputationTime, 4443 NumberOfCodeBlocks, 4443 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 6063 ConstructedInterpolants, 0 QuantifiedInterpolants, 153924 SizeOfPredicates, 197 NumberOfNonLiveVariables, 8209 ConjunctsInSsa, 656 ConjunctsInUnsatCore, 76 InterpolantComputations, 16 PerfectInterpolantSequences, 1800/5559 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 proved your program to be incorrect! [2023-12-20 12:31:49,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...