/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/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 11:24:06,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 11:24:06,806 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-21 11:24:06,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 11:24:06,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 11:24:06,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 11:24:06,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 11:24:06,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 11:24:06,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 11:24:06,844 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 11:24:06,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 11:24:06,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 11:24:06,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 11:24:06,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 11:24:06,846 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 11:24:06,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 11:24:06,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 11:24:06,847 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 11:24:06,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 11:24:06,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 11:24:06,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 11:24:06,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 11:24:06,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 11:24:06,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 11:24:06,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 11:24:06,849 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 11:24:06,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 11:24:06,850 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 11:24:06,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 11:24:06,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 11:24:06,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 11:24:06,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 11:24:06,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:24:06,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 11:24:06,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 11:24:06,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 11:24:06,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 11:24:06,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 11:24:06,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 11:24:06,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 11:24:06,853 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 11:24:06,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 11:24:06,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 11:24:06,853 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-21 11:24:07,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 11:24:07,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 11:24:07,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 11:24:07,053 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 11:24:07,053 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 11:24:07,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2023-12-21 11:24:08,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 11:24:08,210 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 11:24:08,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2023-12-21 11:24:08,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13224da7e/88b271c2edff47ada17a7c476c3850cd/FLAG6fd999aa6 [2023-12-21 11:24:08,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13224da7e/88b271c2edff47ada17a7c476c3850cd [2023-12-21 11:24:08,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 11:24:08,592 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 11:24:08,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 11:24:08,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 11:24:08,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 11:24:08,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e60e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08, skipping insertion in model container [2023-12-21 11:24:08,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,620 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 11:24:08,777 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2023-12-21 11:24:08,780 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:24:08,786 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 11:24:08,835 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2023-12-21 11:24:08,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 11:24:08,846 INFO L206 MainTranslator]: Completed translation [2023-12-21 11:24:08,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08 WrapperNode [2023-12-21 11:24:08,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 11:24:08,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 11:24:08,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 11:24:08,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 11:24:08,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,893 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 412 [2023-12-21 11:24:08,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 11:24:08,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 11:24:08,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 11:24:08,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 11:24:08,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,921 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-21 11:24:08,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 11:24:08,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 11:24:08,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 11:24:08,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 11:24:08,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (1/1) ... [2023-12-21 11:24:08,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 11:24:08,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:08,977 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-21 11:24:08,992 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-21 11:24:09,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 11:24:09,007 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2023-12-21 11:24:09,008 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2023-12-21 11:24:09,008 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-12-21 11:24:09,008 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-12-21 11:24:09,008 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2023-12-21 11:24:09,009 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2023-12-21 11:24:09,009 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2023-12-21 11:24:09,010 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2023-12-21 11:24:09,010 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2023-12-21 11:24:09,010 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2023-12-21 11:24:09,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 11:24:09,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 11:24:09,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 11:24:09,115 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 11:24:09,117 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 11:24:09,457 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 11:24:09,480 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 11:24:09,481 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 11:24:09,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:24:09 BoogieIcfgContainer [2023-12-21 11:24:09,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 11:24:09,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 11:24:09,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 11:24:09,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 11:24:09,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:24:08" (1/3) ... [2023-12-21 11:24:09,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dee504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:24:09, skipping insertion in model container [2023-12-21 11:24:09,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:24:08" (2/3) ... [2023-12-21 11:24:09,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30dee504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:24:09, skipping insertion in model container [2023-12-21 11:24:09,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:24:09" (3/3) ... [2023-12-21 11:24:09,488 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2023-12-21 11:24:09,499 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 11:24:09,500 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 11:24:09,535 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 11:24:09,539 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;@7e2a4dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 11:24:09,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 11:24:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 132 states have (on average 1.621212121212121) internal successors, (214), 136 states have internal predecessors, (214), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-21 11:24:09,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 11:24:09,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:09,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:09,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:09,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash -409509753, now seen corresponding path program 1 times [2023-12-21 11:24:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:09,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171251273] [2023-12-21 11:24:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:09,742 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-21 11:24:09,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:09,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171251273] [2023-12-21 11:24:09,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171251273] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:09,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:09,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:09,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835322811] [2023-12-21 11:24:09,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:09,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:09,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:09,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:09,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:09,777 INFO L87 Difference]: Start difference. First operand has 171 states, 132 states have (on average 1.621212121212121) internal successors, (214), 136 states have internal predecessors, (214), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:24:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:09,887 INFO L93 Difference]: Finished difference Result 348 states and 600 transitions. [2023-12-21 11:24:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:09,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-21 11:24:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:09,896 INFO L225 Difference]: With dead ends: 348 [2023-12-21 11:24:09,896 INFO L226 Difference]: Without dead ends: 177 [2023-12-21 11:24:09,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:09,902 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 18 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:09,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 769 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:24:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-21 11:24:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2023-12-21 11:24:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 139 states have internal predecessors, (211), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-21 11:24:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 275 transitions. [2023-12-21 11:24:09,963 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 275 transitions. Word has length 14 [2023-12-21 11:24:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:09,964 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 275 transitions. [2023-12-21 11:24:09,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:24:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 275 transitions. [2023-12-21 11:24:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 11:24:09,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:09,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:09,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 11:24:09,967 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:09,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:09,968 INFO L85 PathProgramCache]: Analyzing trace with hash 247426362, now seen corresponding path program 1 times [2023-12-21 11:24:09,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:09,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570690057] [2023-12-21 11:24:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,021 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-21 11:24:10,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:10,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570690057] [2023-12-21 11:24:10,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570690057] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:10,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:10,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349420159] [2023-12-21 11:24:10,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:10,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:10,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:10,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:10,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:10,024 INFO L87 Difference]: Start difference. First operand 175 states and 275 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:24:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:10,085 INFO L93 Difference]: Finished difference Result 364 states and 574 transitions. [2023-12-21 11:24:10,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:10,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 11:24:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:10,087 INFO L225 Difference]: With dead ends: 364 [2023-12-21 11:24:10,087 INFO L226 Difference]: Without dead ends: 191 [2023-12-21 11:24:10,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:10,090 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 25 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:10,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 786 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-21 11:24:10,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2023-12-21 11:24:10,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 147 states have (on average 1.530612244897959) internal successors, (225), 150 states have internal predecessors, (225), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-21 11:24:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 291 transitions. [2023-12-21 11:24:10,101 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 291 transitions. Word has length 15 [2023-12-21 11:24:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:10,101 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 291 transitions. [2023-12-21 11:24:10,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 11:24:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 291 transitions. [2023-12-21 11:24:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 11:24:10,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:10,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:10,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 11:24:10,103 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:10,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash 803678296, now seen corresponding path program 1 times [2023-12-21 11:24:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:10,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812553247] [2023-12-21 11:24:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,185 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-21 11:24:10,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:10,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812553247] [2023-12-21 11:24:10,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812553247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:10,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:10,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 11:24:10,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610398512] [2023-12-21 11:24:10,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:10,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 11:24:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:10,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 11:24:10,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 11:24:10,188 INFO L87 Difference]: Start difference. First operand 188 states and 291 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 11:24:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:10,209 INFO L93 Difference]: Finished difference Result 396 states and 620 transitions. [2023-12-21 11:24:10,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 11:24:10,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-12-21 11:24:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:10,214 INFO L225 Difference]: With dead ends: 396 [2023-12-21 11:24:10,214 INFO L226 Difference]: Without dead ends: 217 [2023-12-21 11:24:10,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-21 11:24:10,216 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 22 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:10,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 532 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-12-21 11:24:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 190. [2023-12-21 11:24:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.523489932885906) internal successors, (227), 152 states have internal predecessors, (227), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-21 11:24:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 293 transitions. [2023-12-21 11:24:10,228 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 293 transitions. Word has length 22 [2023-12-21 11:24:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:10,228 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 293 transitions. [2023-12-21 11:24:10,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 11:24:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 293 transitions. [2023-12-21 11:24:10,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-21 11:24:10,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:10,229 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] [2023-12-21 11:24:10,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 11:24:10,230 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:10,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:10,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1522670071, now seen corresponding path program 1 times [2023-12-21 11:24:10,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:10,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097522826] [2023-12-21 11:24:10,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:10,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,291 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-21 11:24:10,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:10,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097522826] [2023-12-21 11:24:10,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097522826] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:10,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:10,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:10,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417660718] [2023-12-21 11:24:10,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:10,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:10,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:10,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:10,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:10,293 INFO L87 Difference]: Start difference. First operand 190 states and 293 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 11:24:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:10,327 INFO L93 Difference]: Finished difference Result 426 states and 674 transitions. [2023-12-21 11:24:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:10,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-12-21 11:24:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:10,329 INFO L225 Difference]: With dead ends: 426 [2023-12-21 11:24:10,329 INFO L226 Difference]: Without dead ends: 286 [2023-12-21 11:24:10,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-21 11:24:10,330 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 119 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:10,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 782 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-12-21 11:24:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 190. [2023-12-21 11:24:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.4966442953020134) internal successors, (223), 152 states have internal predecessors, (223), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-21 11:24:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 289 transitions. [2023-12-21 11:24:10,347 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 289 transitions. Word has length 30 [2023-12-21 11:24:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:10,348 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 289 transitions. [2023-12-21 11:24:10,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 11:24:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 289 transitions. [2023-12-21 11:24:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 11:24:10,349 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:10,349 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:10,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 11:24:10,349 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:10,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:10,350 INFO L85 PathProgramCache]: Analyzing trace with hash -114669019, now seen corresponding path program 1 times [2023-12-21 11:24:10,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:10,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904846728] [2023-12-21 11:24:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:24:10,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:10,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904846728] [2023-12-21 11:24:10,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904846728] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:10,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:10,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:24:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297858812] [2023-12-21 11:24:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:10,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:10,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:10,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:10,410 INFO L87 Difference]: Start difference. First operand 190 states and 289 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 11:24:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:10,434 INFO L93 Difference]: Finished difference Result 371 states and 568 transitions. [2023-12-21 11:24:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:10,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-12-21 11:24:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:10,436 INFO L225 Difference]: With dead ends: 371 [2023-12-21 11:24:10,436 INFO L226 Difference]: Without dead ends: 192 [2023-12-21 11:24:10,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:10,438 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:10,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1040 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-12-21 11:24:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2023-12-21 11:24:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 152 states have internal predecessors, (222), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-21 11:24:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 288 transitions. [2023-12-21 11:24:10,446 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 288 transitions. Word has length 31 [2023-12-21 11:24:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:10,447 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 288 transitions. [2023-12-21 11:24:10,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 11:24:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 288 transitions. [2023-12-21 11:24:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 11:24:10,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:10,448 INFO L195 NwaCegarLoop]: trace histogram [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-21 11:24:10,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 11:24:10,449 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:10,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:10,449 INFO L85 PathProgramCache]: Analyzing trace with hash -793075601, now seen corresponding path program 1 times [2023-12-21 11:24:10,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:10,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978948224] [2023-12-21 11:24:10,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:10,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:24:10,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:10,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978948224] [2023-12-21 11:24:10,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978948224] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:10,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276933113] [2023-12-21 11:24:10,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:10,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:10,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:10,503 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-21 11:24:10,532 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-21 11:24:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:10,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:24:10,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:24:10,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:24:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 11:24:10,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276933113] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:24:10,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:24:10,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-12-21 11:24:10,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595416817] [2023-12-21 11:24:10,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:24:10,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:10,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:10,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:10,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:10,663 INFO L87 Difference]: Start difference. First operand 190 states and 288 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:24:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:10,705 INFO L93 Difference]: Finished difference Result 429 states and 664 transitions. [2023-12-21 11:24:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:10,706 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), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2023-12-21 11:24:10,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:10,707 INFO L225 Difference]: With dead ends: 429 [2023-12-21 11:24:10,707 INFO L226 Difference]: Without dead ends: 249 [2023-12-21 11:24:10,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:10,714 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 76 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:10,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 771 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-12-21 11:24:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 243. [2023-12-21 11:24:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 192 states have (on average 1.4635416666666667) internal successors, (281), 195 states have internal predecessors, (281), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-21 11:24:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 367 transitions. [2023-12-21 11:24:10,730 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 367 transitions. Word has length 34 [2023-12-21 11:24:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:10,730 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 367 transitions. [2023-12-21 11:24:10,730 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), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 11:24:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 367 transitions. [2023-12-21 11:24:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 11:24:10,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:10,733 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-12-21 11:24:10,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 11:24:10,938 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,SelfDestructingSolverStorable5 [2023-12-21 11:24:10,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:10,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2086166001, now seen corresponding path program 2 times [2023-12-21 11:24:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:10,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167216466] [2023-12-21 11:24:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:10,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-21 11:24:11,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:11,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167216466] [2023-12-21 11:24:11,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167216466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:11,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:11,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:11,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049213853] [2023-12-21 11:24:11,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:11,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:11,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:11,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:11,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:11,034 INFO L87 Difference]: Start difference. First operand 243 states and 367 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 11:24:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:11,089 INFO L93 Difference]: Finished difference Result 467 states and 725 transitions. [2023-12-21 11:24:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:11,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2023-12-21 11:24:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:11,094 INFO L225 Difference]: With dead ends: 467 [2023-12-21 11:24:11,094 INFO L226 Difference]: Without dead ends: 252 [2023-12-21 11:24:11,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-21 11:24:11,097 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 19 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:11,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 765 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-12-21 11:24:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2023-12-21 11:24:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 198 states have (on average 1.4595959595959596) internal successors, (289), 201 states have internal predecessors, (289), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-21 11:24:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2023-12-21 11:24:11,114 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 56 [2023-12-21 11:24:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:11,114 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2023-12-21 11:24:11,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 11:24:11,114 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2023-12-21 11:24:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 11:24:11,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:11,115 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2023-12-21 11:24:11,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 11:24:11,116 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:11,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:11,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2063557726, now seen corresponding path program 1 times [2023-12-21 11:24:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:11,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330261184] [2023-12-21 11:24:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:11,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-21 11:24:11,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:11,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330261184] [2023-12-21 11:24:11,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330261184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:11,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:11,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:11,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321619469] [2023-12-21 11:24:11,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:11,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:11,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:11,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:11,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:11,184 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 11:24:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:11,224 INFO L93 Difference]: Finished difference Result 511 states and 777 transitions. [2023-12-21 11:24:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:11,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2023-12-21 11:24:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:11,227 INFO L225 Difference]: With dead ends: 511 [2023-12-21 11:24:11,227 INFO L226 Difference]: Without dead ends: 289 [2023-12-21 11:24:11,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-21 11:24:11,228 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 24 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:11,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 778 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:11,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-12-21 11:24:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2023-12-21 11:24:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 230 states have (on average 1.4173913043478261) internal successors, (326), 233 states have internal predecessors, (326), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 11:24:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 418 transitions. [2023-12-21 11:24:11,244 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 418 transitions. Word has length 56 [2023-12-21 11:24:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:11,244 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 418 transitions. [2023-12-21 11:24:11,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 11:24:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 418 transitions. [2023-12-21 11:24:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 11:24:11,245 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:11,245 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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-21 11:24:11,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 11:24:11,245 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:11,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:11,246 INFO L85 PathProgramCache]: Analyzing trace with hash 648603620, now seen corresponding path program 1 times [2023-12-21 11:24:11,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:11,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636956163] [2023-12-21 11:24:11,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:11,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-21 11:24:11,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:11,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636956163] [2023-12-21 11:24:11,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636956163] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:11,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:11,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:24:11,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899381597] [2023-12-21 11:24:11,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:11,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:11,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:11,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:11,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:11,330 INFO L87 Difference]: Start difference. First operand 286 states and 418 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 11:24:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:11,354 INFO L93 Difference]: Finished difference Result 522 states and 776 transitions. [2023-12-21 11:24:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:11,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2023-12-21 11:24:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:11,357 INFO L225 Difference]: With dead ends: 522 [2023-12-21 11:24:11,357 INFO L226 Difference]: Without dead ends: 288 [2023-12-21 11:24:11,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:11,359 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:11,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1039 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:11,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-12-21 11:24:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2023-12-21 11:24:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 230 states have (on average 1.4043478260869566) internal successors, (323), 233 states have internal predecessors, (323), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-21 11:24:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 415 transitions. [2023-12-21 11:24:11,369 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 415 transitions. Word has length 74 [2023-12-21 11:24:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:11,369 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 415 transitions. [2023-12-21 11:24:11,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 11:24:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 415 transitions. [2023-12-21 11:24:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-21 11:24:11,370 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:11,370 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:11,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 11:24:11,370 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:11,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:11,370 INFO L85 PathProgramCache]: Analyzing trace with hash -77908722, now seen corresponding path program 1 times [2023-12-21 11:24:11,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:11,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655300980] [2023-12-21 11:24:11,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:11,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-12-21 11:24:11,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:11,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655300980] [2023-12-21 11:24:11,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655300980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:11,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:11,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:11,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478604374] [2023-12-21 11:24:11,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:11,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:11,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:11,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:11,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:11,469 INFO L87 Difference]: Start difference. First operand 286 states and 415 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 11:24:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:11,517 INFO L93 Difference]: Finished difference Result 559 states and 832 transitions. [2023-12-21 11:24:11,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:11,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2023-12-21 11:24:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:11,519 INFO L225 Difference]: With dead ends: 559 [2023-12-21 11:24:11,519 INFO L226 Difference]: Without dead ends: 330 [2023-12-21 11:24:11,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-21 11:24:11,521 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 25 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:11,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 778 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-12-21 11:24:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2023-12-21 11:24:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 267 states have (on average 1.3670411985018727) internal successors, (365), 270 states have internal predecessors, (365), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2023-12-21 11:24:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 463 transitions. [2023-12-21 11:24:11,538 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 463 transitions. Word has length 103 [2023-12-21 11:24:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:11,538 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 463 transitions. [2023-12-21 11:24:11,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 11:24:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 463 transitions. [2023-12-21 11:24:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-21 11:24:11,542 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:11,542 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:11,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 11:24:11,542 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:11,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:11,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1056143899, now seen corresponding path program 1 times [2023-12-21 11:24:11,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:11,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595842269] [2023-12-21 11:24:11,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:11,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-12-21 11:24:11,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595842269] [2023-12-21 11:24:11,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595842269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:11,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:11,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:11,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533765869] [2023-12-21 11:24:11,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:11,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:11,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:11,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:11,652 INFO L87 Difference]: Start difference. First operand 327 states and 463 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 11:24:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:11,685 INFO L93 Difference]: Finished difference Result 585 states and 852 transitions. [2023-12-21 11:24:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:24:11,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2023-12-21 11:24:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:11,687 INFO L225 Difference]: With dead ends: 585 [2023-12-21 11:24:11,688 INFO L226 Difference]: Without dead ends: 321 [2023-12-21 11:24:11,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-21 11:24:11,689 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 15 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:11,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 738 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-12-21 11:24:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2023-12-21 11:24:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 265 states have internal predecessors, (353), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-21 11:24:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 449 transitions. [2023-12-21 11:24:11,701 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 449 transitions. Word has length 104 [2023-12-21 11:24:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:11,702 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 449 transitions. [2023-12-21 11:24:11,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-21 11:24:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 449 transitions. [2023-12-21 11:24:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-21 11:24:11,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:11,703 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:11,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 11:24:11,704 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:11,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1309382448, now seen corresponding path program 1 times [2023-12-21 11:24:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131915878] [2023-12-21 11:24:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2023-12-21 11:24:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131915878] [2023-12-21 11:24:11,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131915878] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:11,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:11,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:24:11,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830805161] [2023-12-21 11:24:11,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:11,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:11,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:11,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:11,792 INFO L87 Difference]: Start difference. First operand 321 states and 449 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 11:24:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:11,813 INFO L93 Difference]: Finished difference Result 560 states and 801 transitions. [2023-12-21 11:24:11,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:11,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 123 [2023-12-21 11:24:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:11,815 INFO L225 Difference]: With dead ends: 560 [2023-12-21 11:24:11,815 INFO L226 Difference]: Without dead ends: 323 [2023-12-21 11:24:11,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:11,816 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 0 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:11,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1023 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:11,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-12-21 11:24:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2023-12-21 11:24:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 262 states have (on average 1.3358778625954197) internal successors, (350), 265 states have internal predecessors, (350), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-21 11:24:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 446 transitions. [2023-12-21 11:24:11,825 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 446 transitions. Word has length 123 [2023-12-21 11:24:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:11,825 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 446 transitions. [2023-12-21 11:24:11,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 11:24:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 446 transitions. [2023-12-21 11:24:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-21 11:24:11,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:11,826 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-21 11:24:11,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 11:24:11,827 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:11,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1299230210, now seen corresponding path program 1 times [2023-12-21 11:24:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52735837] [2023-12-21 11:24:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2023-12-21 11:24:11,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:11,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52735837] [2023-12-21 11:24:11,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52735837] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:11,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:11,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144386724] [2023-12-21 11:24:11,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:11,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:11,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:11,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:11,906 INFO L87 Difference]: Start difference. First operand 321 states and 446 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 11:24:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:11,942 INFO L93 Difference]: Finished difference Result 523 states and 761 transitions. [2023-12-21 11:24:11,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:24:11,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 156 [2023-12-21 11:24:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:11,944 INFO L225 Difference]: With dead ends: 523 [2023-12-21 11:24:11,944 INFO L226 Difference]: Without dead ends: 319 [2023-12-21 11:24:11,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-21 11:24:11,945 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 13 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:11,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 706 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-21 11:24:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2023-12-21 11:24:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 261 states have (on average 1.3333333333333333) internal successors, (348), 264 states have internal predecessors, (348), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-21 11:24:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 442 transitions. [2023-12-21 11:24:11,954 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 442 transitions. Word has length 156 [2023-12-21 11:24:11,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:11,954 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 442 transitions. [2023-12-21 11:24:11,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-21 11:24:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 442 transitions. [2023-12-21 11:24:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-21 11:24:11,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:11,956 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:11,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 11:24:11,957 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:11,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:11,957 INFO L85 PathProgramCache]: Analyzing trace with hash -45969848, now seen corresponding path program 1 times [2023-12-21 11:24:11,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:11,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487578262] [2023-12-21 11:24:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2023-12-21 11:24:12,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487578262] [2023-12-21 11:24:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487578262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:12,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:12,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054210226] [2023-12-21 11:24:12,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:12,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:12,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:12,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:12,078 INFO L87 Difference]: Start difference. First operand 319 states and 442 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 11:24:12,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:12,118 INFO L93 Difference]: Finished difference Result 463 states and 657 transitions. [2023-12-21 11:24:12,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:12,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 171 [2023-12-21 11:24:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:12,120 INFO L225 Difference]: With dead ends: 463 [2023-12-21 11:24:12,120 INFO L226 Difference]: Without dead ends: 302 [2023-12-21 11:24:12,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-21 11:24:12,121 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 35 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:12,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 687 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-12-21 11:24:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2023-12-21 11:24:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 247 states have (on average 1.3238866396761133) internal successors, (327), 250 states have internal predecessors, (327), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-21 11:24:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 415 transitions. [2023-12-21 11:24:12,130 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 415 transitions. Word has length 171 [2023-12-21 11:24:12,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:12,130 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 415 transitions. [2023-12-21 11:24:12,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 11:24:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 415 transitions. [2023-12-21 11:24:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-21 11:24:12,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:12,131 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:12,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 11:24:12,132 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:12,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2144494445, now seen corresponding path program 1 times [2023-12-21 11:24:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:12,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146025717] [2023-12-21 11:24:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2023-12-21 11:24:12,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:12,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146025717] [2023-12-21 11:24:12,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146025717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:12,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:12,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:12,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792565458] [2023-12-21 11:24:12,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:12,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:12,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:12,217 INFO L87 Difference]: Start difference. First operand 302 states and 415 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 11:24:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:12,261 INFO L93 Difference]: Finished difference Result 446 states and 630 transitions. [2023-12-21 11:24:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:12,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 173 [2023-12-21 11:24:12,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:12,263 INFO L225 Difference]: With dead ends: 446 [2023-12-21 11:24:12,263 INFO L226 Difference]: Without dead ends: 283 [2023-12-21 11:24:12,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-21 11:24:12,265 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 30 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:12,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 691 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-12-21 11:24:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2023-12-21 11:24:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 231 states have (on average 1.316017316017316) internal successors, (304), 234 states have internal predecessors, (304), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-21 11:24:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 386 transitions. [2023-12-21 11:24:12,273 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 386 transitions. Word has length 173 [2023-12-21 11:24:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:12,273 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 386 transitions. [2023-12-21 11:24:12,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 11:24:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 386 transitions. [2023-12-21 11:24:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-21 11:24:12,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:12,274 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:12,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 11:24:12,275 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:12,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash -307436632, now seen corresponding path program 1 times [2023-12-21 11:24:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:12,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623598628] [2023-12-21 11:24:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2023-12-21 11:24:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:12,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623598628] [2023-12-21 11:24:12,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623598628] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:12,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:12,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:24:12,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067885846] [2023-12-21 11:24:12,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:12,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:12,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:12,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:12,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:12,372 INFO L87 Difference]: Start difference. First operand 283 states and 386 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 11:24:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:12,389 INFO L93 Difference]: Finished difference Result 426 states and 600 transitions. [2023-12-21 11:24:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:12,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 174 [2023-12-21 11:24:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:12,390 INFO L225 Difference]: With dead ends: 426 [2023-12-21 11:24:12,390 INFO L226 Difference]: Without dead ends: 283 [2023-12-21 11:24:12,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:12,391 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:12,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1001 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-12-21 11:24:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2023-12-21 11:24:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 231 states have (on average 1.29004329004329) internal successors, (298), 234 states have internal predecessors, (298), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-21 11:24:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 380 transitions. [2023-12-21 11:24:12,400 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 380 transitions. Word has length 174 [2023-12-21 11:24:12,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:12,400 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 380 transitions. [2023-12-21 11:24:12,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 11:24:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 380 transitions. [2023-12-21 11:24:12,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-21 11:24:12,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:12,402 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-21 11:24:12,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 11:24:12,402 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:12,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2068374447, now seen corresponding path program 1 times [2023-12-21 11:24:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:12,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322660486] [2023-12-21 11:24:12,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:12,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-12-21 11:24:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:12,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322660486] [2023-12-21 11:24:12,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322660486] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:12,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836478837] [2023-12-21 11:24:12,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:12,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:12,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:12,507 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-21 11:24:12,536 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-21 11:24:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:12,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:24:12,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-12-21 11:24:12,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:24:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-12-21 11:24:12,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836478837] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:12,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-21 11:24:12,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2023-12-21 11:24:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653993999] [2023-12-21 11:24:12,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:12,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:12,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:12,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:12,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:12,749 INFO L87 Difference]: Start difference. First operand 283 states and 380 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-21 11:24:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:12,780 INFO L93 Difference]: Finished difference Result 447 states and 622 transitions. [2023-12-21 11:24:12,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:24:12,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 181 [2023-12-21 11:24:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:12,781 INFO L225 Difference]: With dead ends: 447 [2023-12-21 11:24:12,782 INFO L226 Difference]: Without dead ends: 262 [2023-12-21 11:24:12,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 386 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-21 11:24:12,782 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 30 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:12,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 473 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-12-21 11:24:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2023-12-21 11:24:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.2816901408450705) internal successors, (273), 216 states have internal predecessors, (273), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-21 11:24:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 349 transitions. [2023-12-21 11:24:12,791 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 349 transitions. Word has length 181 [2023-12-21 11:24:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:12,791 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 349 transitions. [2023-12-21 11:24:12,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-21 11:24:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 349 transitions. [2023-12-21 11:24:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-21 11:24:12,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:12,793 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-21 11:24:12,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-21 11:24:13,008 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-21 11:24:13,009 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:13,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:13,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2082007262, now seen corresponding path program 1 times [2023-12-21 11:24:13,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587681850] [2023-12-21 11:24:13,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:13,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-12-21 11:24:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:13,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587681850] [2023-12-21 11:24:13,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587681850] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:13,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:13,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:13,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545825997] [2023-12-21 11:24:13,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:13,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:13,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:13,099 INFO L87 Difference]: Start difference. First operand 262 states and 349 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 11:24:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:13,123 INFO L93 Difference]: Finished difference Result 404 states and 564 transitions. [2023-12-21 11:24:13,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:13,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 205 [2023-12-21 11:24:13,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:13,125 INFO L225 Difference]: With dead ends: 404 [2023-12-21 11:24:13,125 INFO L226 Difference]: Without dead ends: 268 [2023-12-21 11:24:13,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-21 11:24:13,126 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 6 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:13,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 731 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:13,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-12-21 11:24:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2023-12-21 11:24:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 216 states have (on average 1.2777777777777777) internal successors, (276), 219 states have internal predecessors, (276), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-21 11:24:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 352 transitions. [2023-12-21 11:24:13,136 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 352 transitions. Word has length 205 [2023-12-21 11:24:13,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:13,136 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 352 transitions. [2023-12-21 11:24:13,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 11:24:13,136 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 352 transitions. [2023-12-21 11:24:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-21 11:24:13,138 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:13,138 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:13,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 11:24:13,139 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:13,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash -629101218, now seen corresponding path program 1 times [2023-12-21 11:24:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:13,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486380513] [2023-12-21 11:24:13,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-12-21 11:24:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:13,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486380513] [2023-12-21 11:24:13,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486380513] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:13,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401036983] [2023-12-21 11:24:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:13,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:13,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:13,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 11:24:13,288 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-21 11:24:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:24:13,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-12-21 11:24:13,401 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401036983] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:13,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-21 11:24:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909945892] [2023-12-21 11:24:13,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:13,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:13,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:13,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:13,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:13,403 INFO L87 Difference]: Start difference. First operand 266 states and 352 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-21 11:24:13,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:13,427 INFO L93 Difference]: Finished difference Result 413 states and 571 transitions. [2023-12-21 11:24:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:13,428 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), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 212 [2023-12-21 11:24:13,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:13,429 INFO L225 Difference]: With dead ends: 413 [2023-12-21 11:24:13,429 INFO L226 Difference]: Without dead ends: 273 [2023-12-21 11:24:13,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:24:13,430 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 7 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:13,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 736 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-12-21 11:24:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2023-12-21 11:24:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 220 states have (on average 1.2727272727272727) internal successors, (280), 223 states have internal predecessors, (280), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-21 11:24:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 356 transitions. [2023-12-21 11:24:13,438 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 356 transitions. Word has length 212 [2023-12-21 11:24:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:13,438 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 356 transitions. [2023-12-21 11:24:13,438 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), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-21 11:24:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 356 transitions. [2023-12-21 11:24:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-12-21 11:24:13,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:13,440 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:13,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 11:24:13,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:13,648 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:13,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1700211501, now seen corresponding path program 1 times [2023-12-21 11:24:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:13,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668747379] [2023-12-21 11:24:13,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:13,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:24:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2023-12-21 11:24:13,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668747379] [2023-12-21 11:24:13,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668747379] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052602363] [2023-12-21 11:24:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:13,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:13,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:13,762 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-21 11:24:13,765 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-21 11:24:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:13,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:24:13,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2023-12-21 11:24:13,912 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:13,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052602363] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:13,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:13,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-21 11:24:13,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870509972] [2023-12-21 11:24:13,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:13,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:13,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:13,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:13,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:13,913 INFO L87 Difference]: Start difference. First operand 271 states and 356 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 11:24:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:13,939 INFO L93 Difference]: Finished difference Result 415 states and 569 transitions. [2023-12-21 11:24:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:24:13,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 220 [2023-12-21 11:24:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:13,941 INFO L225 Difference]: With dead ends: 415 [2023-12-21 11:24:13,941 INFO L226 Difference]: Without dead ends: 270 [2023-12-21 11:24:13,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:24:13,942 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 7 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:13,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 722 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-21 11:24:13,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2023-12-21 11:24:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 220 states have (on average 1.259090909090909) internal successors, (277), 222 states have internal predecessors, (277), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-12-21 11:24:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 351 transitions. [2023-12-21 11:24:13,953 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 351 transitions. Word has length 220 [2023-12-21 11:24:13,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:13,953 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 351 transitions. [2023-12-21 11:24:13,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 11:24:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 351 transitions. [2023-12-21 11:24:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-21 11:24:13,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:13,955 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:13,966 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-21 11:24:14,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:14,161 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:14,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:14,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1538712576, now seen corresponding path program 1 times [2023-12-21 11:24:14,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:14,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975656369] [2023-12-21 11:24:14,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:24:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 11:24:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2023-12-21 11:24:14,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:14,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975656369] [2023-12-21 11:24:14,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975656369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:14,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:14,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:14,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588172762] [2023-12-21 11:24:14,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:14,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:14,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:14,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:14,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:14,339 INFO L87 Difference]: Start difference. First operand 270 states and 351 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 11:24:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:14,515 INFO L93 Difference]: Finished difference Result 413 states and 558 transitions. [2023-12-21 11:24:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:24:14,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 227 [2023-12-21 11:24:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:14,517 INFO L225 Difference]: With dead ends: 413 [2023-12-21 11:24:14,517 INFO L226 Difference]: Without dead ends: 269 [2023-12-21 11:24:14,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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-21 11:24:14,518 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 60 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:14,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 467 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:24:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-12-21 11:24:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2023-12-21 11:24:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 220 states have (on average 1.2545454545454546) internal successors, (276), 221 states have internal predecessors, (276), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-21 11:24:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 348 transitions. [2023-12-21 11:24:14,532 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 348 transitions. Word has length 227 [2023-12-21 11:24:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:14,533 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 348 transitions. [2023-12-21 11:24:14,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 11:24:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 348 transitions. [2023-12-21 11:24:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-21 11:24:14,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:14,536 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:14,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 11:24:14,536 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:14,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1032392993, now seen corresponding path program 1 times [2023-12-21 11:24:14,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:14,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670454606] [2023-12-21 11:24:14,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:14,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:24:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 11:24:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2023-12-21 11:24:14,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:14,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670454606] [2023-12-21 11:24:14,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670454606] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:14,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:14,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:24:14,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021881899] [2023-12-21 11:24:14,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:14,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:14,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:14,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:14,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:14,736 INFO L87 Difference]: Start difference. First operand 269 states and 348 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-21 11:24:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:15,078 INFO L93 Difference]: Finished difference Result 617 states and 826 transitions. [2023-12-21 11:24:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 11:24:15,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 230 [2023-12-21 11:24:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:15,081 INFO L225 Difference]: With dead ends: 617 [2023-12-21 11:24:15,081 INFO L226 Difference]: Without dead ends: 474 [2023-12-21 11:24:15,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:24:15,083 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 403 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:15,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 617 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:24:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-12-21 11:24:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 420. [2023-12-21 11:24:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 341 states have (on average 1.3020527859237536) internal successors, (444), 343 states have internal predecessors, (444), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 11:24:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 552 transitions. [2023-12-21 11:24:15,100 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 552 transitions. Word has length 230 [2023-12-21 11:24:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:15,100 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 552 transitions. [2023-12-21 11:24:15,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-21 11:24:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 552 transitions. [2023-12-21 11:24:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-21 11:24:15,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:15,102 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:15,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 11:24:15,102 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:15,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:15,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1253081541, now seen corresponding path program 1 times [2023-12-21 11:24:15,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:15,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292952926] [2023-12-21 11:24:15,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:15,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:24:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 11:24:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-12-21 11:24:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-21 11:24:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-12-21 11:24:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2023-12-21 11:24:15,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:15,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292952926] [2023-12-21 11:24:15,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292952926] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:15,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:15,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:15,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512729443] [2023-12-21 11:24:15,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:15,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:15,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:15,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:15,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:15,245 INFO L87 Difference]: Start difference. First operand 420 states and 552 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 11:24:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:15,525 INFO L93 Difference]: Finished difference Result 886 states and 1218 transitions. [2023-12-21 11:24:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:15,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 256 [2023-12-21 11:24:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:15,528 INFO L225 Difference]: With dead ends: 886 [2023-12-21 11:24:15,528 INFO L226 Difference]: Without dead ends: 660 [2023-12-21 11:24:15,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-21 11:24:15,529 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 219 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:15,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 464 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:24:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2023-12-21 11:24:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 498. [2023-12-21 11:24:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 409 states have (on average 1.312958435207824) internal successors, (537), 412 states have internal predecessors, (537), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2023-12-21 11:24:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 655 transitions. [2023-12-21 11:24:15,563 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 655 transitions. Word has length 256 [2023-12-21 11:24:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:15,564 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 655 transitions. [2023-12-21 11:24:15,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 11:24:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 655 transitions. [2023-12-21 11:24:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-12-21 11:24:15,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:15,565 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:15,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-21 11:24:15,566 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:15,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash 377452701, now seen corresponding path program 1 times [2023-12-21 11:24:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:15,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221966037] [2023-12-21 11:24:15,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:24:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 11:24:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-12-21 11:24:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-21 11:24:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-21 11:24:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2023-12-21 11:24:15,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221966037] [2023-12-21 11:24:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221966037] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:15,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:15,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:15,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225085090] [2023-12-21 11:24:15,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:15,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:15,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:15,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:15,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:15,722 INFO L87 Difference]: Start difference. First operand 498 states and 655 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 11:24:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:15,986 INFO L93 Difference]: Finished difference Result 1054 states and 1443 transitions. [2023-12-21 11:24:15,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:15,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 257 [2023-12-21 11:24:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:15,989 INFO L225 Difference]: With dead ends: 1054 [2023-12-21 11:24:15,990 INFO L226 Difference]: Without dead ends: 779 [2023-12-21 11:24:15,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-21 11:24:15,991 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 220 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:15,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 492 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:24:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2023-12-21 11:24:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 604. [2023-12-21 11:24:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 503 states have (on average 1.3260437375745526) internal successors, (667), 508 states have internal predecessors, (667), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2023-12-21 11:24:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 797 transitions. [2023-12-21 11:24:16,022 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 797 transitions. Word has length 257 [2023-12-21 11:24:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:16,022 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 797 transitions. [2023-12-21 11:24:16,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 11:24:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 797 transitions. [2023-12-21 11:24:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-21 11:24:16,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:16,025 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:16,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-21 11:24:16,026 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:16,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1837145120, now seen corresponding path program 1 times [2023-12-21 11:24:16,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:16,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184328029] [2023-12-21 11:24:16,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:24:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 11:24:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-21 11:24:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-12-21 11:24:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2023-12-21 11:24:16,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:16,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184328029] [2023-12-21 11:24:16,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184328029] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:16,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:16,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024858260] [2023-12-21 11:24:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:16,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:16,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:16,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:16,132 INFO L87 Difference]: Start difference. First operand 604 states and 797 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 11:24:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:16,415 INFO L93 Difference]: Finished difference Result 1258 states and 1725 transitions. [2023-12-21 11:24:16,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:16,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 258 [2023-12-21 11:24:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:16,419 INFO L225 Difference]: With dead ends: 1258 [2023-12-21 11:24:16,419 INFO L226 Difference]: Without dead ends: 909 [2023-12-21 11:24:16,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-21 11:24:16,420 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 220 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:16,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 519 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:24:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2023-12-21 11:24:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 706. [2023-12-21 11:24:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 597 states have (on average 1.3450586264656617) internal successors, (803), 606 states have internal predecessors, (803), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-21 11:24:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 941 transitions. [2023-12-21 11:24:16,458 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 941 transitions. Word has length 258 [2023-12-21 11:24:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:16,459 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 941 transitions. [2023-12-21 11:24:16,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 11:24:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 941 transitions. [2023-12-21 11:24:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-21 11:24:16,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:16,461 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:16,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-21 11:24:16,462 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:16,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2111904734, now seen corresponding path program 1 times [2023-12-21 11:24:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685328810] [2023-12-21 11:24:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:24:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 11:24:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-21 11:24:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-21 11:24:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-12-21 11:24:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2023-12-21 11:24:16,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:16,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685328810] [2023-12-21 11:24:16,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685328810] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:16,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202236594] [2023-12-21 11:24:16,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:16,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:16,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:16,635 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-21 11:24:16,660 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-21 11:24:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:16,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:24:16,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2023-12-21 11:24:16,824 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202236594] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:16,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:16,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-12-21 11:24:16,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451079885] [2023-12-21 11:24:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:16,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:16,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:16,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-21 11:24:16,825 INFO L87 Difference]: Start difference. First operand 706 states and 941 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 11:24:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:16,911 INFO L93 Difference]: Finished difference Result 1161 states and 1589 transitions. [2023-12-21 11:24:16,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:16,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 258 [2023-12-21 11:24:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:16,914 INFO L225 Difference]: With dead ends: 1161 [2023-12-21 11:24:16,914 INFO L226 Difference]: Without dead ends: 706 [2023-12-21 11:24:16,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-21 11:24:16,915 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 51 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:16,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 639 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2023-12-21 11:24:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2023-12-21 11:24:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 597 states have (on average 1.3350083752093802) internal successors, (797), 606 states have internal predecessors, (797), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-21 11:24:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 935 transitions. [2023-12-21 11:24:16,964 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 935 transitions. Word has length 258 [2023-12-21 11:24:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:16,965 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 935 transitions. [2023-12-21 11:24:16,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 11:24:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 935 transitions. [2023-12-21 11:24:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-12-21 11:24:16,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:16,967 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:16,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 11:24:17,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-21 11:24:17,173 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:17,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:17,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1894713939, now seen corresponding path program 1 times [2023-12-21 11:24:17,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:17,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505442488] [2023-12-21 11:24:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:17,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:24:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 11:24:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-21 11:24:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-21 11:24:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-12-21 11:24:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2023-12-21 11:24:17,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:17,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505442488] [2023-12-21 11:24:17,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505442488] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:17,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569189988] [2023-12-21 11:24:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:17,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:17,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:17,349 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-21 11:24:17,372 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-21 11:24:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 11:24:17,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2023-12-21 11:24:17,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:17,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569189988] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:17,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:17,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-12-21 11:24:17,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476586729] [2023-12-21 11:24:17,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:17,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:17,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:17,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:17,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-21 11:24:17,525 INFO L87 Difference]: Start difference. First operand 706 states and 935 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 11:24:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:17,590 INFO L93 Difference]: Finished difference Result 1161 states and 1575 transitions. [2023-12-21 11:24:17,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:17,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 259 [2023-12-21 11:24:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:17,593 INFO L225 Difference]: With dead ends: 1161 [2023-12-21 11:24:17,593 INFO L226 Difference]: Without dead ends: 718 [2023-12-21 11:24:17,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-21 11:24:17,595 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 15 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:17,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 662 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:17,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2023-12-21 11:24:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2023-12-21 11:24:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 607 states have (on average 1.3360790774299836) internal successors, (811), 616 states have internal predecessors, (811), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-21 11:24:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 949 transitions. [2023-12-21 11:24:17,634 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 949 transitions. Word has length 259 [2023-12-21 11:24:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:17,634 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 949 transitions. [2023-12-21 11:24:17,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 11:24:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 949 transitions. [2023-12-21 11:24:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2023-12-21 11:24:17,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:17,637 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:17,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 11:24:17,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-21 11:24:17,843 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:17,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash 710936248, now seen corresponding path program 1 times [2023-12-21 11:24:17,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:17,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544681256] [2023-12-21 11:24:17,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:17,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:17,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:24:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 11:24:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-21 11:24:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-21 11:24:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-21 11:24:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2023-12-21 11:24:18,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:18,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544681256] [2023-12-21 11:24:18,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544681256] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:18,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:18,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:24:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135114835] [2023-12-21 11:24:18,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:18,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:18,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:18,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:18,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:24:18,031 INFO L87 Difference]: Start difference. First operand 718 states and 949 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 11:24:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:18,202 INFO L93 Difference]: Finished difference Result 1175 states and 1589 transitions. [2023-12-21 11:24:18,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:24:18,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 260 [2023-12-21 11:24:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:18,205 INFO L225 Difference]: With dead ends: 1175 [2023-12-21 11:24:18,205 INFO L226 Difference]: Without dead ends: 700 [2023-12-21 11:24:18,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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-21 11:24:18,208 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 59 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:18,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 465 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:24:18,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2023-12-21 11:24:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2023-12-21 11:24:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 590 states have (on average 1.3186440677966103) internal successors, (778), 598 states have internal predecessors, (778), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-21 11:24:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 915 transitions. [2023-12-21 11:24:18,235 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 915 transitions. Word has length 260 [2023-12-21 11:24:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:18,236 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 915 transitions. [2023-12-21 11:24:18,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-21 11:24:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 915 transitions. [2023-12-21 11:24:18,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2023-12-21 11:24:18,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:18,237 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:18,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-21 11:24:18,237 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:18,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:18,237 INFO L85 PathProgramCache]: Analyzing trace with hash -648363165, now seen corresponding path program 1 times [2023-12-21 11:24:18,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:18,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633829270] [2023-12-21 11:24:18,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:18,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 11:24:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 11:24:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:24:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-21 11:24:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2023-12-21 11:24:18,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:18,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633829270] [2023-12-21 11:24:18,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633829270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:18,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:18,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:24:18,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248874661] [2023-12-21 11:24:18,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:18,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:24:18,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:18,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:24:18,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:24:18,497 INFO L87 Difference]: Start difference. First operand 700 states and 915 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 11:24:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:18,895 INFO L93 Difference]: Finished difference Result 1007 states and 1393 transitions. [2023-12-21 11:24:18,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 11:24:18,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 261 [2023-12-21 11:24:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:18,899 INFO L225 Difference]: With dead ends: 1007 [2023-12-21 11:24:18,899 INFO L226 Difference]: Without dead ends: 1005 [2023-12-21 11:24:18,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-21 11:24:18,899 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 237 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:18,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1460 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:24:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2023-12-21 11:24:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 706. [2023-12-21 11:24:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 594 states have (on average 1.3164983164983164) internal successors, (782), 603 states have internal predecessors, (782), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-21 11:24:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 921 transitions. [2023-12-21 11:24:18,930 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 921 transitions. Word has length 261 [2023-12-21 11:24:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:18,930 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 921 transitions. [2023-12-21 11:24:18,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-21 11:24:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 921 transitions. [2023-12-21 11:24:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2023-12-21 11:24:18,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:18,931 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:18,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-21 11:24:18,932 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:18,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:18,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1275808175, now seen corresponding path program 1 times [2023-12-21 11:24:18,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:18,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595338788] [2023-12-21 11:24:18,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:18,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 11:24:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 11:24:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:24:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-21 11:24:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-21 11:24:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2023-12-21 11:24:19,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:19,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595338788] [2023-12-21 11:24:19,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595338788] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:19,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003684252] [2023-12-21 11:24:19,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:19,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:19,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:19,144 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-21 11:24:19,172 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-21 11:24:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:19,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 11:24:19,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2023-12-21 11:24:19,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:24:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2023-12-21 11:24:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003684252] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:24:19,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:24:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2023-12-21 11:24:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812042934] [2023-12-21 11:24:19,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:24:19,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-21 11:24:19,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:19,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-21 11:24:19,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-12-21 11:24:19,716 INFO L87 Difference]: Start difference. First operand 706 states and 921 transitions. Second operand has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 14 states have internal predecessors, (143), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2023-12-21 11:24:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:21,022 INFO L93 Difference]: Finished difference Result 1744 states and 2386 transitions. [2023-12-21 11:24:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 11:24:21,023 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 14 states have internal predecessors, (143), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 269 [2023-12-21 11:24:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:21,028 INFO L225 Difference]: With dead ends: 1744 [2023-12-21 11:24:21,028 INFO L226 Difference]: Without dead ends: 1299 [2023-12-21 11:24:21,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 580 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 11:24:21,030 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 408 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:21,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 2230 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 11:24:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2023-12-21 11:24:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 967. [2023-12-21 11:24:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 815 states have (on average 1.2993865030674847) internal successors, (1059), 825 states have internal predecessors, (1059), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2023-12-21 11:24:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1251 transitions. [2023-12-21 11:24:21,122 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1251 transitions. Word has length 269 [2023-12-21 11:24:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:21,122 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1251 transitions. [2023-12-21 11:24:21,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 14 states have internal predecessors, (143), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2023-12-21 11:24:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1251 transitions. [2023-12-21 11:24:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2023-12-21 11:24:21,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:21,125 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:21,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-21 11:24:21,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:21,335 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:21,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:21,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2057545104, now seen corresponding path program 1 times [2023-12-21 11:24:21,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:21,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098046253] [2023-12-21 11:24:21,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:21,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 11:24:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 11:24:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:24:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-21 11:24:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-21 11:24:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2023-12-21 11:24:21,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:21,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098046253] [2023-12-21 11:24:21,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098046253] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:21,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929654687] [2023-12-21 11:24:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:21,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:21,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:21,450 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-21 11:24:21,464 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-21 11:24:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:21,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:24:21,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2023-12-21 11:24:21,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:21,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929654687] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:21,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:21,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-21 11:24:21,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165281576] [2023-12-21 11:24:21,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:21,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:21,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:21,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:21,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:21,627 INFO L87 Difference]: Start difference. First operand 967 states and 1251 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 11:24:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:21,699 INFO L93 Difference]: Finished difference Result 1798 states and 2367 transitions. [2023-12-21 11:24:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:21,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 269 [2023-12-21 11:24:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:21,703 INFO L225 Difference]: With dead ends: 1798 [2023-12-21 11:24:21,703 INFO L226 Difference]: Without dead ends: 951 [2023-12-21 11:24:21,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:24:21,705 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 11 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:21,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 659 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:21,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2023-12-21 11:24:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2023-12-21 11:24:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 804 states have (on average 1.287313432835821) internal successors, (1035), 814 states have internal predecessors, (1035), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2023-12-21 11:24:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1218 transitions. [2023-12-21 11:24:21,746 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1218 transitions. Word has length 269 [2023-12-21 11:24:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:21,746 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1218 transitions. [2023-12-21 11:24:21,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 11:24:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1218 transitions. [2023-12-21 11:24:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2023-12-21 11:24:21,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:21,748 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:21,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-21 11:24:21,958 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,SelfDestructingSolverStorable30 [2023-12-21 11:24:21,959 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:21,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:21,959 INFO L85 PathProgramCache]: Analyzing trace with hash -629738955, now seen corresponding path program 1 times [2023-12-21 11:24:21,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:21,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938435415] [2023-12-21 11:24:21,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:21,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-21 11:24:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 11:24:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-21 11:24:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-12-21 11:24:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-12-21 11:24:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-12-21 11:24:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 11:24:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-21 11:24:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-21 11:24:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2023-12-21 11:24:22,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:22,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938435415] [2023-12-21 11:24:22,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938435415] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:22,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136653022] [2023-12-21 11:24:22,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:22,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:22,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:22,128 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-21 11:24:22,148 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-21 11:24:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:24:22,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2023-12-21 11:24:22,303 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:22,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136653022] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:22,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:22,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-21 11:24:22,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855791455] [2023-12-21 11:24:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:22,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:24:22,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:22,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:24:22,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:22,304 INFO L87 Difference]: Start difference. First operand 951 states and 1218 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-21 11:24:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:22,379 INFO L93 Difference]: Finished difference Result 1646 states and 2151 transitions. [2023-12-21 11:24:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:24:22,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 272 [2023-12-21 11:24:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:22,383 INFO L225 Difference]: With dead ends: 1646 [2023-12-21 11:24:22,383 INFO L226 Difference]: Without dead ends: 806 [2023-12-21 11:24:22,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:24:22,386 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 8 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:22,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 662 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:24:22,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2023-12-21 11:24:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2023-12-21 11:24:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 677 states have (on average 1.2880354505169866) internal successors, (872), 687 states have internal predecessors, (872), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-21 11:24:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1033 transitions. [2023-12-21 11:24:22,425 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1033 transitions. Word has length 272 [2023-12-21 11:24:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:22,425 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1033 transitions. [2023-12-21 11:24:22,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-21 11:24:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1033 transitions. [2023-12-21 11:24:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2023-12-21 11:24:22,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:22,427 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:22,433 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-21 11:24:22,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:22,633 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:22,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:22,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2123303412, now seen corresponding path program 1 times [2023-12-21 11:24:22,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:22,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325789805] [2023-12-21 11:24:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:22,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:22,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 11:24:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 11:24:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:24:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-21 11:24:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-12-21 11:24:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-12-21 11:24:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-21 11:24:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 16 proven. 146 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2023-12-21 11:24:23,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:23,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325789805] [2023-12-21 11:24:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325789805] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:23,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383526299] [2023-12-21 11:24:23,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:23,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:23,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:23,246 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-21 11:24:23,264 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-21 11:24:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:23,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 11:24:23,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2023-12-21 11:24:23,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:23,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383526299] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:23,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:23,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2023-12-21 11:24:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042724749] [2023-12-21 11:24:23,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:23,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 11:24:23,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:23,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 11:24:23,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2023-12-21 11:24:23,555 INFO L87 Difference]: Start difference. First operand 806 states and 1033 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 7 states have internal predecessors, (103), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-21 11:24:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:23,787 INFO L93 Difference]: Finished difference Result 1539 states and 1999 transitions. [2023-12-21 11:24:23,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:24:23,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 7 states have internal predecessors, (103), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 284 [2023-12-21 11:24:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:23,793 INFO L225 Difference]: With dead ends: 1539 [2023-12-21 11:24:23,793 INFO L226 Difference]: Without dead ends: 1087 [2023-12-21 11:24:23,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2023-12-21 11:24:23,795 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 133 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:23,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1700 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:24:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2023-12-21 11:24:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 961. [2023-12-21 11:24:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 804 states have (on average 1.2823383084577114) internal successors, (1031), 815 states have internal predecessors, (1031), 99 states have call successors, (99), 58 states have call predecessors, (99), 57 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2023-12-21 11:24:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1228 transitions. [2023-12-21 11:24:23,856 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1228 transitions. Word has length 284 [2023-12-21 11:24:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:23,857 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 1228 transitions. [2023-12-21 11:24:23,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 7 states have internal predecessors, (103), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-21 11:24:23,857 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1228 transitions. [2023-12-21 11:24:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2023-12-21 11:24:23,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:23,859 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:23,865 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-21 11:24:24,064 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,SelfDestructingSolverStorable32 [2023-12-21 11:24:24,064 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:24,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:24,065 INFO L85 PathProgramCache]: Analyzing trace with hash 678129265, now seen corresponding path program 1 times [2023-12-21 11:24:24,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:24,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801690047] [2023-12-21 11:24:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:24,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 11:24:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 11:24:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:24:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-21 11:24:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-21 11:24:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-21 11:24:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-21 11:24:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2023-12-21 11:24:24,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:24,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801690047] [2023-12-21 11:24:24,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801690047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:24,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:24,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 11:24:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400881246] [2023-12-21 11:24:24,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:24,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 11:24:24,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:24,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 11:24:24,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:24:24,214 INFO L87 Difference]: Start difference. First operand 961 states and 1228 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 11:24:24,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:24,645 INFO L93 Difference]: Finished difference Result 1895 states and 2575 transitions. [2023-12-21 11:24:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:24:24,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 290 [2023-12-21 11:24:24,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:24,650 INFO L225 Difference]: With dead ends: 1895 [2023-12-21 11:24:24,650 INFO L226 Difference]: Without dead ends: 1273 [2023-12-21 11:24:24,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 11:24:24,652 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 182 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:24,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1204 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:24:24,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2023-12-21 11:24:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1016. [2023-12-21 11:24:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 847 states have (on average 1.2927981109799291) internal successors, (1095), 858 states have internal predecessors, (1095), 111 states have call successors, (111), 58 states have call predecessors, (111), 57 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2023-12-21 11:24:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1316 transitions. [2023-12-21 11:24:24,706 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1316 transitions. Word has length 290 [2023-12-21 11:24:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:24,706 INFO L495 AbstractCegarLoop]: Abstraction has 1016 states and 1316 transitions. [2023-12-21 11:24:24,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 11:24:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1316 transitions. [2023-12-21 11:24:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2023-12-21 11:24:24,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:24,708 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:24,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-21 11:24:24,708 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:24,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:24,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1152285715, now seen corresponding path program 1 times [2023-12-21 11:24:24,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:24,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19986030] [2023-12-21 11:24:24,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:24,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 11:24:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 11:24:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:24:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-21 11:24:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-21 11:24:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-21 11:24:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-21 11:24:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 11:24:25,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:25,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19986030] [2023-12-21 11:24:25,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19986030] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363993692] [2023-12-21 11:24:25,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:25,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:25,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:25,039 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-21 11:24:25,064 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-21 11:24:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:25,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 11:24:25,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2023-12-21 11:24:25,346 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:25,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363993692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:25,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:25,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 17 [2023-12-21 11:24:25,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165300971] [2023-12-21 11:24:25,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:25,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 11:24:25,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:25,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 11:24:25,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2023-12-21 11:24:25,348 INFO L87 Difference]: Start difference. First operand 1016 states and 1316 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 11:24:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:25,878 INFO L93 Difference]: Finished difference Result 2480 states and 3290 transitions. [2023-12-21 11:24:25,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 11:24:25,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 290 [2023-12-21 11:24:25,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:25,884 INFO L225 Difference]: With dead ends: 2480 [2023-12-21 11:24:25,885 INFO L226 Difference]: Without dead ends: 1804 [2023-12-21 11:24:25,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2023-12-21 11:24:25,887 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 765 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:25,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 2436 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 11:24:25,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2023-12-21 11:24:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1185. [2023-12-21 11:24:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 984 states have (on average 1.285569105691057) internal successors, (1265), 997 states have internal predecessors, (1265), 133 states have call successors, (133), 68 states have call predecessors, (133), 67 states have return successors, (132), 126 states have call predecessors, (132), 132 states have call successors, (132) [2023-12-21 11:24:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1530 transitions. [2023-12-21 11:24:25,959 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1530 transitions. Word has length 290 [2023-12-21 11:24:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:25,960 INFO L495 AbstractCegarLoop]: Abstraction has 1185 states and 1530 transitions. [2023-12-21 11:24:25,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2023-12-21 11:24:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1530 transitions. [2023-12-21 11:24:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2023-12-21 11:24:25,961 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:25,961 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:25,968 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-21 11:24:26,168 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,SelfDestructingSolverStorable34 [2023-12-21 11:24:26,169 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:26,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:26,169 INFO L85 PathProgramCache]: Analyzing trace with hash -265230867, now seen corresponding path program 1 times [2023-12-21 11:24:26,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:26,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855005242] [2023-12-21 11:24:26,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:26,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 11:24:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 11:24:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:24:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-21 11:24:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-21 11:24:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-12-21 11:24:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-21 11:24:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 11:24:26,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:26,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855005242] [2023-12-21 11:24:26,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855005242] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:26,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861318991] [2023-12-21 11:24:26,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:26,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:26,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:26,424 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-21 11:24:26,428 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-21 11:24:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:26,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 11:24:26,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2023-12-21 11:24:26,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:24:26,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861318991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:26,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:24:26,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2023-12-21 11:24:26,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599889130] [2023-12-21 11:24:26,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:26,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 11:24:26,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:26,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 11:24:26,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-12-21 11:24:26,669 INFO L87 Difference]: Start difference. First operand 1185 states and 1530 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-21 11:24:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:26,954 INFO L93 Difference]: Finished difference Result 2279 states and 3022 transitions. [2023-12-21 11:24:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 11:24:26,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 290 [2023-12-21 11:24:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:26,959 INFO L225 Difference]: With dead ends: 2279 [2023-12-21 11:24:26,959 INFO L226 Difference]: Without dead ends: 1431 [2023-12-21 11:24:26,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-12-21 11:24:26,961 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 180 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 2108 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:26,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 2108 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 11:24:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2023-12-21 11:24:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1163. [2023-12-21 11:24:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 968 states have (on average 1.28099173553719) internal successors, (1240), 981 states have internal predecessors, (1240), 127 states have call successors, (127), 68 states have call predecessors, (127), 67 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2023-12-21 11:24:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1493 transitions. [2023-12-21 11:24:27,022 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1493 transitions. Word has length 290 [2023-12-21 11:24:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:27,022 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1493 transitions. [2023-12-21 11:24:27,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-21 11:24:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1493 transitions. [2023-12-21 11:24:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2023-12-21 11:24:27,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:27,024 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:27,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-21 11:24:27,229 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,SelfDestructingSolverStorable35 [2023-12-21 11:24:27,230 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:27,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash -948675796, now seen corresponding path program 1 times [2023-12-21 11:24:27,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:27,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126622552] [2023-12-21 11:24:27,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:27,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 11:24:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 11:24:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:24:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-21 11:24:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-12-21 11:24:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2023-12-21 11:24:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-21 11:24:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-12-21 11:24:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2023-12-21 11:24:27,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:27,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126622552] [2023-12-21 11:24:27,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126622552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:24:27,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:24:27,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 11:24:27,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366269857] [2023-12-21 11:24:27,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:24:27,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 11:24:27,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:27,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 11:24:27,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:24:27,343 INFO L87 Difference]: Start difference. First operand 1163 states and 1493 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 11:24:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:27,800 INFO L93 Difference]: Finished difference Result 1920 states and 2486 transitions. [2023-12-21 11:24:27,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 11:24:27,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 298 [2023-12-21 11:24:27,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:27,804 INFO L225 Difference]: With dead ends: 1920 [2023-12-21 11:24:27,804 INFO L226 Difference]: Without dead ends: 1106 [2023-12-21 11:24:27,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 11:24:27,806 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 477 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:27,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 750 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 11:24:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2023-12-21 11:24:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 869. [2023-12-21 11:24:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 738 states have (on average 1.2560975609756098) internal successors, (927), 741 states have internal predecessors, (927), 85 states have call successors, (85), 45 states have call predecessors, (85), 45 states have return successors, (85), 82 states have call predecessors, (85), 85 states have call successors, (85) [2023-12-21 11:24:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1097 transitions. [2023-12-21 11:24:27,844 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1097 transitions. Word has length 298 [2023-12-21 11:24:27,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:27,845 INFO L495 AbstractCegarLoop]: Abstraction has 869 states and 1097 transitions. [2023-12-21 11:24:27,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-21 11:24:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1097 transitions. [2023-12-21 11:24:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2023-12-21 11:24:27,847 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:27,847 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 11:24:27,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-21 11:24:27,847 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:27,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:27,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1441935166, now seen corresponding path program 1 times [2023-12-21 11:24:27,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:27,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056351686] [2023-12-21 11:24:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:27,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 11:24:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-21 11:24:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-12-21 11:24:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-21 11:24:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-12-21 11:24:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2023-12-21 11:24:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2023-12-21 11:24:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-21 11:24:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-12-21 11:24:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2023-12-21 11:24:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2023-12-21 11:24:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2023-12-21 11:24:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2023-12-21 11:24:28,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:28,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056351686] [2023-12-21 11:24:28,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056351686] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:28,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445069217] [2023-12-21 11:24:28,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:28,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:28,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:28,537 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-21 11:24:28,552 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-21 11:24:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:28,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-21 11:24:28,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 224 proven. 74 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2023-12-21 11:24:29,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:24:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 34 proven. 70 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2023-12-21 11:24:29,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445069217] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:24:29,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:24:29,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2023-12-21 11:24:29,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899221326] [2023-12-21 11:24:29,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:24:29,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 11:24:29,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:29,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 11:24:29,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 11:24:29,572 INFO L87 Difference]: Start difference. First operand 869 states and 1097 transitions. Second operand has 34 states, 34 states have (on average 7.117647058823529) internal successors, (242), 29 states have internal predecessors, (242), 9 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) [2023-12-21 11:24:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:24:49,162 INFO L93 Difference]: Finished difference Result 8501 states and 11474 transitions. [2023-12-21 11:24:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 405 states. [2023-12-21 11:24:49,162 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.117647058823529) internal successors, (242), 29 states have internal predecessors, (242), 9 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) Word has length 337 [2023-12-21 11:24:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:24:49,191 INFO L225 Difference]: With dead ends: 8501 [2023-12-21 11:24:49,191 INFO L226 Difference]: Without dead ends: 7925 [2023-12-21 11:24:49,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1167 GetRequests, 725 SyntacticMatches, 8 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80121 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=13037, Invalid=176623, Unknown=0, NotChecked=0, Total=189660 [2023-12-21 11:24:49,215 INFO L413 NwaCegarLoop]: 683 mSDtfsCounter, 6798 mSDsluCounter, 12271 mSDsCounter, 0 mSdLazyCounter, 12160 mSolverCounterSat, 1912 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6798 SdHoareTripleChecker+Valid, 12954 SdHoareTripleChecker+Invalid, 14072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1912 IncrementalHoareTripleChecker+Valid, 12160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-21 11:24:49,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6798 Valid, 12954 Invalid, 14072 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1912 Valid, 12160 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-12-21 11:24:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7925 states. [2023-12-21 11:24:49,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7925 to 3489. [2023-12-21 11:24:49,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3489 states, 2811 states have (on average 1.262895766631092) internal successors, (3550), 2844 states have internal predecessors, (3550), 456 states have call successors, (456), 203 states have call predecessors, (456), 221 states have return successors, (483), 441 states have call predecessors, (483), 456 states have call successors, (483) [2023-12-21 11:24:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 4489 transitions. [2023-12-21 11:24:49,503 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 4489 transitions. Word has length 337 [2023-12-21 11:24:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:24:49,503 INFO L495 AbstractCegarLoop]: Abstraction has 3489 states and 4489 transitions. [2023-12-21 11:24:49,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.117647058823529) internal successors, (242), 29 states have internal predecessors, (242), 9 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) [2023-12-21 11:24:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 4489 transitions. [2023-12-21 11:24:49,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2023-12-21 11:24:49,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:24:49,511 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:24:49,522 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-21 11:24:49,717 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,SelfDestructingSolverStorable37 [2023-12-21 11:24:49,718 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:24:49,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:24:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2049863081, now seen corresponding path program 1 times [2023-12-21 11:24:49,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:24:49,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90697180] [2023-12-21 11:24:49,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:49,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:24:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:24:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:24:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:24:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:24:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:24:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:24:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:24:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:24:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:24:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:24:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:24:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:24:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:24:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:24:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:24:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:24:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:24:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:24:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-21 11:24:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-21 11:24:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-21 11:24:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-21 11:24:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-21 11:24:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-21 11:24:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2023-12-21 11:24:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-12-21 11:24:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-12-21 11:24:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2023-12-21 11:24:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2023-12-21 11:24:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2023-12-21 11:24:50,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:24:50,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90697180] [2023-12-21 11:24:50,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90697180] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:24:50,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717792209] [2023-12-21 11:24:50,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:24:50,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:24:50,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:24:50,614 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-21 11:24:50,617 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-21 11:24:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:24:50,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-21 11:24:50,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:24:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 190 proven. 101 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2023-12-21 11:24:51,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:24:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 33 proven. 68 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2023-12-21 11:24:51,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717792209] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:24:51,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:24:51,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 35 [2023-12-21 11:24:51,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362073811] [2023-12-21 11:24:51,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:24:51,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-21 11:24:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:24:51,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-21 11:24:51,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1099, Unknown=0, NotChecked=0, Total=1190 [2023-12-21 11:24:51,627 INFO L87 Difference]: Start difference. First operand 3489 states and 4489 transitions. Second operand has 35 states, 35 states have (on average 6.942857142857143) internal successors, (243), 30 states have internal predecessors, (243), 10 states have call successors, (54), 9 states have call predecessors, (54), 14 states have return successors, (54), 14 states have call predecessors, (54), 10 states have call successors, (54) [2023-12-21 11:25:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:25:24,677 INFO L93 Difference]: Finished difference Result 15240 states and 19651 transitions. [2023-12-21 11:25:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 418 states. [2023-12-21 11:25:24,678 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.942857142857143) internal successors, (243), 30 states have internal predecessors, (243), 10 states have call successors, (54), 9 states have call predecessors, (54), 14 states have return successors, (54), 14 states have call predecessors, (54), 10 states have call successors, (54) Word has length 338 [2023-12-21 11:25:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:25:24,712 INFO L225 Difference]: With dead ends: 15240 [2023-12-21 11:25:24,712 INFO L226 Difference]: Without dead ends: 12231 [2023-12-21 11:25:24,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1182 GetRequests, 732 SyntacticMatches, 1 SemanticMatches, 449 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85677 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=14265, Invalid=188685, Unknown=0, NotChecked=0, Total=202950 [2023-12-21 11:25:24,728 INFO L413 NwaCegarLoop]: 813 mSDtfsCounter, 6326 mSDsluCounter, 13867 mSDsCounter, 0 mSdLazyCounter, 17462 mSolverCounterSat, 1773 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6326 SdHoareTripleChecker+Valid, 14680 SdHoareTripleChecker+Invalid, 19235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1773 IncrementalHoareTripleChecker+Valid, 17462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-12-21 11:25:24,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6326 Valid, 14680 Invalid, 19235 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1773 Valid, 17462 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2023-12-21 11:25:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12231 states. [2023-12-21 11:25:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12231 to 4005. [2023-12-21 11:25:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4005 states, 3284 states have (on average 1.2490864799025578) internal successors, (4102), 3324 states have internal predecessors, (4102), 451 states have call successors, (451), 244 states have call predecessors, (451), 269 states have return successors, (486), 436 states have call predecessors, (486), 451 states have call successors, (486) [2023-12-21 11:25:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 5039 transitions. [2023-12-21 11:25:25,229 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 5039 transitions. Word has length 338 [2023-12-21 11:25:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:25:25,229 INFO L495 AbstractCegarLoop]: Abstraction has 4005 states and 5039 transitions. [2023-12-21 11:25:25,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.942857142857143) internal successors, (243), 30 states have internal predecessors, (243), 10 states have call successors, (54), 9 states have call predecessors, (54), 14 states have return successors, (54), 14 states have call predecessors, (54), 10 states have call successors, (54) [2023-12-21 11:25:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 5039 transitions. [2023-12-21 11:25:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2023-12-21 11:25:25,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:25:25,237 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-21 11:25:25,246 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-21 11:25:25,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:25:25,444 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:25:25,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:25:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash 49511652, now seen corresponding path program 1 times [2023-12-21 11:25:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:25:25,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788554103] [2023-12-21 11:25:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:25:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:25:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:25:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:25:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:25:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:25:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:25:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:25:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:25:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:25:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:25:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:25:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:25:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:25:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:25:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:25:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:25:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:25:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-21 11:25:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-21 11:25:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-21 11:25:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-21 11:25:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-21 11:25:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-21 11:25:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2023-12-21 11:25:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-12-21 11:25:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-12-21 11:25:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2023-12-21 11:25:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2023-12-21 11:25:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,572 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2023-12-21 11:25:25,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:25:25,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788554103] [2023-12-21 11:25:25,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788554103] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:25:25,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030376501] [2023-12-21 11:25:25,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:25,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:25:25,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:25:25,574 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-21 11:25:25,576 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-21 11:25:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:25,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:25:25,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:25:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2023-12-21 11:25:25,801 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:25:25,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030376501] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:25:25,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:25:25,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-21 11:25:25,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875509856] [2023-12-21 11:25:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:25:25,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:25:25,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:25:25,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:25:25,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:25:25,803 INFO L87 Difference]: Start difference. First operand 4005 states and 5039 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-21 11:25:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:25:26,281 INFO L93 Difference]: Finished difference Result 8144 states and 10232 transitions. [2023-12-21 11:25:26,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:25:26,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 338 [2023-12-21 11:25:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:25:26,291 INFO L225 Difference]: With dead ends: 8144 [2023-12-21 11:25:26,291 INFO L226 Difference]: Without dead ends: 3935 [2023-12-21 11:25:26,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:25:26,298 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 40 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:25:26,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 618 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:25:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3935 states. [2023-12-21 11:25:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3935 to 3935. [2023-12-21 11:25:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3239 states have (on average 1.216116085211485) internal successors, (3939), 3264 states have internal predecessors, (3939), 451 states have call successors, (451), 244 states have call predecessors, (451), 244 states have return successors, (451), 426 states have call predecessors, (451), 451 states have call successors, (451) [2023-12-21 11:25:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 4841 transitions. [2023-12-21 11:25:26,745 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 4841 transitions. Word has length 338 [2023-12-21 11:25:26,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:25:26,745 INFO L495 AbstractCegarLoop]: Abstraction has 3935 states and 4841 transitions. [2023-12-21 11:25:26,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-21 11:25:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 4841 transitions. [2023-12-21 11:25:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2023-12-21 11:25:26,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:25:26,759 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:25:26,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-21 11:25:26,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-12-21 11:25:26,965 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:25:26,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:25:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1286221910, now seen corresponding path program 1 times [2023-12-21 11:25:26,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:25:26,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859558753] [2023-12-21 11:25:26,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:26,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:25:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:25:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:25:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:25:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:25:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:25:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:25:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:25:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:25:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:25:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:25:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:25:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:25:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:25:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:25:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:25:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-21 11:25:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-12-21 11:25:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-21 11:25:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-21 11:25:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-12-21 11:25:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-12-21 11:25:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-21 11:25:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-12-21 11:25:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2023-12-21 11:25:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-12-21 11:25:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-12-21 11:25:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2023-12-21 11:25:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-12-21 11:25:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2023-12-21 11:25:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2023-12-21 11:25:27,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:25:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859558753] [2023-12-21 11:25:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859558753] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:25:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814470439] [2023-12-21 11:25:27,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:27,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:25:27,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:25:27,612 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-21 11:25:27,614 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-21 11:25:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:27,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-21 11:25:27,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:25:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 321 proven. 118 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2023-12-21 11:25:28,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:25:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 44 proven. 204 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2023-12-21 11:25:28,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814470439] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:25:28,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:25:28,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 18] total 40 [2023-12-21 11:25:28,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513513932] [2023-12-21 11:25:28,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:25:28,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-21 11:25:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:25:28,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-21 11:25:28,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1455, Unknown=0, NotChecked=0, Total=1560 [2023-12-21 11:25:28,769 INFO L87 Difference]: Start difference. First operand 3935 states and 4841 transitions. Second operand has 40 states, 39 states have (on average 7.435897435897436) internal successors, (290), 34 states have internal predecessors, (290), 12 states have call successors, (65), 10 states have call predecessors, (65), 12 states have return successors, (66), 15 states have call predecessors, (66), 11 states have call successors, (66) [2023-12-21 11:25:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:25:46,584 INFO L93 Difference]: Finished difference Result 27171 states and 36431 transitions. [2023-12-21 11:25:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 319 states. [2023-12-21 11:25:46,585 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 7.435897435897436) internal successors, (290), 34 states have internal predecessors, (290), 12 states have call successors, (65), 10 states have call predecessors, (65), 12 states have return successors, (66), 15 states have call predecessors, (66), 11 states have call successors, (66) Word has length 348 [2023-12-21 11:25:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:25:46,662 INFO L225 Difference]: With dead ends: 27171 [2023-12-21 11:25:46,662 INFO L226 Difference]: Without dead ends: 23799 [2023-12-21 11:25:46,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1111 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51357 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=7686, Invalid=118694, Unknown=0, NotChecked=0, Total=126380 [2023-12-21 11:25:46,682 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 6244 mSDsluCounter, 11931 mSDsCounter, 0 mSdLazyCounter, 10602 mSolverCounterSat, 1651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6257 SdHoareTripleChecker+Valid, 12369 SdHoareTripleChecker+Invalid, 12253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1651 IncrementalHoareTripleChecker+Valid, 10602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-21 11:25:46,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6257 Valid, 12369 Invalid, 12253 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1651 Valid, 10602 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-21 11:25:46,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23799 states. [2023-12-21 11:25:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23799 to 4334. [2023-12-21 11:25:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4334 states, 3584 states have (on average 1.2087053571428572) internal successors, (4332), 3609 states have internal predecessors, (4332), 480 states have call successors, (480), 267 states have call predecessors, (480), 269 states have return successors, (484), 457 states have call predecessors, (484), 480 states have call successors, (484) [2023-12-21 11:25:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4334 states to 4334 states and 5296 transitions. [2023-12-21 11:25:47,522 INFO L78 Accepts]: Start accepts. Automaton has 4334 states and 5296 transitions. Word has length 348 [2023-12-21 11:25:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:25:47,522 INFO L495 AbstractCegarLoop]: Abstraction has 4334 states and 5296 transitions. [2023-12-21 11:25:47,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 7.435897435897436) internal successors, (290), 34 states have internal predecessors, (290), 12 states have call successors, (65), 10 states have call predecessors, (65), 12 states have return successors, (66), 15 states have call predecessors, (66), 11 states have call successors, (66) [2023-12-21 11:25:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4334 states and 5296 transitions. [2023-12-21 11:25:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2023-12-21 11:25:47,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:25:47,532 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:25:47,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-21 11:25:47,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:25:47,738 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:25:47,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:25:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1713555860, now seen corresponding path program 1 times [2023-12-21 11:25:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:25:47,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458489317] [2023-12-21 11:25:47,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:47,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:25:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:25:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:25:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 11:25:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-21 11:25:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 11:25:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:25:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:25:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:25:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 11:25:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:25:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:25:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-12-21 11:25:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:25:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:25:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-21 11:25:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-21 11:25:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:25:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-21 11:25:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-21 11:25:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-21 11:25:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-12-21 11:25:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2023-12-21 11:25:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-12-21 11:25:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-12-21 11:25:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2023-12-21 11:25:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2023-12-21 11:25:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2023-12-21 11:25:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2023-12-21 11:25:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2023-12-21 11:25:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2023-12-21 11:25:47,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:25:47,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458489317] [2023-12-21 11:25:47,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458489317] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:25:47,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030110307] [2023-12-21 11:25:47,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:47,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:25:47,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:25:47,855 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-21 11:25:47,857 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-21 11:25:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:48,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 11:25:48,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:25:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 940 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2023-12-21 11:25:48,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 11:25:48,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030110307] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:25:48,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 11:25:48,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-12-21 11:25:48,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011672745] [2023-12-21 11:25:48,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:25:48,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:25:48,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:25:48,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:25:48,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 11:25:48,077 INFO L87 Difference]: Start difference. First operand 4334 states and 5296 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-21 11:25:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:25:48,610 INFO L93 Difference]: Finished difference Result 8271 states and 10138 transitions. [2023-12-21 11:25:48,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 11:25:48,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 352 [2023-12-21 11:25:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:25:48,622 INFO L225 Difference]: With dead ends: 8271 [2023-12-21 11:25:48,622 INFO L226 Difference]: Without dead ends: 3937 [2023-12-21 11:25:48,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 11:25:48,627 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 28 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 11:25:48,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 625 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 11:25:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2023-12-21 11:25:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3937. [2023-12-21 11:25:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3937 states, 3240 states have (on average 1.2135802469135804) internal successors, (3932), 3265 states have internal predecessors, (3932), 451 states have call successors, (451), 245 states have call predecessors, (451), 245 states have return successors, (451), 426 states have call predecessors, (451), 451 states have call successors, (451) [2023-12-21 11:25:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 4834 transitions. [2023-12-21 11:25:49,092 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 4834 transitions. Word has length 352 [2023-12-21 11:25:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:25:49,092 INFO L495 AbstractCegarLoop]: Abstraction has 3937 states and 4834 transitions. [2023-12-21 11:25:49,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-21 11:25:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 4834 transitions. [2023-12-21 11:25:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2023-12-21 11:25:49,100 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:25:49,100 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:25:49,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-21 11:25:49,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:25:49,304 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:25:49,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:25:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1636753079, now seen corresponding path program 1 times [2023-12-21 11:25:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:25:49,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957210899] [2023-12-21 11:25:49,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:49,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:25:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:25:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:25:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:25:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:25:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:25:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:25:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:25:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:25:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:25:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:25:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:25:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:25:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:25:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:25:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:25:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:25:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:25:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 11:25:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 11:25:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-21 11:25:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-21 11:25:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-21 11:25:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2023-12-21 11:25:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2023-12-21 11:25:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2023-12-21 11:25:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2023-12-21 11:25:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2023-12-21 11:25:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2023-12-21 11:25:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2023-12-21 11:25:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2023-12-21 11:25:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-12-21 11:25:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 50 proven. 48 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2023-12-21 11:25:49,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:25:49,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957210899] [2023-12-21 11:25:49,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957210899] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:25:49,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23667333] [2023-12-21 11:25:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:25:49,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:25:49,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:25:49,852 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-21 11:25:49,856 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-21 11:25:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:25:50,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-21 11:25:50,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:25:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 466 proven. 227 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2023-12-21 11:25:50,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:25:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 100 proven. 194 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2023-12-21 11:25:51,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23667333] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:25:51,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:25:51,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27, 22] total 57 [2023-12-21 11:25:51,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739844285] [2023-12-21 11:25:51,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:25:51,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-21 11:25:51,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:25:51,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-21 11:25:51,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2954, Unknown=0, NotChecked=0, Total=3192 [2023-12-21 11:25:51,928 INFO L87 Difference]: Start difference. First operand 3937 states and 4834 transitions. Second operand has 57 states, 57 states have (on average 6.7368421052631575) internal successors, (384), 48 states have internal predecessors, (384), 16 states have call successors, (67), 13 states have call predecessors, (67), 23 states have return successors, (72), 23 states have call predecessors, (72), 16 states have call successors, (72) [2023-12-21 11:26:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:26:09,881 INFO L93 Difference]: Finished difference Result 20621 states and 25676 transitions. [2023-12-21 11:26:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2023-12-21 11:26:09,881 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 6.7368421052631575) internal successors, (384), 48 states have internal predecessors, (384), 16 states have call successors, (67), 13 states have call predecessors, (67), 23 states have return successors, (72), 23 states have call predecessors, (72), 16 states have call successors, (72) Word has length 359 [2023-12-21 11:26:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:26:09,918 INFO L225 Difference]: With dead ends: 20621 [2023-12-21 11:26:09,918 INFO L226 Difference]: Without dead ends: 17075 [2023-12-21 11:26:09,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1027 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23047 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=5703, Invalid=60603, Unknown=0, NotChecked=0, Total=66306 [2023-12-21 11:26:09,929 INFO L413 NwaCegarLoop]: 1015 mSDtfsCounter, 6692 mSDsluCounter, 22413 mSDsCounter, 0 mSdLazyCounter, 14400 mSolverCounterSat, 2060 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6692 SdHoareTripleChecker+Valid, 23428 SdHoareTripleChecker+Invalid, 16460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2060 IncrementalHoareTripleChecker+Valid, 14400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-21 11:26:09,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6692 Valid, 23428 Invalid, 16460 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2060 Valid, 14400 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-12-21 11:26:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17075 states. [2023-12-21 11:26:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17075 to 11622. [2023-12-21 11:26:11,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11622 states, 9402 states have (on average 1.1885768985322271) internal successors, (11175), 9506 states have internal predecessors, (11175), 1422 states have call successors, (1422), 797 states have call predecessors, (1422), 797 states have return successors, (1422), 1318 states have call predecessors, (1422), 1422 states have call successors, (1422) [2023-12-21 11:26:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11622 states to 11622 states and 14019 transitions. [2023-12-21 11:26:11,851 INFO L78 Accepts]: Start accepts. Automaton has 11622 states and 14019 transitions. Word has length 359 [2023-12-21 11:26:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:26:11,851 INFO L495 AbstractCegarLoop]: Abstraction has 11622 states and 14019 transitions. [2023-12-21 11:26:11,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 6.7368421052631575) internal successors, (384), 48 states have internal predecessors, (384), 16 states have call successors, (67), 13 states have call predecessors, (67), 23 states have return successors, (72), 23 states have call predecessors, (72), 16 states have call successors, (72) [2023-12-21 11:26:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 11622 states and 14019 transitions. [2023-12-21 11:26:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2023-12-21 11:26:11,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:26:11,871 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:26:11,879 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-21 11:26:12,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:26:12,080 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:26:12,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:26:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1640230850, now seen corresponding path program 1 times [2023-12-21 11:26:12,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:26:12,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585471360] [2023-12-21 11:26:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:12,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:26:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:26:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:26:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:26:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:26:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:26:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:26:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:26:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:26:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:26:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:26:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:26:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:26:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:26:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:26:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:26:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2023-12-21 11:26:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-12-21 11:26:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 11:26:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-21 11:26:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-21 11:26:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-21 11:26:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2023-12-21 11:26:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2023-12-21 11:26:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-12-21 11:26:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-12-21 11:26:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2023-12-21 11:26:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2023-12-21 11:26:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2023-12-21 11:26:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2023-12-21 11:26:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-12-21 11:26:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2023-12-21 11:26:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1061 trivial. 0 not checked. [2023-12-21 11:26:12,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:26:12,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585471360] [2023-12-21 11:26:12,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585471360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:26:12,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:26:12,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:26:12,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610806067] [2023-12-21 11:26:12,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:26:12,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:26:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:26:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:26:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:26:12,288 INFO L87 Difference]: Start difference. First operand 11622 states and 14019 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 11:26:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:26:13,455 INFO L93 Difference]: Finished difference Result 17566 states and 21177 transitions. [2023-12-21 11:26:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:26:13,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 370 [2023-12-21 11:26:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:26:13,473 INFO L225 Difference]: With dead ends: 17566 [2023-12-21 11:26:13,474 INFO L226 Difference]: Without dead ends: 6546 [2023-12-21 11:26:13,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 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-21 11:26:13,489 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 55 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:26:13,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 446 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:26:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6546 states. [2023-12-21 11:26:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6546 to 6546. [2023-12-21 11:26:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6546 states, 5303 states have (on average 1.1780124457854044) internal successors, (6247), 5362 states have internal predecessors, (6247), 790 states have call successors, (790), 452 states have call predecessors, (790), 452 states have return successors, (790), 731 states have call predecessors, (790), 790 states have call successors, (790) [2023-12-21 11:26:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6546 states to 6546 states and 7827 transitions. [2023-12-21 11:26:14,669 INFO L78 Accepts]: Start accepts. Automaton has 6546 states and 7827 transitions. Word has length 370 [2023-12-21 11:26:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:26:14,670 INFO L495 AbstractCegarLoop]: Abstraction has 6546 states and 7827 transitions. [2023-12-21 11:26:14,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 11:26:14,670 INFO L276 IsEmpty]: Start isEmpty. Operand 6546 states and 7827 transitions. [2023-12-21 11:26:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2023-12-21 11:26:14,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:26:14,681 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:26:14,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-21 11:26:14,682 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:26:14,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:26:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash -343513865, now seen corresponding path program 1 times [2023-12-21 11:26:14,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:26:14,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785923730] [2023-12-21 11:26:14,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:14,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:26:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:26:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:26:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:26:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:26:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:26:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:26:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:26:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:26:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:26:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:26:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:26:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:26:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:26:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:26:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:26:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:26:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-12-21 11:26:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-12-21 11:26:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-21 11:26:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-12-21 11:26:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-12-21 11:26:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-12-21 11:26:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2023-12-21 11:26:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2023-12-21 11:26:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-12-21 11:26:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2023-12-21 11:26:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2023-12-21 11:26:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2023-12-21 11:26:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2023-12-21 11:26:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-12-21 11:26:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2023-12-21 11:26:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2023-12-21 11:26:14,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:26:14,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785923730] [2023-12-21 11:26:14,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785923730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 11:26:14,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 11:26:14,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 11:26:14,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742214689] [2023-12-21 11:26:14,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 11:26:14,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 11:26:14,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:26:14,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 11:26:14,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 11:26:14,873 INFO L87 Difference]: Start difference. First operand 6546 states and 7827 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-21 11:26:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:26:15,693 INFO L93 Difference]: Finished difference Result 9961 states and 11945 transitions. [2023-12-21 11:26:15,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 11:26:15,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 371 [2023-12-21 11:26:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:26:15,701 INFO L225 Difference]: With dead ends: 9961 [2023-12-21 11:26:15,701 INFO L226 Difference]: Without dead ends: 3849 [2023-12-21 11:26:15,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 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-21 11:26:15,708 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 55 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 11:26:15,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 440 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 11:26:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2023-12-21 11:26:16,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 3849. [2023-12-21 11:26:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3142 states have (on average 1.1775938892425206) internal successors, (3700), 3171 states have internal predecessors, (3700), 446 states have call successors, (446), 260 states have call predecessors, (446), 260 states have return successors, (446), 417 states have call predecessors, (446), 446 states have call successors, (446) [2023-12-21 11:26:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 4592 transitions. [2023-12-21 11:26:16,384 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 4592 transitions. Word has length 371 [2023-12-21 11:26:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:26:16,384 INFO L495 AbstractCegarLoop]: Abstraction has 3849 states and 4592 transitions. [2023-12-21 11:26:16,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-21 11:26:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4592 transitions. [2023-12-21 11:26:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2023-12-21 11:26:16,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:26:16,390 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:26:16,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-21 11:26:16,390 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:26:16,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:26:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash 240027645, now seen corresponding path program 1 times [2023-12-21 11:26:16,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:26:16,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386854221] [2023-12-21 11:26:16,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:16,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:26:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:26:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:26:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:26:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:26:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:26:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:26:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:26:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:26:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:26:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:26:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:26:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:26:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:26:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:26:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:26:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:26:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 11:26:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-21 11:26:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-12-21 11:26:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-12-21 11:26:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-12-21 11:26:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2023-12-21 11:26:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-12-21 11:26:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2023-12-21 11:26:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2023-12-21 11:26:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2023-12-21 11:26:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2023-12-21 11:26:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2023-12-21 11:26:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2023-12-21 11:26:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-12-21 11:26:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2023-12-21 11:26:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2023-12-21 11:26:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 45 proven. 18 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2023-12-21 11:26:16,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:26:16,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386854221] [2023-12-21 11:26:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386854221] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:26:16,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748580931] [2023-12-21 11:26:16,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:16,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:26:16,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:26:16,716 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-21 11:26:16,719 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-21 11:26:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:16,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 11:26:16,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:26:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 127 proven. 304 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2023-12-21 11:26:17,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:26:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2023-12-21 11:26:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748580931] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:26:17,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:26:17,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2023-12-21 11:26:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203033352] [2023-12-21 11:26:17,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:26:17,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 11:26:17,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:26:17,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 11:26:17,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2023-12-21 11:26:17,532 INFO L87 Difference]: Start difference. First operand 3849 states and 4592 transitions. Second operand has 22 states, 22 states have (on average 12.454545454545455) internal successors, (274), 18 states have internal predecessors, (274), 8 states have call successors, (67), 7 states have call predecessors, (67), 10 states have return successors, (66), 11 states have call predecessors, (66), 8 states have call successors, (66) [2023-12-21 11:26:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:26:24,634 INFO L93 Difference]: Finished difference Result 22917 states and 28103 transitions. [2023-12-21 11:26:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2023-12-21 11:26:24,634 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 12.454545454545455) internal successors, (274), 18 states have internal predecessors, (274), 8 states have call successors, (67), 7 states have call predecessors, (67), 10 states have return successors, (66), 11 states have call predecessors, (66), 8 states have call successors, (66) Word has length 376 [2023-12-21 11:26:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:26:24,667 INFO L225 Difference]: With dead ends: 22917 [2023-12-21 11:26:24,667 INFO L226 Difference]: Without dead ends: 19594 [2023-12-21 11:26:24,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 817 SyntacticMatches, 9 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5342 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1454, Invalid=14046, Unknown=0, NotChecked=0, Total=15500 [2023-12-21 11:26:24,676 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 1827 mSDsluCounter, 4421 mSDsCounter, 0 mSdLazyCounter, 4186 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 4616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 4186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-21 11:26:24,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 4767 Invalid, 4616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 4186 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-21 11:26:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19594 states. [2023-12-21 11:26:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19594 to 6973. [2023-12-21 11:26:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6973 states, 5717 states have (on average 1.1777155850970789) internal successors, (6733), 5762 states have internal predecessors, (6733), 788 states have call successors, (788), 467 states have call predecessors, (788), 467 states have return successors, (788), 743 states have call predecessors, (788), 788 states have call successors, (788) [2023-12-21 11:26:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6973 states to 6973 states and 8309 transitions. [2023-12-21 11:26:26,067 INFO L78 Accepts]: Start accepts. Automaton has 6973 states and 8309 transitions. Word has length 376 [2023-12-21 11:26:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:26:26,068 INFO L495 AbstractCegarLoop]: Abstraction has 6973 states and 8309 transitions. [2023-12-21 11:26:26,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 12.454545454545455) internal successors, (274), 18 states have internal predecessors, (274), 8 states have call successors, (67), 7 states have call predecessors, (67), 10 states have return successors, (66), 11 states have call predecessors, (66), 8 states have call successors, (66) [2023-12-21 11:26:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 6973 states and 8309 transitions. [2023-12-21 11:26:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2023-12-21 11:26:26,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:26:26,076 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:26:26,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-21 11:26:26,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:26:26,277 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:26:26,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:26:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash 98813656, now seen corresponding path program 1 times [2023-12-21 11:26:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:26:26,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373721451] [2023-12-21 11:26:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:26,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:26:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 11:26:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 11:26:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 11:26:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 11:26:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-21 11:26:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-21 11:26:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 11:26:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 11:26:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 11:26:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 11:26:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 11:26:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-21 11:26:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 11:26:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 11:26:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-21 11:26:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-12-21 11:26:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-12-21 11:26:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-21 11:26:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-21 11:26:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-21 11:26:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-12-21 11:26:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-12-21 11:26:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2023-12-21 11:26:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2023-12-21 11:26:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-12-21 11:26:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-12-21 11:26:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2023-12-21 11:26:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2023-12-21 11:26:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2023-12-21 11:26:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2023-12-21 11:26:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2023-12-21 11:26:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2023-12-21 11:26:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2023-12-21 11:26:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 136 proven. 132 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2023-12-21 11:26:26,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 11:26:26,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373721451] [2023-12-21 11:26:26,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373721451] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 11:26:26,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87945498] [2023-12-21 11:26:26,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:26,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 11:26:26,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 11:26:26,929 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-21 11:26:26,932 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-21 11:26:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 11:26:27,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 1317 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-21 11:26:27,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 11:26:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 611 proven. 249 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2023-12-21 11:26:27,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 11:26:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 154 proven. 160 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2023-12-21 11:26:28,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87945498] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 11:26:28,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 11:26:28,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26, 21] total 50 [2023-12-21 11:26:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605643011] [2023-12-21 11:26:28,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 11:26:28,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-21 11:26:28,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 11:26:28,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-21 11:26:28,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2225, Unknown=0, NotChecked=0, Total=2450 [2023-12-21 11:26:28,872 INFO L87 Difference]: Start difference. First operand 6973 states and 8309 transitions. Second operand has 50 states, 50 states have (on average 7.38) internal successors, (369), 42 states have internal predecessors, (369), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (65), 21 states have call predecessors, (65), 14 states have call successors, (65) [2023-12-21 11:26:33,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 11:26:33,054 INFO L93 Difference]: Finished difference Result 14741 states and 17914 transitions. [2023-12-21 11:26:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-21 11:26:33,055 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 7.38) internal successors, (369), 42 states have internal predecessors, (369), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (65), 21 states have call predecessors, (65), 14 states have call successors, (65) Word has length 381 [2023-12-21 11:26:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 11:26:33,070 INFO L225 Difference]: With dead ends: 14741 [2023-12-21 11:26:33,070 INFO L226 Difference]: Without dead ends: 8222 [2023-12-21 11:26:33,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 794 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=800, Invalid=6172, Unknown=0, NotChecked=0, Total=6972 [2023-12-21 11:26:33,076 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 705 mSDsluCounter, 4541 mSDsCounter, 0 mSdLazyCounter, 3371 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 4765 SdHoareTripleChecker+Invalid, 3564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 3371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-21 11:26:33,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 4765 Invalid, 3564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 3371 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-21 11:26:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8222 states. [2023-12-21 11:26:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8222 to 6980. [2023-12-21 11:26:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6980 states, 5723 states have (on average 1.1768303337410448) internal successors, (6735), 5768 states have internal predecessors, (6735), 788 states have call successors, (788), 468 states have call predecessors, (788), 468 states have return successors, (788), 743 states have call predecessors, (788), 788 states have call successors, (788) [2023-12-21 11:26:34,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6980 states to 6980 states and 8311 transitions. [2023-12-21 11:26:34,427 INFO L78 Accepts]: Start accepts. Automaton has 6980 states and 8311 transitions. Word has length 381 [2023-12-21 11:26:34,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 11:26:34,428 INFO L495 AbstractCegarLoop]: Abstraction has 6980 states and 8311 transitions. [2023-12-21 11:26:34,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 7.38) internal successors, (369), 42 states have internal predecessors, (369), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (65), 21 states have call predecessors, (65), 14 states have call successors, (65) [2023-12-21 11:26:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6980 states and 8311 transitions. [2023-12-21 11:26:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2023-12-21 11:26:34,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 11:26:34,435 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:26:34,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-21 11:26:34,635 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,SelfDestructingSolverStorable46 [2023-12-21 11:26:34,636 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 11:26:34,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 11:26:34,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2086050767, now seen corresponding path program 1 times [2023-12-21 11:26:34,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 11:26:34,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247909206] [2023-12-21 11:26:34,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 11:26:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 11:26:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 11:26:34,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 11:26:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 11:26:34,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 11:26:34,811 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 11:26:34,812 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 11:26:34,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-12-21 11:26:34,815 INFO L445 BasicCegarLoop]: Path program histogram: [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-21 11:26:34,818 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 11:26:34,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:26:34 BoogieIcfgContainer [2023-12-21 11:26:34,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 11:26:34,981 INFO L158 Benchmark]: Toolchain (without parser) took 146389.07ms. Allocated memory was 196.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 146.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 377.1MB. Max. memory is 8.0GB. [2023-12-21 11:26:34,981 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 196.1MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 11:26:34,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.30ms. Allocated memory is still 196.1MB. Free memory was 145.9MB in the beginning and 129.3MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 11:26:34,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.87ms. Allocated memory is still 196.1MB. Free memory was 129.3MB in the beginning and 126.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 11:26:34,981 INFO L158 Benchmark]: Boogie Preprocessor took 51.29ms. Allocated memory is still 196.1MB. Free memory was 126.2MB in the beginning and 122.7MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 11:26:34,982 INFO L158 Benchmark]: RCFGBuilder took 534.86ms. Allocated memory is still 196.1MB. Free memory was 122.7MB in the beginning and 144.7MB in the end (delta: -22.0MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. [2023-12-21 11:26:34,982 INFO L158 Benchmark]: TraceAbstraction took 145496.88ms. Allocated memory was 196.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 144.1MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 374.5MB. Max. memory is 8.0GB. [2023-12-21 11:26:34,987 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.15ms. Allocated memory is still 196.1MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.30ms. Allocated memory is still 196.1MB. Free memory was 145.9MB in the beginning and 129.3MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.87ms. Allocated memory is still 196.1MB. Free memory was 129.3MB in the beginning and 126.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.29ms. Allocated memory is still 196.1MB. Free memory was 126.2MB in the beginning and 122.7MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 534.86ms. Allocated memory is still 196.1MB. Free memory was 122.7MB in the beginning and 144.7MB in the end (delta: -22.0MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. * TraceAbstraction took 145496.88ms. Allocated memory was 196.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 144.1MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 374.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 535]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] int8_t votedValue_History_2 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] gate1Failed = __VERIFIER_nondet_bool() [L482] gate2Failed = __VERIFIER_nondet_bool() [L483] gate3Failed = __VERIFIER_nondet_bool() [L484] VALUE1 = __VERIFIER_nondet_char() [L485] VALUE2 = __VERIFIER_nondet_char() [L486] VALUE3 = __VERIFIER_nondet_char() [L487] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L489] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L496] votedValue_History_0 = __VERIFIER_nondet_char() [L497] votedValue_History_1 = __VERIFIER_nondet_char() [L498] votedValue_History_2 = __VERIFIER_nondet_char() [L499] CALL, EXPR init() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] CALL, EXPR add_history_type(0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, historyIndex=0, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] RET, EXPR add_history_type(0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, tmp=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] CALL, EXPR add_history_type(1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] RET, EXPR add_history_type(1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] CALL, EXPR add_history_type(2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] RET, EXPR add_history_type(2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] CALL, EXPR add_history_type(3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] RET, EXPR add_history_type(3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L499] RET, EXPR init() [L499] i2 = init() [L500] COND FALSE !(!(i2)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, c1=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L501] g1v_old = nomsg [L502] g1v_new = nomsg [L503] g2v_old = nomsg [L504] g2v_new = nomsg [L505] g3v_old = nomsg [L506] g3v_new = nomsg [L507] i2 = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=5, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=2, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=7, gate1Failed_History_2=5, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=2, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=5, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=2, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=0, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=2, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=2, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L345] COND TRUE \read(gate1Failed) [L346] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=2, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=2, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=2, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=2, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=3, gate2Failed_History_2=2, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=3, \old(gate2Failed_History_2)=2, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=6, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] next_state = tmp VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L413] COND TRUE (int )next_state == 0 [L414] tmp___0 = 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L424] COND FALSE !(!((_Bool )tmp___0)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=-1, \old(history_id)=3, buf=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L249] COND FALSE !(! gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] COND FALSE !(! gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] COND TRUE ! gate3Failed [L256] tmp = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L260] COND FALSE !(!((_Bool )tmp)) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L127] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, tmp___3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L137] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, tmp___3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] CALL, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L147] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] RET, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L280] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L294] COND FALSE !(! (temp_count > 1)) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] CALL, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, \result=-2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] RET, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND FALSE !((int )tmp___10 > -2) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___10=-2, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___10=-2, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] tmp___11 = read_history_int8(3, 0) [L321] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___10=-2, tmp___11=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L333] return (1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \result=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___10=-2, tmp___11=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(arg)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L533] COND FALSE !(! arg) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(arg)=1, arg=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L521] RET assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, i2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L522] i2 ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, i2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L351] COND TRUE (int )next_state == 0 [L352] tmp___0 = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=3, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=3, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L407] COND TRUE \read(gate3Failed) [L408] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0, voted_value=-1] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0, voted_value=-1] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(buf)=-1, \old(history_id)=3, buf=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L260] COND FALSE !(!((_Bool )tmp)) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND FALSE !(! tmp___3) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] CALL, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] RET, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND TRUE (int )tmp___10 > -2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] tmp___6 = read_history_int8(3, 0) [L303] COND TRUE (int )tmp___6 == (int )nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] tmp___7 = read_history_bool(0, 1) [L305] COND TRUE \read(tmp___7) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] CALL, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND TRUE history_id == 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L137] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, \result=-255, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] RET, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___8 = read_history_bool(1, 1) [L307] COND TRUE \read(tmp___8) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] CALL, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L146] COND TRUE history_id == 2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L147] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] RET, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___9 = read_history_bool(2, 1) [L309] COND TRUE ! tmp___9 [L310] return (0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, tmp___9=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L533] COND TRUE ! arg VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L535] reach_error() VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 145.3s, OverallIterations: 48, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 109.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33238 SdHoareTripleChecker+Valid, 34.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32889 mSDsluCounter, 108174 SdHoareTripleChecker+Invalid, 28.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94635 mSDsCounter, 8822 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69382 IncrementalHoareTripleChecker+Invalid, 78204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8822 mSolverCounterUnsat, 13539 mSDtfsCounter, 69382 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11969 GetRequests, 10001 SyntacticMatches, 30 SemanticMatches, 1938 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247635 ImplicationChecksByTransitivity, 59.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11622occurred in iteration=43, InterpolantAutomatonStates: 1758, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.0s AutomataMinimizationTime, 47 MinimizatonAttempts, 54327 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 16326 NumberOfCodeBlocks, 16326 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 18466 ConstructedInterpolants, 0 QuantifiedInterpolants, 39367 SizeOfPredicates, 72 NumberOfNonLiveVariables, 19240 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 76 InterpolantComputations, 39 PerfectInterpolantSequences, 45379/47891 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-21 11:26:35,013 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...