/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_label04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 12:18:41,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 12:18:41,786 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:41,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 12:18:41,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 12:18:41,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 12:18:41,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 12:18:41,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 12:18:41,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 12:18:41,818 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 12:18:41,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 12:18:41,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 12:18:41,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 12:18:41,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 12:18:41,819 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 12:18:41,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 12:18:41,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 12:18:41,820 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 12:18:41,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 12:18:41,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 12:18:41,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 12:18:41,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 12:18:41,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 12:18:41,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 12:18:41,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 12:18:41,822 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 12:18:41,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 12:18:41,822 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 12:18:41,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 12:18:41,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 12:18:41,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 12:18:41,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 12:18:41,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 12:18:41,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 12:18:41,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 12:18:41,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 12:18:41,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 12:18:41,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 12:18:41,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 12:18:41,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 12:18:41,825 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 12:18:41,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 12:18:41,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 12:18:41,826 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:41,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 12:18:42,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 12:18:42,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 12:18:42,014 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 12:18:42,014 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 12:18:42,015 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_label04.c [2023-12-20 12:18:43,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 12:18:43,354 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 12:18:43,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c [2023-12-20 12:18:43,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b87a8f84/824e415a332c4c5a95e07d3d656b962f/FLAGb4aaa75fc [2023-12-20 12:18:43,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b87a8f84/824e415a332c4c5a95e07d3d656b962f [2023-12-20 12:18:43,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 12:18:43,393 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 12:18:43,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 12:18:43,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 12:18:43,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 12:18:43,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:18:43" (1/1) ... [2023-12-20 12:18:43,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4803feb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:43, skipping insertion in model container [2023-12-20 12:18:43,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:18:43" (1/1) ... [2023-12-20 12:18:43,478 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 12:18:43,701 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_label04.c[6391,6404] [2023-12-20 12:18:43,748 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_label04.c[13452,13465] [2023-12-20 12:18:44,282 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 12:18:44,292 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 12:18:44,320 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_label04.c[6391,6404] [2023-12-20 12:18:44,332 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_label04.c[13452,13465] [2023-12-20 12:18:44,634 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 12:18:44,653 INFO L206 MainTranslator]: Completed translation [2023-12-20 12:18:44,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:44 WrapperNode [2023-12-20 12:18:44,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 12:18:44,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 12:18:44,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 12:18:44,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 12:18:44,659 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:44" (1/1) ... [2023-12-20 12:18:44,697 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:44" (1/1) ... [2023-12-20 12:18:44,978 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4981 [2023-12-20 12:18:44,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 12:18:44,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 12:18:44,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 12:18:44,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 12:18:44,986 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:44" (1/1) ... [2023-12-20 12:18:44,987 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:44" (1/1) ... [2023-12-20 12:18:45,026 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:44" (1/1) ... [2023-12-20 12:18:45,255 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:45,255 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:44" (1/1) ... [2023-12-20 12:18:45,255 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:44" (1/1) ... [2023-12-20 12:18:45,327 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:44" (1/1) ... [2023-12-20 12:18:45,349 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:44" (1/1) ... [2023-12-20 12:18:45,374 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:44" (1/1) ... [2023-12-20 12:18:45,390 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:44" (1/1) ... [2023-12-20 12:18:45,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 12:18:45,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 12:18:45,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 12:18:45,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 12:18:45,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:44" (1/1) ... [2023-12-20 12:18:45,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 12:18:45,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:18:45,456 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:45,461 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:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 12:18:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 12:18:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 12:18:45,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 12:18:45,566 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 12:18:45,567 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 12:18:48,704 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 12:18:48,765 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 12:18:48,765 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-20 12:18:48,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:18:48 BoogieIcfgContainer [2023-12-20 12:18:48,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 12:18:48,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 12:18:48,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 12:18:48,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 12:18:48,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 12:18:43" (1/3) ... [2023-12-20 12:18:48,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dabb527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:18:48, skipping insertion in model container [2023-12-20 12:18:48,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:18:44" (2/3) ... [2023-12-20 12:18:48,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dabb527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:18:48, skipping insertion in model container [2023-12-20 12:18:48,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:18:48" (3/3) ... [2023-12-20 12:18:48,771 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c [2023-12-20 12:18:48,782 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 12:18:48,782 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-20 12:18:48,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 12:18:48,827 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;@6fbc3b24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 12:18:48,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-20 12:18:48,834 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:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-20 12:18:48,839 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:48,839 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:48,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:48,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1100216757, now seen corresponding path program 1 times [2023-12-20 12:18:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:48,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047026425] [2023-12-20 12:18:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:48,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:48,979 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:48,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:48,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047026425] [2023-12-20 12:18:48,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047026425] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:48,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:48,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 12:18:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428234320] [2023-12-20 12:18:48,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:48,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 12:18:48,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 12:18:49,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 12:18:49,002 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:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:49,055 INFO L93 Difference]: Finished difference Result 1594 states and 3146 transitions. [2023-12-20 12:18:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 12:18:49,057 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:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:49,068 INFO L225 Difference]: With dead ends: 1594 [2023-12-20 12:18:49,068 INFO L226 Difference]: Without dead ends: 803 [2023-12-20 12:18:49,071 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:49,073 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:49,074 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:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2023-12-20 12:18:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2023-12-20 12:18:49,135 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:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2023-12-20 12:18:49,137 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2023-12-20 12:18:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:49,138 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2023-12-20 12:18:49,138 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:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2023-12-20 12:18:49,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-20 12:18:49,138 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:49,139 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:49,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 12:18:49,139 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:49,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1687022771, now seen corresponding path program 1 times [2023-12-20 12:18:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:49,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767897809] [2023-12-20 12:18:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:49,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:49,283 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:49,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:49,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767897809] [2023-12-20 12:18:49,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767897809] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:49,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:49,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 12:18:49,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818500578] [2023-12-20 12:18:49,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:49,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:18:49,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:49,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:18:49,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:18:49,287 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:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:49,368 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2023-12-20 12:18:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 12:18:49,377 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:49,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:49,380 INFO L225 Difference]: With dead ends: 864 [2023-12-20 12:18:49,380 INFO L226 Difference]: Without dead ends: 832 [2023-12-20 12:18:49,380 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:49,381 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:49,382 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:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-12-20 12:18:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2023-12-20 12:18:49,391 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:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2023-12-20 12:18:49,405 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2023-12-20 12:18:49,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:49,406 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2023-12-20 12:18:49,406 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:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2023-12-20 12:18:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-20 12:18:49,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:49,408 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:49,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 12:18:49,408 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:49,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:49,409 INFO L85 PathProgramCache]: Analyzing trace with hash 613121839, now seen corresponding path program 1 times [2023-12-20 12:18:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:49,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174044660] [2023-12-20 12:18:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:49,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:49,515 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:49,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:49,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174044660] [2023-12-20 12:18:49,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174044660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:49,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:49,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 12:18:49,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504357486] [2023-12-20 12:18:49,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:49,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 12:18:49,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:49,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 12:18:49,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:18:49,519 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:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:49,618 INFO L93 Difference]: Finished difference Result 977 states and 1781 transitions. [2023-12-20 12:18:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 12:18:49,619 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:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:49,623 INFO L225 Difference]: With dead ends: 977 [2023-12-20 12:18:49,623 INFO L226 Difference]: Without dead ends: 948 [2023-12-20 12:18:49,624 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:49,627 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 4578 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:49,629 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.0s Time] [2023-12-20 12:18:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2023-12-20 12:18:49,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 830. [2023-12-20 12:18:49,640 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:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1548 transitions. [2023-12-20 12:18:49,644 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1548 transitions. Word has length 32 [2023-12-20 12:18:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:49,648 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1548 transitions. [2023-12-20 12:18:49,649 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:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1548 transitions. [2023-12-20 12:18:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 12:18:49,652 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:49,652 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:49,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 12:18:49,652 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:49,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash 675954815, now seen corresponding path program 1 times [2023-12-20 12:18:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:49,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171113944] [2023-12-20 12:18:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:49,713 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:49,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:49,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171113944] [2023-12-20 12:18:49,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171113944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:49,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:49,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:49,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562651284] [2023-12-20 12:18:49,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:49,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:49,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:49,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:49,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:49,714 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:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:49,740 INFO L93 Difference]: Finished difference Result 931 states and 1707 transitions. [2023-12-20 12:18:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:49,741 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:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:49,743 INFO L225 Difference]: With dead ends: 931 [2023-12-20 12:18:49,743 INFO L226 Difference]: Without dead ends: 875 [2023-12-20 12:18:49,745 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:49,756 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:49,756 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:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2023-12-20 12:18:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2023-12-20 12:18:49,766 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:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1614 transitions. [2023-12-20 12:18:49,768 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1614 transitions. Word has length 34 [2023-12-20 12:18:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:49,768 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1614 transitions. [2023-12-20 12:18:49,768 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:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1614 transitions. [2023-12-20 12:18:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 12:18:49,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:49,770 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:49,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 12:18:49,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:49,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash 678099767, now seen corresponding path program 1 times [2023-12-20 12:18:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:49,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131948483] [2023-12-20 12:18:49,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:49,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:49,867 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:49,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:49,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131948483] [2023-12-20 12:18:49,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131948483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:49,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:49,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 12:18:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118146931] [2023-12-20 12:18:49,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:49,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 12:18:49,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:49,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 12:18:49,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:18:49,868 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:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:49,920 INFO L93 Difference]: Finished difference Result 974 states and 1770 transitions. [2023-12-20 12:18:49,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:18:49,921 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:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:49,923 INFO L225 Difference]: With dead ends: 974 [2023-12-20 12:18:49,923 INFO L226 Difference]: Without dead ends: 875 [2023-12-20 12:18:49,924 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:49,924 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:49,924 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:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2023-12-20 12:18:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2023-12-20 12:18:49,933 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:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1612 transitions. [2023-12-20 12:18:49,935 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1612 transitions. Word has length 34 [2023-12-20 12:18:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:49,935 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1612 transitions. [2023-12-20 12:18:49,935 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:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1612 transitions. [2023-12-20 12:18:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-20 12:18:49,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:49,936 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:49,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 12:18:49,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:49,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash -582127364, now seen corresponding path program 1 times [2023-12-20 12:18:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:49,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679024474] [2023-12-20 12:18:49,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:50,012 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:50,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:50,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679024474] [2023-12-20 12:18:50,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679024474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:50,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:50,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 12:18:50,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398409837] [2023-12-20 12:18:50,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:50,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:18:50,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:50,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:18:50,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:18:50,014 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:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:50,040 INFO L93 Difference]: Finished difference Result 881 states and 1621 transitions. [2023-12-20 12:18:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 12:18:50,041 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:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:50,043 INFO L225 Difference]: With dead ends: 881 [2023-12-20 12:18:50,043 INFO L226 Difference]: Without dead ends: 879 [2023-12-20 12:18:50,044 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:50,044 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:50,044 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:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2023-12-20 12:18:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2023-12-20 12:18:50,053 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:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1615 transitions. [2023-12-20 12:18:50,055 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1615 transitions. Word has length 35 [2023-12-20 12:18:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:50,055 INFO L495 AbstractCegarLoop]: Abstraction has 877 states and 1615 transitions. [2023-12-20 12:18:50,055 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:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1615 transitions. [2023-12-20 12:18:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-20 12:18:50,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:50,056 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:50,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 12:18:50,056 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:50,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2127458807, now seen corresponding path program 1 times [2023-12-20 12:18:50,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:50,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289798479] [2023-12-20 12:18:50,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:50,087 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:50,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:50,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289798479] [2023-12-20 12:18:50,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289798479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:50,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:50,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:50,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254966406] [2023-12-20 12:18:50,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:50,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:50,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:50,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:50,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:50,088 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:50,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:50,109 INFO L93 Difference]: Finished difference Result 991 states and 1788 transitions. [2023-12-20 12:18:50,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:50,109 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:50,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:50,112 INFO L225 Difference]: With dead ends: 991 [2023-12-20 12:18:50,112 INFO L226 Difference]: Without dead ends: 931 [2023-12-20 12:18:50,112 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:50,113 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:50,113 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:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2023-12-20 12:18:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2023-12-20 12:18:50,126 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:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1692 transitions. [2023-12-20 12:18:50,127 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1692 transitions. Word has length 36 [2023-12-20 12:18:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:50,128 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1692 transitions. [2023-12-20 12:18:50,128 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:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1692 transitions. [2023-12-20 12:18:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-20 12:18:50,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:50,128 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:50,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 12:18:50,128 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:50,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1501802743, now seen corresponding path program 1 times [2023-12-20 12:18:50,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:50,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830396557] [2023-12-20 12:18:50,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:50,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:50,156 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:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830396557] [2023-12-20 12:18:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830396557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:50,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:50,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244989184] [2023-12-20 12:18:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:50,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:50,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:50,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:50,158 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:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:50,182 INFO L93 Difference]: Finished difference Result 1211 states and 2112 transitions. [2023-12-20 12:18:50,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:50,183 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:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:50,187 INFO L225 Difference]: With dead ends: 1211 [2023-12-20 12:18:50,187 INFO L226 Difference]: Without dead ends: 1058 [2023-12-20 12:18:50,188 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:50,188 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:50,189 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:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2023-12-20 12:18:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1056. [2023-12-20 12:18:50,204 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:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1874 transitions. [2023-12-20 12:18:50,207 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1874 transitions. Word has length 36 [2023-12-20 12:18:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:50,208 INFO L495 AbstractCegarLoop]: Abstraction has 1056 states and 1874 transitions. [2023-12-20 12:18:50,209 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:50,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1874 transitions. [2023-12-20 12:18:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-20 12:18:50,209 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:50,210 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:50,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 12:18:50,210 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:50,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:50,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1904431113, now seen corresponding path program 1 times [2023-12-20 12:18:50,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:50,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368926155] [2023-12-20 12:18:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:50,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:50,249 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:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368926155] [2023-12-20 12:18:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368926155] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:50,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:50,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:50,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376654951] [2023-12-20 12:18:50,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:50,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:50,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:50,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:50,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:50,251 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:50,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:50,357 INFO L93 Difference]: Finished difference Result 1568 states and 2616 transitions. [2023-12-20 12:18:50,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:50,358 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:50,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:50,364 INFO L225 Difference]: With dead ends: 1568 [2023-12-20 12:18:50,364 INFO L226 Difference]: Without dead ends: 1288 [2023-12-20 12:18:50,364 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:50,366 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:50,366 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:50,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2023-12-20 12:18:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1286. [2023-12-20 12:18:50,387 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:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2190 transitions. [2023-12-20 12:18:50,391 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2190 transitions. Word has length 36 [2023-12-20 12:18:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:50,391 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 2190 transitions. [2023-12-20 12:18:50,391 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:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2190 transitions. [2023-12-20 12:18:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-20 12:18:50,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:50,393 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:50,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 12:18:50,393 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:50,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1853448570, now seen corresponding path program 1 times [2023-12-20 12:18:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641069409] [2023-12-20 12:18:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:50,508 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:50,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641069409] [2023-12-20 12:18:50,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641069409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:50,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:50,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 12:18:50,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689622684] [2023-12-20 12:18:50,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:50,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 12:18:50,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:50,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 12:18:50,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:18:50,510 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:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:50,610 INFO L93 Difference]: Finished difference Result 2794 states and 4342 transitions. [2023-12-20 12:18:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:18:50,611 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:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:50,619 INFO L225 Difference]: With dead ends: 2794 [2023-12-20 12:18:50,619 INFO L226 Difference]: Without dead ends: 2424 [2023-12-20 12:18:50,620 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:50,621 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:50,621 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:50,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2023-12-20 12:18:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1726. [2023-12-20 12:18:50,665 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:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2810 transitions. [2023-12-20 12:18:50,670 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2810 transitions. Word has length 50 [2023-12-20 12:18:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:50,670 INFO L495 AbstractCegarLoop]: Abstraction has 1726 states and 2810 transitions. [2023-12-20 12:18:50,670 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:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2810 transitions. [2023-12-20 12:18:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-20 12:18:50,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:50,671 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:50,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 12:18:50,671 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:50,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:50,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1815862662, now seen corresponding path program 1 times [2023-12-20 12:18:50,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:50,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773660501] [2023-12-20 12:18:50,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:50,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:50,769 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:50,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:50,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773660501] [2023-12-20 12:18:50,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773660501] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:50,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:50,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 12:18:50,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748582610] [2023-12-20 12:18:50,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:50,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 12:18:50,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:50,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 12:18:50,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:18:50,771 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:50,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:50,853 INFO L93 Difference]: Finished difference Result 3302 states and 5062 transitions. [2023-12-20 12:18:50,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:18:50,854 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:50,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:50,861 INFO L225 Difference]: With dead ends: 3302 [2023-12-20 12:18:50,861 INFO L226 Difference]: Without dead ends: 2792 [2023-12-20 12:18:50,864 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:50,864 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:50,864 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:50,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2023-12-20 12:18:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2418. [2023-12-20 12:18:50,917 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:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3782 transitions. [2023-12-20 12:18:50,922 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3782 transitions. Word has length 50 [2023-12-20 12:18:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:50,923 INFO L495 AbstractCegarLoop]: Abstraction has 2418 states and 3782 transitions. [2023-12-20 12:18:50,923 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:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3782 transitions. [2023-12-20 12:18:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-20 12:18:50,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:50,924 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:50,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 12:18:50,925 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:50,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1590371194, now seen corresponding path program 1 times [2023-12-20 12:18:50,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:50,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520303186] [2023-12-20 12:18:50,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:50,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:50,998 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:50,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:50,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520303186] [2023-12-20 12:18:50,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520303186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:50,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:50,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 12:18:50,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910397281] [2023-12-20 12:18:50,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:50,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 12:18:50,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:51,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 12:18:51,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 12:18:51,000 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:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:51,098 INFO L93 Difference]: Finished difference Result 3810 states and 5778 transitions. [2023-12-20 12:18:51,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 12:18:51,099 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:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:51,107 INFO L225 Difference]: With dead ends: 3810 [2023-12-20 12:18:51,107 INFO L226 Difference]: Without dead ends: 3300 [2023-12-20 12:18:51,109 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:51,109 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:51,109 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:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2023-12-20 12:18:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2926. [2023-12-20 12:18:51,174 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:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4498 transitions. [2023-12-20 12:18:51,180 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4498 transitions. Word has length 50 [2023-12-20 12:18:51,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:51,181 INFO L495 AbstractCegarLoop]: Abstraction has 2926 states and 4498 transitions. [2023-12-20 12:18:51,181 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:51,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4498 transitions. [2023-12-20 12:18:51,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-20 12:18:51,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:51,182 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:51,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-20 12:18:51,182 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:51,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:51,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1183432324, now seen corresponding path program 1 times [2023-12-20 12:18:51,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:51,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216924768] [2023-12-20 12:18:51,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:51,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:51,230 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:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216924768] [2023-12-20 12:18:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216924768] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:51,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379466141] [2023-12-20 12:18:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:51,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:51,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:51,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:51,232 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:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:51,284 INFO L93 Difference]: Finished difference Result 5078 states and 7536 transitions. [2023-12-20 12:18:51,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:51,285 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:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:51,292 INFO L225 Difference]: With dead ends: 5078 [2023-12-20 12:18:51,293 INFO L226 Difference]: Without dead ends: 2928 [2023-12-20 12:18:51,295 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:51,295 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:51,296 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:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2023-12-20 12:18:51,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2926. [2023-12-20 12:18:51,356 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:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4448 transitions. [2023-12-20 12:18:51,361 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4448 transitions. Word has length 51 [2023-12-20 12:18:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:51,361 INFO L495 AbstractCegarLoop]: Abstraction has 2926 states and 4448 transitions. [2023-12-20 12:18:51,362 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:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4448 transitions. [2023-12-20 12:18:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-20 12:18:51,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:51,362 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:51,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 12:18:51,363 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:51,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:51,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1165828046, now seen corresponding path program 1 times [2023-12-20 12:18:51,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:51,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304110052] [2023-12-20 12:18:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:51,423 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:51,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:51,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304110052] [2023-12-20 12:18:51,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304110052] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:51,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:51,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:51,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51911900] [2023-12-20 12:18:51,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:51,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:51,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:51,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:51,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:51,425 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:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:51,522 INFO L93 Difference]: Finished difference Result 3772 states and 5635 transitions. [2023-12-20 12:18:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:51,523 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:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:51,527 INFO L225 Difference]: With dead ends: 3772 [2023-12-20 12:18:51,527 INFO L226 Difference]: Without dead ends: 1622 [2023-12-20 12:18:51,529 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:51,529 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:51,529 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:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2023-12-20 12:18:51,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1615. [2023-12-20 12:18:51,554 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:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2623 transitions. [2023-12-20 12:18:51,557 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2623 transitions. Word has length 52 [2023-12-20 12:18:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:51,557 INFO L495 AbstractCegarLoop]: Abstraction has 1615 states and 2623 transitions. [2023-12-20 12:18:51,557 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:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2623 transitions. [2023-12-20 12:18:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-20 12:18:51,558 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:51,558 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:51,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 12:18:51,558 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:51,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:51,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2138930058, now seen corresponding path program 1 times [2023-12-20 12:18:51,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:51,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526076917] [2023-12-20 12:18:51,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:51,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:51,598 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:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:51,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526076917] [2023-12-20 12:18:51,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526076917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:18:51,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:18:51,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:18:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834687551] [2023-12-20 12:18:51,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:18:51,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 12:18:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 12:18:51,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 12:18:51,599 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:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:51,622 INFO L93 Difference]: Finished difference Result 2033 states and 3201 transitions. [2023-12-20 12:18:51,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 12:18:51,622 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:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:51,625 INFO L225 Difference]: With dead ends: 2033 [2023-12-20 12:18:51,625 INFO L226 Difference]: Without dead ends: 1203 [2023-12-20 12:18:51,626 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:51,626 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:51,627 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:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2023-12-20 12:18:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1201. [2023-12-20 12:18:51,643 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:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2038 transitions. [2023-12-20 12:18:51,645 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2038 transitions. Word has length 53 [2023-12-20 12:18:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:51,645 INFO L495 AbstractCegarLoop]: Abstraction has 1201 states and 2038 transitions. [2023-12-20 12:18:51,645 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:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2038 transitions. [2023-12-20 12:18:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-20 12:18:51,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:51,645 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:51,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-20 12:18:51,646 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:51,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:51,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1489407768, now seen corresponding path program 1 times [2023-12-20 12:18:51,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:51,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492214478] [2023-12-20 12:18:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:52,800 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:52,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:52,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492214478] [2023-12-20 12:18:52,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492214478] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:18:52,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743265151] [2023-12-20 12:18:52,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:52,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:18:52,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:18:52,822 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:52,875 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:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:52,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-20 12:18:52,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:18:53,048 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:53,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:18:53,232 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:53,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743265151] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:18:53,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:18:53,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2023-12-20 12:18:53,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782386130] [2023-12-20 12:18:53,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:18:53,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-20 12:18:53,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:53,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-20 12:18:53,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-20 12:18:53,234 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:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:54,709 INFO L93 Difference]: Finished difference Result 3210 states and 4685 transitions. [2023-12-20 12:18:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-20 12:18:54,710 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:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:54,714 INFO L225 Difference]: With dead ends: 3210 [2023-12-20 12:18:54,714 INFO L226 Difference]: Without dead ends: 2794 [2023-12-20 12:18:54,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=504, Invalid=2148, Unknown=0, NotChecked=0, Total=2652 [2023-12-20 12:18:54,716 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.3s IncrementalHoareTripleChecker+Time [2023-12-20 12:18:54,716 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.3s Time] [2023-12-20 12:18:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2023-12-20 12:18:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2612. [2023-12-20 12:18:54,799 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:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 3817 transitions. [2023-12-20 12:18:54,802 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 3817 transitions. Word has length 55 [2023-12-20 12:18:54,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:54,802 INFO L495 AbstractCegarLoop]: Abstraction has 2612 states and 3817 transitions. [2023-12-20 12:18:54,803 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:54,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3817 transitions. [2023-12-20 12:18:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-20 12:18:54,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:54,804 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:54,825 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:55,010 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:55,011 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:55,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:55,011 INFO L85 PathProgramCache]: Analyzing trace with hash -294784256, now seen corresponding path program 1 times [2023-12-20 12:18:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:55,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675263049] [2023-12-20 12:18:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:55,373 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:18:55,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675263049] [2023-12-20 12:18:55,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675263049] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:18:55,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667005054] [2023-12-20 12:18:55,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:55,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:18:55,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:18:55,398 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:18:55,412 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:18:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:55,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 12:18:55,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:18:55,787 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:18:55,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:18:56,467 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:18:56,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667005054] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:18:56,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:18:56,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 28 [2023-12-20 12:18:56,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213073659] [2023-12-20 12:18:56,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:18:56,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-20 12:18:56,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:56,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-20 12:18:56,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2023-12-20 12:18:56,469 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:18:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:56,934 INFO L93 Difference]: Finished difference Result 4798 states and 6605 transitions. [2023-12-20 12:18:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-20 12:18:56,934 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:18:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:56,939 INFO L225 Difference]: With dead ends: 4798 [2023-12-20 12:18:56,939 INFO L226 Difference]: Without dead ends: 3271 [2023-12-20 12:18:56,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2023-12-20 12:18:56,942 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:18:56,942 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:18:56,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2023-12-20 12:18:57,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 3117. [2023-12-20 12:18:57,014 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:18:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4459 transitions. [2023-12-20 12:18:57,017 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4459 transitions. Word has length 56 [2023-12-20 12:18:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:57,018 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 4459 transitions. [2023-12-20 12:18:57,018 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:18:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4459 transitions. [2023-12-20 12:18:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-20 12:18:57,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:57,021 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:57,031 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:18:57,231 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:18:57,231 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:57,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2030773760, now seen corresponding path program 1 times [2023-12-20 12:18:57,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:57,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400910031] [2023-12-20 12:18:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:57,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:57,426 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:18:57,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:57,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400910031] [2023-12-20 12:18:57,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400910031] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:18:57,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519945246] [2023-12-20 12:18:57,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:57,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:18:57,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:18:57,453 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:18:57,483 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:18:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:57,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 12:18:57,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:18:58,046 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:18:58,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:18:58,613 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:18:58,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519945246] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:18:58,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:18:58,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29 [2023-12-20 12:18:58,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767545977] [2023-12-20 12:18:58,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:18:58,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-20 12:18:58,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:18:58,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-20 12:18:58,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2023-12-20 12:18:58,615 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:18:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:18:59,432 INFO L93 Difference]: Finished difference Result 6681 states and 9005 transitions. [2023-12-20 12:18:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-20 12:18:59,432 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:18:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:18:59,439 INFO L225 Difference]: With dead ends: 6681 [2023-12-20 12:18:59,440 INFO L226 Difference]: Without dead ends: 4659 [2023-12-20 12:18:59,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=606, Invalid=1944, Unknown=0, NotChecked=0, Total=2550 [2023-12-20 12:18:59,444 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:18:59,444 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:18:59,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2023-12-20 12:18:59,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 3153. [2023-12-20 12:18:59,531 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:18:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 3153 states and 4482 transitions. [2023-12-20 12:18:59,536 INFO L78 Accepts]: Start accepts. Automaton has 3153 states and 4482 transitions. Word has length 56 [2023-12-20 12:18:59,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:18:59,536 INFO L495 AbstractCegarLoop]: Abstraction has 3153 states and 4482 transitions. [2023-12-20 12:18:59,536 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:18:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3153 states and 4482 transitions. [2023-12-20 12:18:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-20 12:18:59,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:18:59,537 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,551 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:18:59,742 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:18:59,742 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:18:59,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:18:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1035298560, now seen corresponding path program 1 times [2023-12-20 12:18:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:18:59,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444127228] [2023-12-20 12:18:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:59,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:18:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:18:59,953 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:18:59,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:18:59,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444127228] [2023-12-20 12:18:59,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444127228] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:18:59,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489752933] [2023-12-20 12:18:59,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:18:59,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:18:59,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:18:59,969 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:18:59,970 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:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:00,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 12:19:00,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:19:00,426 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:00,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:19:00,941 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:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489752933] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:19:00,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:19:00,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29 [2023-12-20 12:19:00,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178079890] [2023-12-20 12:19:00,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:19:00,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-20 12:19:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:19:00,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-20 12:19:00,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2023-12-20 12:19:00,943 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:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:19:01,528 INFO L93 Difference]: Finished difference Result 7668 states and 10192 transitions. [2023-12-20 12:19:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-20 12:19:01,529 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:01,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:19:01,537 INFO L225 Difference]: With dead ends: 7668 [2023-12-20 12:19:01,537 INFO L226 Difference]: Without dead ends: 5793 [2023-12-20 12:19:01,540 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:01,540 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:01,540 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:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states. [2023-12-20 12:19:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5793 to 5403. [2023-12-20 12:19:01,713 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:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 7247 transitions. [2023-12-20 12:19:01,719 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 7247 transitions. Word has length 56 [2023-12-20 12:19:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:19:01,719 INFO L495 AbstractCegarLoop]: Abstraction has 5403 states and 7247 transitions. [2023-12-20 12:19:01,719 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:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 7247 transitions. [2023-12-20 12:19:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-20 12:19:01,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:19:01,720 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:01,739 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:01,925 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:01,925 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:19:01,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:19:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1142870954, now seen corresponding path program 1 times [2023-12-20 12:19:01,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:19:01,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922646559] [2023-12-20 12:19:01,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:01,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:19:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:02,481 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:02,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:19:02,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922646559] [2023-12-20 12:19:02,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922646559] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:19:02,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589975701] [2023-12-20 12:19:02,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:02,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:19:02,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:19:02,496 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:02,512 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:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:02,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-20 12:19:02,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:19:04,269 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:04,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:19:06,566 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:06,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589975701] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:19:06,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:19:06,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 22] total 49 [2023-12-20 12:19:06,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261493978] [2023-12-20 12:19:06,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:19:06,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-20 12:19:06,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:19:06,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-20 12:19:06,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1982, Unknown=0, NotChecked=0, Total=2352 [2023-12-20 12:19:06,570 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:32,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:19:32,758 INFO L93 Difference]: Finished difference Result 10701 states and 13861 transitions. [2023-12-20 12:19:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2023-12-20 12:19:32,759 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:32,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:19:32,781 INFO L225 Difference]: With dead ends: 10701 [2023-12-20 12:19:32,781 INFO L226 Difference]: Without dead ends: 6557 [2023-12-20 12:19:32,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9267 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=5230, Invalid=20530, Unknown=0, NotChecked=0, Total=25760 [2023-12-20 12:19:32,788 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 16440 mSDsluCounter, 16712 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2023-12-20 12:19:32,788 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.3s Time] [2023-12-20 12:19:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2023-12-20 12:19:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 3607. [2023-12-20 12:19:32,906 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:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 5023 transitions. [2023-12-20 12:19:32,909 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 5023 transitions. Word has length 57 [2023-12-20 12:19:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:19:32,910 INFO L495 AbstractCegarLoop]: Abstraction has 3607 states and 5023 transitions. [2023-12-20 12:19:32,910 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:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 5023 transitions. [2023-12-20 12:19:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-20 12:19:32,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:19:32,910 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:32,932 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:33,115 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:33,117 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:19:33,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:19:33,118 INFO L85 PathProgramCache]: Analyzing trace with hash -998773852, now seen corresponding path program 1 times [2023-12-20 12:19:33,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:19:33,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533538892] [2023-12-20 12:19:33,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:33,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:19:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:33,522 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:33,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:19:33,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533538892] [2023-12-20 12:19:33,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533538892] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:19:33,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581217866] [2023-12-20 12:19:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:33,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:19:33,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:19:33,523 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:33,584 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:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:33,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-20 12:19:33,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:19:34,314 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:34,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:19:34,858 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:34,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581217866] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:19:34,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:19:34,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2023-12-20 12:19:34,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668523710] [2023-12-20 12:19:34,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:19:34,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-20 12:19:34,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:19:34,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-20 12:19:34,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2023-12-20 12:19:34,860 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:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:19:36,713 INFO L93 Difference]: Finished difference Result 9843 states and 12953 transitions. [2023-12-20 12:19:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-20 12:19:36,713 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:36,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:19:36,724 INFO L225 Difference]: With dead ends: 9843 [2023-12-20 12:19:36,724 INFO L226 Difference]: Without dead ends: 8589 [2023-12-20 12:19:36,726 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:36,727 INFO L413 NwaCegarLoop]: 1473 mSDtfsCounter, 12546 mSDsluCounter, 13460 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:36,727 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:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8589 states. [2023-12-20 12:19:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8589 to 3404. [2023-12-20 12:19:36,854 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:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4775 transitions. [2023-12-20 12:19:36,857 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4775 transitions. Word has length 59 [2023-12-20 12:19:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:19:36,857 INFO L495 AbstractCegarLoop]: Abstraction has 3404 states and 4775 transitions. [2023-12-20 12:19:36,857 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:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4775 transitions. [2023-12-20 12:19:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 12:19:36,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:19:36,858 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] [2023-12-20 12:19:36,875 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:37,063 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:37,063 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:19:37,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:19:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1349660345, now seen corresponding path program 1 times [2023-12-20 12:19:37,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:19:37,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994385544] [2023-12-20 12:19:37,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:37,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:19:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:37,160 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:37,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:19:37,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994385544] [2023-12-20 12:19:37,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994385544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:19:37,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:19:37,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:19:37,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673758132] [2023-12-20 12:19:37,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:19:37,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:19:37,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:19:37,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:19:37,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:19:37,161 INFO L87 Difference]: Start difference. First operand 3404 states and 4775 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:19:42,026 INFO L93 Difference]: Finished difference Result 5659 states and 9084 transitions. [2023-12-20 12:19:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 12:19:42,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2023-12-20 12:19:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:19:42,035 INFO L225 Difference]: With dead ends: 5659 [2023-12-20 12:19:42,035 INFO L226 Difference]: Without dead ends: 4906 [2023-12-20 12:19:42,049 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:42,050 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 2324 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5357 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2324 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.7s IncrementalHoareTripleChecker+Time [2023-12-20 12:19:42,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2324 Valid, 756 Invalid, 6510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5357 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-20 12:19:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2023-12-20 12:19:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 4906. [2023-12-20 12:19:42,320 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:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 6889 transitions. [2023-12-20 12:19:42,325 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 6889 transitions. Word has length 60 [2023-12-20 12:19:42,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:19:42,326 INFO L495 AbstractCegarLoop]: Abstraction has 4906 states and 6889 transitions. [2023-12-20 12:19:42,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 6889 transitions. [2023-12-20 12:19:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-20 12:19:42,327 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:19:42,327 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:42,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-20 12:19:42,327 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:19:42,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:19:42,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1874846004, now seen corresponding path program 1 times [2023-12-20 12:19:42,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:19:42,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185959261] [2023-12-20 12:19:42,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:42,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:19:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:43,032 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:43,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:19:43,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185959261] [2023-12-20 12:19:43,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185959261] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:19:43,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545736777] [2023-12-20 12:19:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:19:43,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:19:43,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:19:43,034 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:43,061 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:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:19:43,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-20 12:19:43,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:19:44,222 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:44,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:19:46,219 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:46,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545736777] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:19:46,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:19:46,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 50 [2023-12-20 12:19:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138004075] [2023-12-20 12:19:46,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:19:46,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-20 12:19:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:19:46,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-20 12:19:46,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2256, Unknown=0, NotChecked=0, Total=2450 [2023-12-20 12:19:46,224 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:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:20:12,694 INFO L93 Difference]: Finished difference Result 8484 states and 11305 transitions. [2023-12-20 12:20:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2023-12-20 12:20:12,695 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:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:20:12,704 INFO L225 Difference]: With dead ends: 8484 [2023-12-20 12:20:12,704 INFO L226 Difference]: Without dead ends: 7426 [2023-12-20 12:20:12,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12776 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=5590, Invalid=34610, Unknown=0, NotChecked=0, Total=40200 [2023-12-20 12:20:12,710 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.7s IncrementalHoareTripleChecker+Time [2023-12-20 12:20:12,710 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.7s Time] [2023-12-20 12:20:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2023-12-20 12:20:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 4273. [2023-12-20 12:20:12,918 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:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 6049 transitions. [2023-12-20 12:20:12,921 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 6049 transitions. Word has length 93 [2023-12-20 12:20:12,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:20:12,922 INFO L495 AbstractCegarLoop]: Abstraction has 4273 states and 6049 transitions. [2023-12-20 12:20:12,922 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:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 6049 transitions. [2023-12-20 12:20:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-20 12:20:12,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:20:12,923 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:12,940 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:13,128 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:13,128 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:20:13,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:20:13,128 INFO L85 PathProgramCache]: Analyzing trace with hash 504831842, now seen corresponding path program 1 times [2023-12-20 12:20:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:20:13,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010630122] [2023-12-20 12:20:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:20:13,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:20:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:20:13,546 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:13,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:20:13,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010630122] [2023-12-20 12:20:13,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010630122] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:20:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39365449] [2023-12-20 12:20:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:20:13,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:20:13,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:20:13,549 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:13,550 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:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:20:13,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-20 12:20:13,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:20:14,765 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:14,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:20:16,980 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:16,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39365449] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:20:16,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:20:16,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 17] total 45 [2023-12-20 12:20:16,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370585088] [2023-12-20 12:20:16,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:20:16,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-20 12:20:16,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:20:16,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-20 12:20:16,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1799, Unknown=0, NotChecked=0, Total=1980 [2023-12-20 12:20:16,982 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:20:54,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:20:54,786 INFO L93 Difference]: Finished difference Result 23997 states and 30337 transitions. [2023-12-20 12:20:54,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2023-12-20 12:20:54,786 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:20:54,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:20:54,805 INFO L225 Difference]: With dead ends: 23997 [2023-12-20 12:20:54,806 INFO L226 Difference]: Without dead ends: 22198 [2023-12-20 12:20:54,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27847 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=10667, Invalid=64683, Unknown=0, NotChecked=0, Total=75350 [2023-12-20 12:20:54,813 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:20:54,813 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:20:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22198 states. [2023-12-20 12:20:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22198 to 16956. [2023-12-20 12:20:56,019 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:20:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16956 states to 16956 states and 21490 transitions. [2023-12-20 12:20:56,037 INFO L78 Accepts]: Start accepts. Automaton has 16956 states and 21490 transitions. Word has length 94 [2023-12-20 12:20:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:20:56,037 INFO L495 AbstractCegarLoop]: Abstraction has 16956 states and 21490 transitions. [2023-12-20 12:20:56,037 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:20:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 16956 states and 21490 transitions. [2023-12-20 12:20:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-20 12:20:56,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:20:56,039 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:20:56,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-20 12:20:56,244 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:20:56,244 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:20:56,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:20:56,245 INFO L85 PathProgramCache]: Analyzing trace with hash -503225792, now seen corresponding path program 1 times [2023-12-20 12:20:56,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:20:56,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714265719] [2023-12-20 12:20:56,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:20:56,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:20:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:20:56,945 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:20:56,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:20:56,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714265719] [2023-12-20 12:20:56,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714265719] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:20:56,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932816943] [2023-12-20 12:20:56,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:20:56,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:20:56,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:20:56,946 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:20:56,948 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:20:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:20:57,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-20 12:20:57,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:20:58,738 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:20:58,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:21:01,012 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:01,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932816943] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:21:01,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:21:01,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 22] total 58 [2023-12-20 12:21:01,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565298395] [2023-12-20 12:21:01,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:21:01,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-20 12:21:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:21:01,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-20 12:21:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3050, Unknown=0, NotChecked=0, Total=3306 [2023-12-20 12:21:01,014 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:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:21:13,866 INFO L93 Difference]: Finished difference Result 26279 states and 32713 transitions. [2023-12-20 12:21:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-12-20 12:21:13,866 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:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:21:13,883 INFO L225 Difference]: With dead ends: 26279 [2023-12-20 12:21:13,883 INFO L226 Difference]: Without dead ends: 20818 [2023-12-20 12:21:13,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4138 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2505, Invalid=14525, Unknown=0, NotChecked=0, Total=17030 [2023-12-20 12:21:13,889 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, 2.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:21:13,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28292 Valid, 35176 Invalid, 3253 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [93 Valid, 3160 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-20 12:21:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20818 states. [2023-12-20 12:21:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20818 to 19506. [2023-12-20 12:21:15,319 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:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19506 states to 19506 states and 24586 transitions. [2023-12-20 12:21:15,338 INFO L78 Accepts]: Start accepts. Automaton has 19506 states and 24586 transitions. Word has length 95 [2023-12-20 12:21:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:21:15,338 INFO L495 AbstractCegarLoop]: Abstraction has 19506 states and 24586 transitions. [2023-12-20 12:21:15,338 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:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 19506 states and 24586 transitions. [2023-12-20 12:21:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-20 12:21:15,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:21:15,340 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:15,353 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:15,544 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:15,545 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:21:15,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:21:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1429287380, now seen corresponding path program 1 times [2023-12-20 12:21:15,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:21:15,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981226044] [2023-12-20 12:21:15,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:21:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:15,981 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:15,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:21:15,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981226044] [2023-12-20 12:21:15,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981226044] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:21:15,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480836005] [2023-12-20 12:21:15,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:15,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:21:15,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:21:15,995 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:16,023 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:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:16,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-20 12:21:16,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:21:16,771 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:16,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:21:17,734 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:17,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480836005] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:21:17,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:21:17,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-12-20 12:21:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266190988] [2023-12-20 12:21:17,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:21:17,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-20 12:21:17,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:21:17,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-20 12:21:17,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2023-12-20 12:21:17,736 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:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:21:19,743 INFO L93 Difference]: Finished difference Result 27876 states and 34923 transitions. [2023-12-20 12:21:19,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-20 12:21:19,743 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:19,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:21:19,761 INFO L225 Difference]: With dead ends: 27876 [2023-12-20 12:21:19,761 INFO L226 Difference]: Without dead ends: 19736 [2023-12-20 12:21:19,769 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:19,769 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:19,769 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:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19736 states. [2023-12-20 12:21:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19736 to 19506. [2023-12-20 12:21:21,263 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:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19506 states to 19506 states and 24444 transitions. [2023-12-20 12:21:21,282 INFO L78 Accepts]: Start accepts. Automaton has 19506 states and 24444 transitions. Word has length 95 [2023-12-20 12:21:21,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:21:21,282 INFO L495 AbstractCegarLoop]: Abstraction has 19506 states and 24444 transitions. [2023-12-20 12:21:21,282 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:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 19506 states and 24444 transitions. [2023-12-20 12:21:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-20 12:21:21,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:21:21,284 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:21,291 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:21,489 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:21,490 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:21:21,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:21:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash 919827296, now seen corresponding path program 1 times [2023-12-20 12:21:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:21:21,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080150651] [2023-12-20 12:21:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:21,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:21:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:21,957 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:21,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:21:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080150651] [2023-12-20 12:21:21,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080150651] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:21:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681650102] [2023-12-20 12:21:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:21,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:21:21,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:21:21,958 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:21,959 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:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:22,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-20 12:21:22,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:21:22,803 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:22,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:21:23,519 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:23,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681650102] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:21:23,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:21:23,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2023-12-20 12:21:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847458964] [2023-12-20 12:21:23,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:21:23,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-20 12:21:23,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:21:23,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-20 12:21:23,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2023-12-20 12:21:23,520 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:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:21:27,678 INFO L93 Difference]: Finished difference Result 38130 states and 47060 transitions. [2023-12-20 12:21:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-20 12:21:27,678 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:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:21:27,696 INFO L225 Difference]: With dead ends: 38130 [2023-12-20 12:21:27,697 INFO L226 Difference]: Without dead ends: 21732 [2023-12-20 12:21:27,705 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:27,706 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 18131 mSDsluCounter, 9404 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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:27,706 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:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21732 states. [2023-12-20 12:21:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21732 to 12078. [2023-12-20 12:21:28,702 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:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12078 states to 12078 states and 15401 transitions. [2023-12-20 12:21:28,713 INFO L78 Accepts]: Start accepts. Automaton has 12078 states and 15401 transitions. Word has length 95 [2023-12-20 12:21:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:21:28,714 INFO L495 AbstractCegarLoop]: Abstraction has 12078 states and 15401 transitions. [2023-12-20 12:21:28,714 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:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 12078 states and 15401 transitions. [2023-12-20 12:21:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-20 12:21:28,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:21:28,715 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:28,720 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:28,920 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:28,920 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:21:28,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:21:28,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1894536766, now seen corresponding path program 1 times [2023-12-20 12:21:28,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:21:28,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466222421] [2023-12-20 12:21:28,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:21:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:30,045 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:30,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:21:30,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466222421] [2023-12-20 12:21:30,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466222421] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:21:30,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147991950] [2023-12-20 12:21:30,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:21:30,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:21:30,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:21:30,047 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:30,048 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:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:21:30,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-20 12:21:30,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:21:31,938 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:31,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:21:34,431 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:34,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147991950] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:21:34,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:21:34,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 19] total 63 [2023-12-20 12:21:34,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171525208] [2023-12-20 12:21:34,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:21:34,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-12-20 12:21:34,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:21:34,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-12-20 12:21:34,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3679, Unknown=0, NotChecked=0, Total=3906 [2023-12-20 12:21:34,433 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:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:22:06,829 INFO L93 Difference]: Finished difference Result 23239 states and 28961 transitions. [2023-12-20 12:22:06,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2023-12-20 12:22:06,829 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:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:22:06,847 INFO L225 Difference]: With dead ends: 23239 [2023-12-20 12:22:06,848 INFO L226 Difference]: Without dead ends: 18660 [2023-12-20 12:22:06,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15817 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=6514, Invalid=45242, Unknown=0, NotChecked=0, Total=51756 [2023-12-20 12:22:06,853 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:06,854 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:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18660 states. [2023-12-20 12:22:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18660 to 12378. [2023-12-20 12:22:08,056 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:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12378 states to 12378 states and 15705 transitions. [2023-12-20 12:22:08,069 INFO L78 Accepts]: Start accepts. Automaton has 12378 states and 15705 transitions. Word has length 95 [2023-12-20 12:22:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:22:08,069 INFO L495 AbstractCegarLoop]: Abstraction has 12378 states and 15705 transitions. [2023-12-20 12:22:08,069 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:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 12378 states and 15705 transitions. [2023-12-20 12:22:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-20 12:22:08,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:22:08,070 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:08,075 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:08,275 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:08,276 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:22:08,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:22:08,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1850802400, now seen corresponding path program 1 times [2023-12-20 12:22:08,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:22:08,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956491138] [2023-12-20 12:22:08,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:22:08,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:22:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:22:08,840 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:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:22:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956491138] [2023-12-20 12:22:08,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956491138] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:22:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221886688] [2023-12-20 12:22:08,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:22:08,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:22:08,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:22:08,841 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:08,857 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:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:22:08,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 12:22:08,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:22:09,654 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:09,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:22:10,898 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:10,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221886688] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:22:10,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:22:10,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 44 [2023-12-20 12:22:10,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035926218] [2023-12-20 12:22:10,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:22:10,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-20 12:22:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:22:10,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-20 12:22:10,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2023-12-20 12:22:10,900 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:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:22:15,341 INFO L93 Difference]: Finished difference Result 23298 states and 28886 transitions. [2023-12-20 12:22:15,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-12-20 12:22:15,341 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:15,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:22:15,353 INFO L225 Difference]: With dead ends: 23298 [2023-12-20 12:22:15,353 INFO L226 Difference]: Without dead ends: 14481 [2023-12-20 12:22:15,357 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:15,357 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:15,357 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:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14481 states. [2023-12-20 12:22:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14481 to 10669. [2023-12-20 12:22:16,387 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:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 13589 transitions. [2023-12-20 12:22:16,396 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 13589 transitions. Word has length 96 [2023-12-20 12:22:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:22:16,396 INFO L495 AbstractCegarLoop]: Abstraction has 10669 states and 13589 transitions. [2023-12-20 12:22:16,397 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:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 13589 transitions. [2023-12-20 12:22:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-20 12:22:16,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:22:16,398 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:16,403 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:16,603 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:16,603 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:22:16,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:22:16,603 INFO L85 PathProgramCache]: Analyzing trace with hash -927858116, now seen corresponding path program 1 times [2023-12-20 12:22:16,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:22:16,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155201283] [2023-12-20 12:22:16,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:22:16,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:22:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:22:17,274 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:17,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:22:17,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155201283] [2023-12-20 12:22:17,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155201283] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:22:17,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991062209] [2023-12-20 12:22:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:22:17,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:22:17,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:22:17,276 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:17,277 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:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:22:17,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-20 12:22:17,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:22:18,766 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:18,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:22:32,624 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:32,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991062209] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:22:32,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:22:32,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26, 25] total 68 [2023-12-20 12:22:32,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193110689] [2023-12-20 12:22:32,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:22:32,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-12-20 12:22:32,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:22:32,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-12-20 12:22:32,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=4172, Unknown=0, NotChecked=0, Total=4556 [2023-12-20 12:22:32,626 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:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:23:34,343 INFO L93 Difference]: Finished difference Result 23000 states and 28328 transitions. [2023-12-20 12:23:34,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 326 states. [2023-12-20 12:23:34,344 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:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:23:34,358 INFO L225 Difference]: With dead ends: 23000 [2023-12-20 12:23:34,358 INFO L226 Difference]: Without dead ends: 18030 [2023-12-20 12:23:34,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57002 ImplicationChecksByTransitivity, 58.0s TimeCoverageRelationStatistics Valid=17711, Invalid=132445, Unknown=0, NotChecked=0, Total=150156 [2023-12-20 12:23:34,367 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.8s IncrementalHoareTripleChecker+Time [2023-12-20 12:23:34,367 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.8s Time] [2023-12-20 12:23:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18030 states. [2023-12-20 12:23:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18030 to 14747. [2023-12-20 12:23:35,999 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:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14747 states to 14747 states and 18494 transitions. [2023-12-20 12:23:36,012 INFO L78 Accepts]: Start accepts. Automaton has 14747 states and 18494 transitions. Word has length 97 [2023-12-20 12:23:36,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:23:36,013 INFO L495 AbstractCegarLoop]: Abstraction has 14747 states and 18494 transitions. [2023-12-20 12:23:36,013 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:36,013 INFO L276 IsEmpty]: Start isEmpty. Operand 14747 states and 18494 transitions. [2023-12-20 12:23:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-20 12:23:36,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:23:36,029 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:36,034 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:36,233 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:36,234 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:23:36,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:23:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash -434470554, now seen corresponding path program 1 times [2023-12-20 12:23:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:23:36,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854048020] [2023-12-20 12:23:36,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:23:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:23:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:23:37,131 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:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:23:37,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854048020] [2023-12-20 12:23:37,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854048020] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:23:37,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352052863] [2023-12-20 12:23:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:23:37,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:23:37,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:23:37,133 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:37,135 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:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:23:37,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-20 12:23:37,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:23:40,434 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:40,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:23:47,068 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:47,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352052863] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:23:47,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:23:47,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29, 30] total 78 [2023-12-20 12:23:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101925953] [2023-12-20 12:23:47,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:23:47,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-12-20 12:23:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:23:47,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-12-20 12:23:47,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=5429, Unknown=0, NotChecked=0, Total=6006 [2023-12-20 12:23:47,070 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:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:26:20,678 INFO L93 Difference]: Finished difference Result 27116 states and 33323 transitions. [2023-12-20 12:26:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 331 states. [2023-12-20 12:26:20,679 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:20,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:26:20,700 INFO L225 Difference]: With dead ends: 27116 [2023-12-20 12:26:20,700 INFO L226 Difference]: Without dead ends: 24561 [2023-12-20 12:26:20,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64852 ImplicationChecksByTransitivity, 149.8s TimeCoverageRelationStatistics Valid=22046, Invalid=139156, Unknown=0, NotChecked=0, Total=161202 [2023-12-20 12:26:20,713 INFO L413 NwaCegarLoop]: 1553 mSDtfsCounter, 32742 mSDsluCounter, 36179 mSDsCounter, 0 mSdLazyCounter, 4263 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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.2s IncrementalHoareTripleChecker+Time [2023-12-20 12:26:20,715 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.2s Time] [2023-12-20 12:26:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24561 states. [2023-12-20 12:26:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24561 to 16132. [2023-12-20 12:26:22,939 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:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 20152 transitions. [2023-12-20 12:26:22,955 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 20152 transitions. Word has length 98 [2023-12-20 12:26:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:26:22,956 INFO L495 AbstractCegarLoop]: Abstraction has 16132 states and 20152 transitions. [2023-12-20 12:26:22,956 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:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 20152 transitions. [2023-12-20 12:26:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-20 12:26:22,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:26:22,962 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:22,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-20 12:26:23,166 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:23,167 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:26:23,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:26:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1826687318, now seen corresponding path program 1 times [2023-12-20 12:26:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:26:23,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409912762] [2023-12-20 12:26:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:26:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:26:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:26:24,140 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:24,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:26:24,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409912762] [2023-12-20 12:26:24,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409912762] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:26:24,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628460759] [2023-12-20 12:26:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:26:24,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:26:24,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:26:24,149 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:24,151 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:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:26:24,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-20 12:26:24,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:26:26,484 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:26,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:26:29,689 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:29,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628460759] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:26:29,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:26:29,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 62 [2023-12-20 12:26:29,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917248577] [2023-12-20 12:26:29,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:26:29,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-12-20 12:26:29,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:26:29,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-12-20 12:26:29,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=3489, Unknown=0, NotChecked=0, Total=3782 [2023-12-20 12:26:29,695 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:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:26:43,425 INFO L93 Difference]: Finished difference Result 27431 states and 33500 transitions. [2023-12-20 12:26:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2023-12-20 12:26:43,426 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:43,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:26:43,443 INFO L225 Difference]: With dead ends: 27431 [2023-12-20 12:26:43,443 INFO L226 Difference]: Without dead ends: 22802 [2023-12-20 12:26:43,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10313 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3769, Invalid=28811, Unknown=0, NotChecked=0, Total=32580 [2023-12-20 12:26:43,447 INFO L413 NwaCegarLoop]: 1568 mSDtfsCounter, 21982 mSDsluCounter, 30445 mSDsCounter, 0 mSdLazyCounter, 2807 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2023-12-20 12:26:43,447 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.7s Time] [2023-12-20 12:26:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22802 states. [2023-12-20 12:26:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22802 to 17322. [2023-12-20 12:26:45,850 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:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17322 states to 17322 states and 21595 transitions. [2023-12-20 12:26:45,867 INFO L78 Accepts]: Start accepts. Automaton has 17322 states and 21595 transitions. Word has length 98 [2023-12-20 12:26:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:26:45,867 INFO L495 AbstractCegarLoop]: Abstraction has 17322 states and 21595 transitions. [2023-12-20 12:26:45,867 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:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 17322 states and 21595 transitions. [2023-12-20 12:26:45,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-20 12:26:45,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:26:45,870 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-20 12:26:45,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-20 12:26:46,074 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:46,074 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:26:46,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:26:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1780350672, now seen corresponding path program 1 times [2023-12-20 12:26:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:26:46,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798551498] [2023-12-20 12:26:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:26:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:26:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:26:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 12:26:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:26:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798551498] [2023-12-20 12:26:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798551498] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 12:26:46,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 12:26:46,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 12:26:46,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22646374] [2023-12-20 12:26:46,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 12:26:46,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 12:26:46,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:26:46,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 12:26:46,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:26:46,184 INFO L87 Difference]: Start difference. First operand 17322 states and 21595 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:26:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:26:51,711 INFO L93 Difference]: Finished difference Result 21116 states and 27958 transitions. [2023-12-20 12:26:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 12:26:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2023-12-20 12:26:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:26:51,725 INFO L225 Difference]: With dead ends: 21116 [2023-12-20 12:26:51,725 INFO L226 Difference]: Without dead ends: 18824 [2023-12-20 12:26:51,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-20 12:26:51,728 INFO L413 NwaCegarLoop]: 734 mSDtfsCounter, 751 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 3784 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 4448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-20 12:26:51,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 813 Invalid, 4448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3784 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-20 12:26:51,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18824 states. [2023-12-20 12:26:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18824 to 18073. [2023-12-20 12:26:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18073 states, 18071 states have (on average 1.2366775496652094) internal successors, (22348), 18072 states have internal predecessors, (22348), 0 states have call successors, (0), 0 states 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:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18073 states to 18073 states and 22348 transitions. [2023-12-20 12:26:54,114 INFO L78 Accepts]: Start accepts. Automaton has 18073 states and 22348 transitions. Word has length 131 [2023-12-20 12:26:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:26:54,114 INFO L495 AbstractCegarLoop]: Abstraction has 18073 states and 22348 transitions. [2023-12-20 12:26:54,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 12:26:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 18073 states and 22348 transitions. [2023-12-20 12:26:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-20 12:26:54,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:26:54,117 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:54,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-20 12:26:54,117 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:26:54,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:26:54,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1828032774, now seen corresponding path program 1 times [2023-12-20 12:26:54,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:26:54,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528642013] [2023-12-20 12:26:54,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:26:54,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:26:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:26:54,714 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,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:26:54,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528642013] [2023-12-20 12:26:54,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528642013] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:26:54,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160588060] [2023-12-20 12:26:54,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:26:54,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:26:54,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:26:54,736 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,745 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,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:26:54,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-20 12:26:54,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:26:57,588 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,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:27:09,170 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:09,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160588060] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:27:09,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:27:09,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 36, 36] total 89 [2023-12-20 12:27:09,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409059905] [2023-12-20 12:27:09,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:27:09,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2023-12-20 12:27:09,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:27:09,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2023-12-20 12:27:09,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=6844, Unknown=0, NotChecked=0, Total=7832 [2023-12-20 12:27:09,186 INFO L87 Difference]: Start difference. First operand 18073 states and 22348 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:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:28:10,509 INFO L93 Difference]: Finished difference Result 28471 states and 34774 transitions. [2023-12-20 12:28:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2023-12-20 12:28:10,509 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:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:28:10,531 INFO L225 Difference]: With dead ends: 28471 [2023-12-20 12:28:10,531 INFO L226 Difference]: Without dead ends: 25293 [2023-12-20 12:28:10,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36384 ImplicationChecksByTransitivity, 56.9s TimeCoverageRelationStatistics Valid=12272, Invalid=87900, Unknown=0, NotChecked=0, Total=100172 [2023-12-20 12:28:10,538 INFO L413 NwaCegarLoop]: 1492 mSDtfsCounter, 28110 mSDsluCounter, 38071 mSDsCounter, 0 mSdLazyCounter, 5179 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28110 SdHoareTripleChecker+Valid, 39563 SdHoareTripleChecker+Invalid, 5435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 5179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-20 12:28:10,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28110 Valid, 39563 Invalid, 5435 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [256 Valid, 5179 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-12-20 12:28:10,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25293 states. [2023-12-20 12:28:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25293 to 23360. [2023-12-20 12:28:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23360 states, 23358 states have (on average 1.22912920626766) internal successors, (28710), 23359 states have internal predecessors, (28710), 0 states have call successors, (0), 0 states 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:13,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23360 states to 23360 states and 28710 transitions. [2023-12-20 12:28:13,933 INFO L78 Accepts]: Start accepts. Automaton has 23360 states and 28710 transitions. Word has length 133 [2023-12-20 12:28:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:28:13,934 INFO L495 AbstractCegarLoop]: Abstraction has 23360 states and 28710 transitions. [2023-12-20 12:28:13,934 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:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 23360 states and 28710 transitions. [2023-12-20 12:28:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-20 12:28:13,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:28:13,937 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:13,944 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:14,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:28:14,142 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:28:14,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:28:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1798922262, now seen corresponding path program 1 times [2023-12-20 12:28:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:28:14,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583811469] [2023-12-20 12:28:14,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:28:14,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:28:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:28:14,923 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:14,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:28:14,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583811469] [2023-12-20 12:28:14,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583811469] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:28:14,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181297915] [2023-12-20 12:28:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:28:14,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:28:14,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:28:14,925 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:14,927 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:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:28:15,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-20 12:28:15,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:28:16,620 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:16,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:28:18,905 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,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181297915] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:28:18,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:28:18,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 19] total 57 [2023-12-20 12:28:18,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640816103] [2023-12-20 12:28:18,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:28:18,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-20 12:28:18,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:28:18,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-20 12:28:18,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2897, Unknown=0, NotChecked=0, Total=3192 [2023-12-20 12:28:18,907 INFO L87 Difference]: Start difference. First operand 23360 states and 28710 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:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:28:34,716 INFO L93 Difference]: Finished difference Result 30483 states and 37258 transitions. [2023-12-20 12:28:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2023-12-20 12:28:34,717 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:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:28:34,734 INFO L225 Difference]: With dead ends: 30483 [2023-12-20 12:28:34,734 INFO L226 Difference]: Without dead ends: 20754 [2023-12-20 12:28:34,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17507 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=8771, Invalid=45285, Unknown=0, NotChecked=0, Total=54056 [2023-12-20 12:28:34,742 INFO L413 NwaCegarLoop]: 1478 mSDtfsCounter, 29457 mSDsluCounter, 24023 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29457 SdHoareTripleChecker+Valid, 25501 SdHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-20 12:28:34,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29457 Valid, 25501 Invalid, 2498 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [154 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-20 12:28:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20754 states. [2023-12-20 12:28:37,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20754 to 19436. [2023-12-20 12:28:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19436 states, 19434 states have (on average 1.2357209015128126) internal successors, (24015), 19435 states have internal predecessors, (24015), 0 states have call successors, (0), 0 states 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,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19436 states to 19436 states and 24015 transitions. [2023-12-20 12:28:37,761 INFO L78 Accepts]: Start accepts. Automaton has 19436 states and 24015 transitions. Word has length 134 [2023-12-20 12:28:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:28:37,761 INFO L495 AbstractCegarLoop]: Abstraction has 19436 states and 24015 transitions. [2023-12-20 12:28:37,761 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:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 19436 states and 24015 transitions. [2023-12-20 12:28:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-20 12:28:37,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:28:37,764 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:37,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-20 12:28:37,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:28:37,969 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:28:37,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:28:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1010440518, now seen corresponding path program 1 times [2023-12-20 12:28:37,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:28:37,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573009121] [2023-12-20 12:28:37,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:28:37,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:28:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:28:38,213 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:38,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:28:38,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573009121] [2023-12-20 12:28:38,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573009121] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:28:38,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923851680] [2023-12-20 12:28:38,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:28:38,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:28:38,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:28:38,214 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:38,216 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:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:28:38,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 12:28:38,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:28:38,542 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:38,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:28:38,992 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:38,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923851680] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:28:38,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:28:38,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2023-12-20 12:28:38,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765490194] [2023-12-20 12:28:38,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:28:38,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-20 12:28:38,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:28:38,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-20 12:28:38,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-12-20 12:28:38,994 INFO L87 Difference]: Start difference. First operand 19436 states and 24015 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:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:28:44,374 INFO L93 Difference]: Finished difference Result 44071 states and 53982 transitions. [2023-12-20 12:28:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-20 12:28:44,375 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:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:28:44,401 INFO L225 Difference]: With dead ends: 44071 [2023-12-20 12:28:44,401 INFO L226 Difference]: Without dead ends: 28282 [2023-12-20 12:28:44,407 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:44,407 INFO L413 NwaCegarLoop]: 1517 mSDtfsCounter, 1626 mSDsluCounter, 9202 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 10719 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 12:28:44,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 10719 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 12:28:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28282 states. [2023-12-20 12:28:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28282 to 24030. [2023-12-20 12:28:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24030 states, 24028 states have (on average 1.1885300482770103) internal successors, (28558), 24029 states have internal predecessors, (28558), 0 states have call successors, (0), 0 states 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:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24030 states to 24030 states and 28558 transitions. [2023-12-20 12:28:48,151 INFO L78 Accepts]: Start accepts. Automaton has 24030 states and 28558 transitions. Word has length 134 [2023-12-20 12:28:48,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:28:48,151 INFO L495 AbstractCegarLoop]: Abstraction has 24030 states and 28558 transitions. [2023-12-20 12:28:48,152 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:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 24030 states and 28558 transitions. [2023-12-20 12:28:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-20 12:28:48,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:28:48,154 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:48,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-20 12:28:48,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:28:48,359 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:28:48,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:28:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1587126698, now seen corresponding path program 1 times [2023-12-20 12:28:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:28:48,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716220986] [2023-12-20 12:28:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:28:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:28:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:28:49,902 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:49,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 12:28:49,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716220986] [2023-12-20 12:28:49,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716220986] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 12:28:49,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626649930] [2023-12-20 12:28:49,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:28:49,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 12:28:49,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 12:28:49,904 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:49,906 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:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 12:28:50,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-20 12:28:50,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 12:28:53,166 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:53,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 12:28:59,210 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:59,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626649930] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 12:28:59,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 12:28:59,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 30] total 87 [2023-12-20 12:28:59,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328779906] [2023-12-20 12:28:59,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 12:28:59,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2023-12-20 12:28:59,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 12:28:59,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2023-12-20 12:28:59,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=638, Invalid=6844, Unknown=0, NotChecked=0, Total=7482 [2023-12-20 12:28:59,212 INFO L87 Difference]: Start difference. First operand 24030 states and 28558 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:39,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 12:31:39,416 INFO L93 Difference]: Finished difference Result 45632 states and 53760 transitions. [2023-12-20 12:31:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 409 states. [2023-12-20 12:31:39,417 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:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 12:31:39,446 INFO L225 Difference]: With dead ends: 45632 [2023-12-20 12:31:39,447 INFO L226 Difference]: Without dead ends: 33229 [2023-12-20 12:31:39,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 491 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96093 ImplicationChecksByTransitivity, 150.6s TimeCoverageRelationStatistics Valid=24947, Invalid=217609, Unknown=0, NotChecked=0, Total=242556 [2023-12-20 12:31:39,461 INFO L413 NwaCegarLoop]: 1520 mSDtfsCounter, 56536 mSDsluCounter, 44019 mSDsCounter, 0 mSdLazyCounter, 6505 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56536 SdHoareTripleChecker+Valid, 45539 SdHoareTripleChecker+Invalid, 6898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 6505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-12-20 12:31:39,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56536 Valid, 45539 Invalid, 6898 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [393 Valid, 6505 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2023-12-20 12:31:39,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33229 states. [2023-12-20 12:31:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33229 to 25458. [2023-12-20 12:31:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25458 states, 25456 states have (on average 1.186164362036455) internal successors, (30195), 25457 states have internal predecessors, (30195), 0 states have call successors, (0), 0 states 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:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25458 states to 25458 states and 30195 transitions. [2023-12-20 12:31:43,868 INFO L78 Accepts]: Start accepts. Automaton has 25458 states and 30195 transitions. Word has length 134 [2023-12-20 12:31:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 12:31:43,868 INFO L495 AbstractCegarLoop]: Abstraction has 25458 states and 30195 transitions. [2023-12-20 12:31:43,868 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:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 25458 states and 30195 transitions. [2023-12-20 12:31:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-20 12:31:43,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 12:31:43,870 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:43,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-12-20 12:31:44,072 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,SelfDestructingSolverStorable36 [2023-12-20 12:31:44,072 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 12:31:44,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 12:31:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash 878356736, now seen corresponding path program 1 times [2023-12-20 12:31:44,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 12:31:44,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194605063] [2023-12-20 12:31:44,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 12:31:44,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 12:31:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 12:31:44,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 12:31:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 12:31:44,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 12:31:44,162 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 12:31:44,163 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-20 12:31:44,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-20 12:31:44,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-20 12:31:44,166 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, 1] [2023-12-20 12:31:44,169 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 12:31:44,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 12:31:44 BoogieIcfgContainer [2023-12-20 12:31:44,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 12:31:44,260 INFO L158 Benchmark]: Toolchain (without parser) took 780864.86ms. Allocated memory was 244.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 176.3MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 758.7MB. Max. memory is 8.0GB. [2023-12-20 12:31:44,263 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 12:31:44,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1258.17ms. Allocated memory is still 244.3MB. Free memory was 176.3MB in the beginning and 153.1MB in the end (delta: 23.3MB). Peak memory consumption was 78.8MB. Max. memory is 8.0GB. [2023-12-20 12:31:44,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 324.02ms. Allocated memory was 244.3MB in the beginning and 362.8MB in the end (delta: 118.5MB). Free memory was 153.1MB in the beginning and 254.1MB in the end (delta: -101.0MB). Peak memory consumption was 86.7MB. Max. memory is 8.0GB. [2023-12-20 12:31:44,264 INFO L158 Benchmark]: Boogie Preprocessor took 443.96ms. Allocated memory is still 362.8MB. Free memory was 254.1MB in the beginning and 223.7MB in the end (delta: 30.4MB). Peak memory consumption was 105.9MB. Max. memory is 8.0GB. [2023-12-20 12:31:44,264 INFO L158 Benchmark]: RCFGBuilder took 3341.65ms. Allocated memory was 362.8MB in the beginning and 742.4MB in the end (delta: 379.6MB). Free memory was 223.7MB in the beginning and 584.4MB in the end (delta: -360.7MB). Peak memory consumption was 287.8MB. Max. memory is 8.0GB. [2023-12-20 12:31:44,264 INFO L158 Benchmark]: TraceAbstraction took 775491.13ms. Allocated memory was 742.4MB in the beginning and 2.2GB in the end (delta: 1.5GB). Free memory was 583.3MB in the beginning and 1.4GB in the end (delta: -811.4MB). Peak memory consumption was 667.1MB. Max. memory is 8.0GB. [2023-12-20 12:31:44,265 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1258.17ms. Allocated memory is still 244.3MB. Free memory was 176.3MB in the beginning and 153.1MB in the end (delta: 23.3MB). Peak memory consumption was 78.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 324.02ms. Allocated memory was 244.3MB in the beginning and 362.8MB in the end (delta: 118.5MB). Free memory was 153.1MB in the beginning and 254.1MB in the end (delta: -101.0MB). Peak memory consumption was 86.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 443.96ms. Allocated memory is still 362.8MB. Free memory was 254.1MB in the beginning and 223.7MB in the end (delta: 30.4MB). Peak memory consumption was 105.9MB. Max. memory is 8.0GB. * RCFGBuilder took 3341.65ms. Allocated memory was 362.8MB in the beginning and 742.4MB in the end (delta: 379.6MB). Free memory was 223.7MB in the beginning and 584.4MB in the end (delta: -360.7MB). Peak memory consumption was 287.8MB. Max. memory is 8.0GB. * TraceAbstraction took 775491.13ms. Allocated memory was 742.4MB in the beginning and 2.2GB in the end (delta: 1.5GB). Free memory was 583.3MB in the beginning and 1.4GB in the end (delta: -811.4MB). Peak memory consumption was 667.1MB. 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: 490]: 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.4s, OverallIterations: 38, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 635.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 450331 SdHoareTripleChecker+Valid, 45.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 450331 mSDsluCounter, 523311 SdHoareTripleChecker+Invalid, 40.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 468726 mSDsCounter, 4860 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55861 IncrementalHoareTripleChecker+Invalid, 60721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4860 mSolverCounterUnsat, 54585 mSDtfsCounter, 55861 mSolverCounterSat, 1.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6589 GetRequests, 3085 SyntacticMatches, 10 SemanticMatches, 3494 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358580 ImplicationChecksByTransitivity, 576.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25458occurred in iteration=37, InterpolantAutomatonStates: 2687, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 32.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 74885 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 100.1s InterpolantComputationTime, 4568 NumberOfCodeBlocks, 4568 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 6187 ConstructedInterpolants, 0 QuantifiedInterpolants, 155176 SizeOfPredicates, 197 NumberOfNonLiveVariables, 8209 ConjunctsInSsa, 656 ConjunctsInUnsatCore, 77 InterpolantComputations, 17 PerfectInterpolantSequences, 1857/5616 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:44,417 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...