/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 14:43:17,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 14:43:17,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 14:43:17,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 14:43:17,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 14:43:17,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 14:43:17,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 14:43:17,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 14:43:17,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 14:43:17,443 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 14:43:17,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 14:43:17,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 14:43:17,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 14:43:17,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 14:43:17,445 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 14:43:17,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 14:43:17,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 14:43:17,446 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 14:43:17,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 14:43:17,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 14:43:17,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 14:43:17,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 14:43:17,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 14:43:17,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 14:43:17,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 14:43:17,448 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 14:43:17,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 14:43:17,448 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 14:43:17,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 14:43:17,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 14:43:17,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 14:43:17,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 14:43:17,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 14:43:17,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 14:43:17,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 14:43:17,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 14:43:17,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 14:43:17,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 14:43:17,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 14:43:17,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 14:43:17,451 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 14:43:17,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 14:43:17,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 14:43:17,451 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 14:43:17,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 14:43:17,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 14:43:17,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 14:43:17,667 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 14:43:17,668 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 14:43:17,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2023-12-20 14:43:18,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 14:43:18,786 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 14:43:18,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2023-12-20 14:43:18,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ea22e65/a2a2051f2a8245cfbf1c630c238c960b/FLAG3f163e053 [2023-12-20 14:43:18,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ea22e65/a2a2051f2a8245cfbf1c630c238c960b [2023-12-20 14:43:18,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 14:43:18,811 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 14:43:18,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 14:43:18,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 14:43:18,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 14:43:18,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 02:43:18" (1/1) ... [2023-12-20 14:43:18,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72d7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:18, skipping insertion in model container [2023-12-20 14:43:18,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 02:43:18" (1/1) ... [2023-12-20 14:43:18,843 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 14:43:18,958 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2023-12-20 14:43:18,983 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2023-12-20 14:43:19,001 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 14:43:19,013 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 14:43:19,021 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2023-12-20 14:43:19,032 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2023-12-20 14:43:19,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 14:43:19,056 INFO L206 MainTranslator]: Completed translation [2023-12-20 14:43:19,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19 WrapperNode [2023-12-20 14:43:19,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 14:43:19,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 14:43:19,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 14:43:19,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 14:43:19,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (1/1) ... [2023-12-20 14:43:19,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (1/1) ... [2023-12-20 14:43:19,093 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 423 [2023-12-20 14:43:19,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 14:43:19,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 14:43:19,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 14:43:19,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 14:43:19,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (1/1) ... [2023-12-20 14:43:19,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (1/1) ... [2023-12-20 14:43:19,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (1/1) ... [2023-12-20 14:43:19,115 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 14:43:19,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (1/1) ... [2023-12-20 14:43:19,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (1/1) ... [2023-12-20 14:43:19,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (1/1) ... [2023-12-20 14:43:19,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (1/1) ... [2023-12-20 14:43:19,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (1/1) ... [2023-12-20 14:43:19,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (1/1) ... [2023-12-20 14:43:19,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 14:43:19,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 14:43:19,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 14:43:19,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 14:43:19,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (1/1) ... [2023-12-20 14:43:19,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 14:43:19,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:19,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 14:43:19,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 14:43:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 14:43:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-20 14:43:19,200 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-20 14:43:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-12-20 14:43:19,200 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-12-20 14:43:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-20 14:43:19,200 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-20 14:43:19,200 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-20 14:43:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-20 14:43:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-20 14:43:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-20 14:43:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-20 14:43:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-20 14:43:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-20 14:43:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-20 14:43:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 14:43:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-20 14:43:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-20 14:43:19,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 14:43:19,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 14:43:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-20 14:43:19,202 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-20 14:43:19,261 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 14:43:19,263 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 14:43:19,560 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 14:43:19,596 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 14:43:19,596 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-20 14:43:19,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 02:43:19 BoogieIcfgContainer [2023-12-20 14:43:19,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 14:43:19,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 14:43:19,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 14:43:19,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 14:43:19,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 02:43:18" (1/3) ... [2023-12-20 14:43:19,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596d6f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 02:43:19, skipping insertion in model container [2023-12-20 14:43:19,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 02:43:19" (2/3) ... [2023-12-20 14:43:19,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596d6f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 02:43:19, skipping insertion in model container [2023-12-20 14:43:19,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 02:43:19" (3/3) ... [2023-12-20 14:43:19,602 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2023-12-20 14:43:19,614 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 14:43:19,615 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-20 14:43:19,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 14:43:19,667 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;@54cbd423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 14:43:19,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-20 14:43:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 125 states have (on average 1.632) internal successors, (204), 130 states have internal predecessors, (204), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-20 14:43:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-20 14:43:19,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:19,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:19,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:19,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1528274659, now seen corresponding path program 1 times [2023-12-20 14:43:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:19,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393451332] [2023-12-20 14:43:19,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:19,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:19,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:19,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 14:43:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:19,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:19,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393451332] [2023-12-20 14:43:19,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393451332] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:19,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:19,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 14:43:19,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851931652] [2023-12-20 14:43:19,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:19,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:19,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:19,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 14:43:19,955 INFO L87 Difference]: Start difference. First operand has 158 states, 125 states have (on average 1.632) internal successors, (204), 130 states have internal predecessors, (204), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 14:43:20,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:20,245 INFO L93 Difference]: Finished difference Result 368 states and 578 transitions. [2023-12-20 14:43:20,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:43:20,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2023-12-20 14:43:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:20,256 INFO L225 Difference]: With dead ends: 368 [2023-12-20 14:43:20,256 INFO L226 Difference]: Without dead ends: 216 [2023-12-20 14:43:20,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:20,261 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 259 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:20,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 335 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:43:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-20 14:43:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2023-12-20 14:43:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 172 states have (on average 1.4593023255813953) internal successors, (251), 176 states have internal predecessors, (251), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2023-12-20 14:43:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 305 transitions. [2023-12-20 14:43:20,301 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 305 transitions. Word has length 37 [2023-12-20 14:43:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:20,301 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 305 transitions. [2023-12-20 14:43:20,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 14:43:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 305 transitions. [2023-12-20 14:43:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-20 14:43:20,304 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:20,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:20,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 14:43:20,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:20,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1110502537, now seen corresponding path program 1 times [2023-12-20 14:43:20,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:20,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567046670] [2023-12-20 14:43:20,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:20,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:20,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:20,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-20 14:43:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:20,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:20,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567046670] [2023-12-20 14:43:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567046670] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:20,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:20,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 14:43:20,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372800045] [2023-12-20 14:43:20,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:20,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:20,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:20,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:20,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 14:43:20,363 INFO L87 Difference]: Start difference. First operand 210 states and 305 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 14:43:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:20,543 INFO L93 Difference]: Finished difference Result 444 states and 649 transitions. [2023-12-20 14:43:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:43:20,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-12-20 14:43:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:20,550 INFO L225 Difference]: With dead ends: 444 [2023-12-20 14:43:20,550 INFO L226 Difference]: Without dead ends: 333 [2023-12-20 14:43:20,551 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-20 14:43:20,552 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 272 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:20,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 323 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-20 14:43:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 310. [2023-12-20 14:43:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 259 states have (on average 1.4247104247104247) internal successors, (369), 264 states have internal predecessors, (369), 33 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (43), 31 states have call predecessors, (43), 31 states have call successors, (43) [2023-12-20 14:43:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 445 transitions. [2023-12-20 14:43:20,583 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 445 transitions. Word has length 38 [2023-12-20 14:43:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:20,584 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 445 transitions. [2023-12-20 14:43:20,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 14:43:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 445 transitions. [2023-12-20 14:43:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-20 14:43:20,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:20,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:20,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 14:43:20,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:20,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:20,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1727996056, now seen corresponding path program 1 times [2023-12-20 14:43:20,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:20,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559868346] [2023-12-20 14:43:20,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:20,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:20,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:20,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 14:43:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:20,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:20,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559868346] [2023-12-20 14:43:20,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559868346] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:20,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:20,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 14:43:20,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844770503] [2023-12-20 14:43:20,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:20,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:20,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:20,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:20,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 14:43:20,633 INFO L87 Difference]: Start difference. First operand 310 states and 445 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 14:43:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:20,818 INFO L93 Difference]: Finished difference Result 730 states and 1026 transitions. [2023-12-20 14:43:20,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:43:20,818 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2023-12-20 14:43:20,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:20,824 INFO L225 Difference]: With dead ends: 730 [2023-12-20 14:43:20,824 INFO L226 Difference]: Without dead ends: 519 [2023-12-20 14:43:20,825 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-20 14:43:20,829 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 137 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:20,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 426 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2023-12-20 14:43:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 415. [2023-12-20 14:43:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 352 states have (on average 1.4147727272727273) internal successors, (498), 359 states have internal predecessors, (498), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2023-12-20 14:43:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 586 transitions. [2023-12-20 14:43:20,891 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 586 transitions. Word has length 39 [2023-12-20 14:43:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:20,891 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 586 transitions. [2023-12-20 14:43:20,891 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 14:43:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 586 transitions. [2023-12-20 14:43:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-20 14:43:20,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:20,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:20,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 14:43:20,899 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:20,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:20,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1833980046, now seen corresponding path program 1 times [2023-12-20 14:43:20,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:20,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050385634] [2023-12-20 14:43:20,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:20,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:20,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:20,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:20,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:20,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:20,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:20,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:20,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050385634] [2023-12-20 14:43:20,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050385634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:20,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:20,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 14:43:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745730655] [2023-12-20 14:43:20,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:20,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:43:20,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:20,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:43:20,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:20,968 INFO L87 Difference]: Start difference. First operand 415 states and 586 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:21,221 INFO L93 Difference]: Finished difference Result 524 states and 750 transitions. [2023-12-20 14:43:21,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 14:43:21,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-20 14:43:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:21,224 INFO L225 Difference]: With dead ends: 524 [2023-12-20 14:43:21,224 INFO L226 Difference]: Without dead ends: 435 [2023-12-20 14:43:21,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:43:21,225 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 248 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:21,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 367 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:43:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2023-12-20 14:43:21,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 415. [2023-12-20 14:43:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 352 states have (on average 1.4119318181818181) internal successors, (497), 359 states have internal predecessors, (497), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2023-12-20 14:43:21,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 585 transitions. [2023-12-20 14:43:21,244 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 585 transitions. Word has length 51 [2023-12-20 14:43:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:21,244 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 585 transitions. [2023-12-20 14:43:21,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 585 transitions. [2023-12-20 14:43:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-20 14:43:21,246 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:21,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:21,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 14:43:21,246 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:21,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:21,247 INFO L85 PathProgramCache]: Analyzing trace with hash 940493708, now seen corresponding path program 1 times [2023-12-20 14:43:21,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:21,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416209758] [2023-12-20 14:43:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:21,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:21,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:21,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:21,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:21,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:21,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:21,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416209758] [2023-12-20 14:43:21,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416209758] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:21,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:21,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 14:43:21,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265355635] [2023-12-20 14:43:21,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:21,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 14:43:21,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:21,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 14:43:21,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:21,321 INFO L87 Difference]: Start difference. First operand 415 states and 585 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:21,668 INFO L93 Difference]: Finished difference Result 624 states and 897 transitions. [2023-12-20 14:43:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 14:43:21,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-20 14:43:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:21,674 INFO L225 Difference]: With dead ends: 624 [2023-12-20 14:43:21,677 INFO L226 Difference]: Without dead ends: 538 [2023-12-20 14:43:21,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-20 14:43:21,681 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 411 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:21,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 489 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:43:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2023-12-20 14:43:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 499. [2023-12-20 14:43:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 419 states have (on average 1.422434367541766) internal successors, (596), 427 states have internal predecessors, (596), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2023-12-20 14:43:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 707 transitions. [2023-12-20 14:43:21,715 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 707 transitions. Word has length 51 [2023-12-20 14:43:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:21,716 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 707 transitions. [2023-12-20 14:43:21,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 707 transitions. [2023-12-20 14:43:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-20 14:43:21,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:21,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:21,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 14:43:21,720 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:21,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1786842256, now seen corresponding path program 1 times [2023-12-20 14:43:21,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:21,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953470678] [2023-12-20 14:43:21,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:21,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:21,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:21,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:21,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:21,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:21,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:21,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953470678] [2023-12-20 14:43:21,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953470678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:21,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:21,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:43:21,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967457459] [2023-12-20 14:43:21,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:21,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:43:21,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:21,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:43:21,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:21,888 INFO L87 Difference]: Start difference. First operand 499 states and 707 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:22,390 INFO L93 Difference]: Finished difference Result 809 states and 1159 transitions. [2023-12-20 14:43:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 14:43:22,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-20 14:43:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:22,393 INFO L225 Difference]: With dead ends: 809 [2023-12-20 14:43:22,393 INFO L226 Difference]: Without dead ends: 639 [2023-12-20 14:43:22,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-20 14:43:22,397 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 412 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:22,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 742 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 14:43:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2023-12-20 14:43:22,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 578. [2023-12-20 14:43:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 481 states have (on average 1.4241164241164241) internal successors, (685), 490 states have internal predecessors, (685), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2023-12-20 14:43:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 818 transitions. [2023-12-20 14:43:22,427 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 818 transitions. Word has length 51 [2023-12-20 14:43:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:22,427 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 818 transitions. [2023-12-20 14:43:22,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 818 transitions. [2023-12-20 14:43:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-20 14:43:22,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:22,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:22,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 14:43:22,429 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:22,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash 415034958, now seen corresponding path program 1 times [2023-12-20 14:43:22,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:22,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961450336] [2023-12-20 14:43:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:22,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:22,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:22,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:22,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:22,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:22,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:22,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961450336] [2023-12-20 14:43:22,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961450336] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:22,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:22,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:43:22,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683028692] [2023-12-20 14:43:22,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:22,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:43:22,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:22,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:43:22,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:22,495 INFO L87 Difference]: Start difference. First operand 578 states and 818 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:23,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:23,001 INFO L93 Difference]: Finished difference Result 1096 states and 1568 transitions. [2023-12-20 14:43:23,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 14:43:23,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-20 14:43:23,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:23,005 INFO L225 Difference]: With dead ends: 1096 [2023-12-20 14:43:23,005 INFO L226 Difference]: Without dead ends: 847 [2023-12-20 14:43:23,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-20 14:43:23,006 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 416 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:23,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 729 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 14:43:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2023-12-20 14:43:23,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 726. [2023-12-20 14:43:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 597 states have (on average 1.4271356783919598) internal successors, (852), 608 states have internal predecessors, (852), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2023-12-20 14:43:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1029 transitions. [2023-12-20 14:43:23,050 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1029 transitions. Word has length 51 [2023-12-20 14:43:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:23,050 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 1029 transitions. [2023-12-20 14:43:23,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1029 transitions. [2023-12-20 14:43:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-20 14:43:23,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:23,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:23,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 14:43:23,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:23,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash -614324340, now seen corresponding path program 1 times [2023-12-20 14:43:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:23,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899092202] [2023-12-20 14:43:23,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:23,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:23,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:23,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:23,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899092202] [2023-12-20 14:43:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899092202] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:23,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:23,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 14:43:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203028994] [2023-12-20 14:43:23,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:23,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 14:43:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:23,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 14:43:23,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:23,120 INFO L87 Difference]: Start difference. First operand 726 states and 1029 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:23,416 INFO L93 Difference]: Finished difference Result 1215 states and 1756 transitions. [2023-12-20 14:43:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 14:43:23,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-20 14:43:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:23,419 INFO L225 Difference]: With dead ends: 1215 [2023-12-20 14:43:23,419 INFO L226 Difference]: Without dead ends: 819 [2023-12-20 14:43:23,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-20 14:43:23,421 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 165 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:23,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 550 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:43:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2023-12-20 14:43:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 736. [2023-12-20 14:43:23,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 607 states have (on average 1.4200988467874793) internal successors, (862), 618 states have internal predecessors, (862), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2023-12-20 14:43:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1039 transitions. [2023-12-20 14:43:23,458 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1039 transitions. Word has length 51 [2023-12-20 14:43:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:23,458 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 1039 transitions. [2023-12-20 14:43:23,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1039 transitions. [2023-12-20 14:43:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-20 14:43:23,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:23,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:23,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 14:43:23,460 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:23,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash -591692086, now seen corresponding path program 1 times [2023-12-20 14:43:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34173527] [2023-12-20 14:43:23,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:23,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:23,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:23,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:23,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:23,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:23,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:23,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34173527] [2023-12-20 14:43:23,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34173527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:23,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:23,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 14:43:23,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736029030] [2023-12-20 14:43:23,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:23,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 14:43:23,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:23,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 14:43:23,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:23,579 INFO L87 Difference]: Start difference. First operand 736 states and 1039 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:24,240 INFO L93 Difference]: Finished difference Result 2121 states and 3112 transitions. [2023-12-20 14:43:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 14:43:24,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-20 14:43:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:24,247 INFO L225 Difference]: With dead ends: 2121 [2023-12-20 14:43:24,247 INFO L226 Difference]: Without dead ends: 1715 [2023-12-20 14:43:24,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-12-20 14:43:24,249 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 916 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:24,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 593 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 14:43:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2023-12-20 14:43:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1527. [2023-12-20 14:43:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1225 states have (on average 1.409795918367347) internal successors, (1727), 1253 states have internal predecessors, (1727), 178 states have call successors, (178), 109 states have call predecessors, (178), 122 states have return successors, (255), 168 states have call predecessors, (255), 176 states have call successors, (255) [2023-12-20 14:43:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2160 transitions. [2023-12-20 14:43:24,317 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2160 transitions. Word has length 51 [2023-12-20 14:43:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:24,318 INFO L495 AbstractCegarLoop]: Abstraction has 1527 states and 2160 transitions. [2023-12-20 14:43:24,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-20 14:43:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2160 transitions. [2023-12-20 14:43:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-20 14:43:24,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:24,319 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:24,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 14:43:24,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:24,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1488931652, now seen corresponding path program 1 times [2023-12-20 14:43:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:24,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956040328] [2023-12-20 14:43:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:24,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:24,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-20 14:43:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:24,351 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 14:43:24,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:24,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956040328] [2023-12-20 14:43:24,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956040328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:24,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:24,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 14:43:24,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917928247] [2023-12-20 14:43:24,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:24,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:24,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:24,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 14:43:24,353 INFO L87 Difference]: Start difference. First operand 1527 states and 2160 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-20 14:43:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:24,555 INFO L93 Difference]: Finished difference Result 2043 states and 2877 transitions. [2023-12-20 14:43:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:43:24,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2023-12-20 14:43:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:24,561 INFO L225 Difference]: With dead ends: 2043 [2023-12-20 14:43:24,561 INFO L226 Difference]: Without dead ends: 1727 [2023-12-20 14:43:24,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:24,563 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 122 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:24,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 467 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2023-12-20 14:43:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1693. [2023-12-20 14:43:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1367 states have (on average 1.3920994879297732) internal successors, (1903), 1397 states have internal predecessors, (1903), 192 states have call successors, (192), 117 states have call predecessors, (192), 132 states have return successors, (279), 182 states have call predecessors, (279), 190 states have call successors, (279) [2023-12-20 14:43:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2374 transitions. [2023-12-20 14:43:24,635 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2374 transitions. Word has length 54 [2023-12-20 14:43:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:24,636 INFO L495 AbstractCegarLoop]: Abstraction has 1693 states and 2374 transitions. [2023-12-20 14:43:24,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-20 14:43:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2374 transitions. [2023-12-20 14:43:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-20 14:43:24,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:24,638 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 14:43:24,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 14:43:24,638 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:24,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:24,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1336073208, now seen corresponding path program 1 times [2023-12-20 14:43:24,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:24,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380981438] [2023-12-20 14:43:24,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:24,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:24,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:24,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 14:43:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:24,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 14:43:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 14:43:24,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:24,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380981438] [2023-12-20 14:43:24,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380981438] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:24,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:24,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 14:43:24,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107923819] [2023-12-20 14:43:24,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:24,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:24,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:24,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:24,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 14:43:24,690 INFO L87 Difference]: Start difference. First operand 1693 states and 2374 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-20 14:43:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:24,874 INFO L93 Difference]: Finished difference Result 2272 states and 3153 transitions. [2023-12-20 14:43:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:43:24,874 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2023-12-20 14:43:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:24,880 INFO L225 Difference]: With dead ends: 2272 [2023-12-20 14:43:24,880 INFO L226 Difference]: Without dead ends: 1870 [2023-12-20 14:43:24,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:24,882 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 257 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:24,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 333 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:24,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2023-12-20 14:43:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1821. [2023-12-20 14:43:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1479 states have (on average 1.3779580797836375) internal successors, (2038), 1511 states have internal predecessors, (2038), 200 states have call successors, (200), 123 states have call predecessors, (200), 140 states have return successors, (293), 190 states have call predecessors, (293), 198 states have call successors, (293) [2023-12-20 14:43:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2531 transitions. [2023-12-20 14:43:24,972 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2531 transitions. Word has length 59 [2023-12-20 14:43:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:24,973 INFO L495 AbstractCegarLoop]: Abstraction has 1821 states and 2531 transitions. [2023-12-20 14:43:24,973 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-20 14:43:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2531 transitions. [2023-12-20 14:43:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 14:43:24,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:24,975 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 14:43:24,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 14:43:24,975 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:24,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:24,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1066089968, now seen corresponding path program 1 times [2023-12-20 14:43:24,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:24,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147861423] [2023-12-20 14:43:24,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 14:43:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 14:43:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 14:43:25,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:25,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147861423] [2023-12-20 14:43:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147861423] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:25,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:25,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 14:43:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574493526] [2023-12-20 14:43:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:25,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:43:25,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:25,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:43:25,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:25,042 INFO L87 Difference]: Start difference. First operand 1821 states and 2531 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-20 14:43:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:25,238 INFO L93 Difference]: Finished difference Result 2307 states and 3193 transitions. [2023-12-20 14:43:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 14:43:25,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2023-12-20 14:43:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:25,245 INFO L225 Difference]: With dead ends: 2307 [2023-12-20 14:43:25,245 INFO L226 Difference]: Without dead ends: 1769 [2023-12-20 14:43:25,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:25,247 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 74 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:25,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 535 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2023-12-20 14:43:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1696. [2023-12-20 14:43:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1371 states have (on average 1.3792851932895696) internal successors, (1891), 1402 states have internal predecessors, (1891), 190 states have call successors, (190), 117 states have call predecessors, (190), 133 states have return successors, (275), 180 states have call predecessors, (275), 188 states have call successors, (275) [2023-12-20 14:43:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2356 transitions. [2023-12-20 14:43:25,321 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2356 transitions. Word has length 60 [2023-12-20 14:43:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:25,321 INFO L495 AbstractCegarLoop]: Abstraction has 1696 states and 2356 transitions. [2023-12-20 14:43:25,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-20 14:43:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2356 transitions. [2023-12-20 14:43:25,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 14:43:25,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:25,322 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-20 14:43:25,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-20 14:43:25,323 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:25,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash 731549648, now seen corresponding path program 1 times [2023-12-20 14:43:25,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:25,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048835165] [2023-12-20 14:43:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 14:43:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 14:43:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 14:43:25,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:25,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048835165] [2023-12-20 14:43:25,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048835165] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:25,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387220104] [2023-12-20 14:43:25,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:25,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:25,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:25,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:25,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 14:43:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:25,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 14:43:25,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:25,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 14:43:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 14:43:25,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387220104] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:25,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-20 14:43:25,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2023-12-20 14:43:25,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456347081] [2023-12-20 14:43:25,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:25,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:25,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:25,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:25,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:25,572 INFO L87 Difference]: Start difference. First operand 1696 states and 2356 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-20 14:43:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:25,746 INFO L93 Difference]: Finished difference Result 1745 states and 2417 transitions. [2023-12-20 14:43:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 14:43:25,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2023-12-20 14:43:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:25,753 INFO L225 Difference]: With dead ends: 1745 [2023-12-20 14:43:25,753 INFO L226 Difference]: Without dead ends: 1742 [2023-12-20 14:43:25,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-20 14:43:25,754 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 364 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:25,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 274 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:25,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2023-12-20 14:43:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1695. [2023-12-20 14:43:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1371 states have (on average 1.3778264040846098) internal successors, (1889), 1401 states have internal predecessors, (1889), 189 states have call successors, (189), 117 states have call predecessors, (189), 133 states have return successors, (275), 180 states have call predecessors, (275), 188 states have call successors, (275) [2023-12-20 14:43:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2353 transitions. [2023-12-20 14:43:25,827 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2353 transitions. Word has length 60 [2023-12-20 14:43:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:25,828 INFO L495 AbstractCegarLoop]: Abstraction has 1695 states and 2353 transitions. [2023-12-20 14:43:25,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-20 14:43:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2353 transitions. [2023-12-20 14:43:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-20 14:43:25,829 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:25,829 INFO L195 NwaCegarLoop]: trace histogram [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-20 14:43:25,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 14:43:26,034 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,SelfDestructingSolverStorable12 [2023-12-20 14:43:26,035 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:26,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1202614651, now seen corresponding path program 1 times [2023-12-20 14:43:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:26,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368259856] [2023-12-20 14:43:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:26,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 14:43:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 14:43:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 14:43:26,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368259856] [2023-12-20 14:43:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368259856] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256368372] [2023-12-20 14:43:26,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:26,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:26,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:26,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:26,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 14:43:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:26,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-20 14:43:26,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 14:43:26,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 14:43:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 14:43:26,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256368372] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 14:43:26,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 14:43:26,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2023-12-20 14:43:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014161218] [2023-12-20 14:43:26,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 14:43:26,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 14:43:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:26,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 14:43:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-20 14:43:26,334 INFO L87 Difference]: Start difference. First operand 1695 states and 2353 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-20 14:43:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:26,893 INFO L93 Difference]: Finished difference Result 2931 states and 4005 transitions. [2023-12-20 14:43:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-20 14:43:26,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2023-12-20 14:43:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:26,903 INFO L225 Difference]: With dead ends: 2931 [2023-12-20 14:43:26,903 INFO L226 Difference]: Without dead ends: 2533 [2023-12-20 14:43:26,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2023-12-20 14:43:26,906 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 445 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:26,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1469 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 14:43:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2023-12-20 14:43:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 2024. [2023-12-20 14:43:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1663 states have (on average 1.3607937462417319) internal successors, (2263), 1700 states have internal predecessors, (2263), 208 states have call successors, (208), 130 states have call predecessors, (208), 151 states have return successors, (306), 197 states have call predecessors, (306), 207 states have call successors, (306) [2023-12-20 14:43:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2777 transitions. [2023-12-20 14:43:27,013 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2777 transitions. Word has length 61 [2023-12-20 14:43:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:27,013 INFO L495 AbstractCegarLoop]: Abstraction has 2024 states and 2777 transitions. [2023-12-20 14:43:27,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-20 14:43:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2777 transitions. [2023-12-20 14:43:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-20 14:43:27,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:27,016 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:27,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:27,223 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,SelfDestructingSolverStorable13 [2023-12-20 14:43:27,224 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:27,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:27,224 INFO L85 PathProgramCache]: Analyzing trace with hash 490403576, now seen corresponding path program 1 times [2023-12-20 14:43:27,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:27,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406370910] [2023-12-20 14:43:27,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:27,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 14:43:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 14:43:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 14:43:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-20 14:43:27,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:27,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406370910] [2023-12-20 14:43:27,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406370910] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:27,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:27,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 14:43:27,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433488826] [2023-12-20 14:43:27,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:27,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:27,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:27,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:27,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 14:43:27,317 INFO L87 Difference]: Start difference. First operand 2024 states and 2777 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-20 14:43:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:27,518 INFO L93 Difference]: Finished difference Result 2658 states and 3600 transitions. [2023-12-20 14:43:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 14:43:27,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2023-12-20 14:43:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:27,525 INFO L225 Difference]: With dead ends: 2658 [2023-12-20 14:43:27,525 INFO L226 Difference]: Without dead ends: 1993 [2023-12-20 14:43:27,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 14:43:27,527 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 270 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:27,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 349 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:27,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2023-12-20 14:43:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1916. [2023-12-20 14:43:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1568 states have (on average 1.3616071428571428) internal successors, (2135), 1605 states have internal predecessors, (2135), 201 states have call successors, (201), 125 states have call predecessors, (201), 145 states have return successors, (295), 189 states have call predecessors, (295), 200 states have call successors, (295) [2023-12-20 14:43:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2631 transitions. [2023-12-20 14:43:27,625 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2631 transitions. Word has length 78 [2023-12-20 14:43:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:27,625 INFO L495 AbstractCegarLoop]: Abstraction has 1916 states and 2631 transitions. [2023-12-20 14:43:27,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-20 14:43:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2631 transitions. [2023-12-20 14:43:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-20 14:43:27,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:27,628 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:27,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-20 14:43:27,629 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:27,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:27,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1358284113, now seen corresponding path program 1 times [2023-12-20 14:43:27,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:27,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485853390] [2023-12-20 14:43:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 14:43:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 14:43:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-20 14:43:27,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:27,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485853390] [2023-12-20 14:43:27,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485853390] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:27,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356731568] [2023-12-20 14:43:27,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:27,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:27,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:27,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:27,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 14:43:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:27,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:27,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 14:43:27,798 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:27,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356731568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:27,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:27,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:27,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462384203] [2023-12-20 14:43:27,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:27,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:27,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:27,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:27,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:27,799 INFO L87 Difference]: Start difference. First operand 1916 states and 2631 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 14:43:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:27,948 INFO L93 Difference]: Finished difference Result 3265 states and 4606 transitions. [2023-12-20 14:43:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:27,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2023-12-20 14:43:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:27,956 INFO L225 Difference]: With dead ends: 3265 [2023-12-20 14:43:27,956 INFO L226 Difference]: Without dead ends: 2145 [2023-12-20 14:43:27,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:27,960 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 98 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:27,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 483 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:27,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2023-12-20 14:43:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2023-12-20 14:43:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 1749 states have (on average 1.365351629502573) internal successors, (2388), 1788 states have internal predecessors, (2388), 229 states have call successors, (229), 143 states have call predecessors, (229), 165 states have return successors, (337), 217 states have call predecessors, (337), 228 states have call successors, (337) [2023-12-20 14:43:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2954 transitions. [2023-12-20 14:43:28,075 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2954 transitions. Word has length 83 [2023-12-20 14:43:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:28,075 INFO L495 AbstractCegarLoop]: Abstraction has 2145 states and 2954 transitions. [2023-12-20 14:43:28,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 14:43:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2954 transitions. [2023-12-20 14:43:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-20 14:43:28,078 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:28,078 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:28,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-20 14:43:28,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:28,284 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:28,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash 431778550, now seen corresponding path program 1 times [2023-12-20 14:43:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:28,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151806936] [2023-12-20 14:43:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 14:43:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 14:43:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 14:43:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 14:43:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 14:43:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-20 14:43:28,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:28,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151806936] [2023-12-20 14:43:28,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151806936] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:28,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350752756] [2023-12-20 14:43:28,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:28,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:28,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:28,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:28,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 14:43:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:28,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-20 14:43:28,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:28,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350752756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:28,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:28,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-20 14:43:28,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107741054] [2023-12-20 14:43:28,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:28,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:28,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:28,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:28,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:28,442 INFO L87 Difference]: Start difference. First operand 2145 states and 2954 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-20 14:43:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:28,558 INFO L93 Difference]: Finished difference Result 2430 states and 3312 transitions. [2023-12-20 14:43:28,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:28,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2023-12-20 14:43:28,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:28,564 INFO L225 Difference]: With dead ends: 2430 [2023-12-20 14:43:28,564 INFO L226 Difference]: Without dead ends: 1435 [2023-12-20 14:43:28,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:28,566 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 55 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:28,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 414 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2023-12-20 14:43:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1435. [2023-12-20 14:43:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1126 states have (on average 1.4103019538188277) internal successors, (1588), 1150 states have internal predecessors, (1588), 182 states have call successors, (182), 112 states have call predecessors, (182), 126 states have return successors, (263), 176 states have call predecessors, (263), 182 states have call successors, (263) [2023-12-20 14:43:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2033 transitions. [2023-12-20 14:43:28,638 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2033 transitions. Word has length 92 [2023-12-20 14:43:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:28,639 INFO L495 AbstractCegarLoop]: Abstraction has 1435 states and 2033 transitions. [2023-12-20 14:43:28,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-20 14:43:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2033 transitions. [2023-12-20 14:43:28,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-20 14:43:28,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:28,655 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-20 14:43:28,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:28,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-20 14:43:28,856 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:28,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:28,856 INFO L85 PathProgramCache]: Analyzing trace with hash -230887016, now seen corresponding path program 1 times [2023-12-20 14:43:28,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:28,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547785488] [2023-12-20 14:43:28,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:28,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 14:43:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-20 14:43:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-20 14:43:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-20 14:43:28,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:28,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547785488] [2023-12-20 14:43:28,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547785488] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:28,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247682250] [2023-12-20 14:43:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:28,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:28,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:28,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:28,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 14:43:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:29,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 14:43:29,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:29,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247682250] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:29,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:29,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-20 14:43:29,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659103430] [2023-12-20 14:43:29,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:29,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:29,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:29,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:29,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:29,099 INFO L87 Difference]: Start difference. First operand 1435 states and 2033 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 14:43:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:29,242 INFO L93 Difference]: Finished difference Result 3047 states and 4375 transitions. [2023-12-20 14:43:29,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:29,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2023-12-20 14:43:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:29,253 INFO L225 Difference]: With dead ends: 3047 [2023-12-20 14:43:29,253 INFO L226 Difference]: Without dead ends: 2111 [2023-12-20 14:43:29,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:29,256 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 66 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:29,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 235 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:29,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2023-12-20 14:43:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2092. [2023-12-20 14:43:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1648 states have (on average 1.4095873786407767) internal successors, (2323), 1681 states have internal predecessors, (2323), 260 states have call successors, (260), 163 states have call predecessors, (260), 183 states have return successors, (367), 251 states have call predecessors, (367), 260 states have call successors, (367) [2023-12-20 14:43:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2950 transitions. [2023-12-20 14:43:29,358 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2950 transitions. Word has length 106 [2023-12-20 14:43:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:29,358 INFO L495 AbstractCegarLoop]: Abstraction has 2092 states and 2950 transitions. [2023-12-20 14:43:29,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 14:43:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2950 transitions. [2023-12-20 14:43:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-20 14:43:29,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:29,361 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:29,365 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-20 14:43:29,565 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,SelfDestructingSolverStorable17 [2023-12-20 14:43:29,566 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:29,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:29,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1947745732, now seen corresponding path program 1 times [2023-12-20 14:43:29,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:29,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756839052] [2023-12-20 14:43:29,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:29,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 14:43:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 14:43:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 14:43:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 14:43:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-20 14:43:29,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756839052] [2023-12-20 14:43:29,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756839052] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:29,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761676664] [2023-12-20 14:43:29,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:29,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:29,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:29,652 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:29,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 14:43:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:29,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:29,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-20 14:43:29,754 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:29,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761676664] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:29,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:29,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:29,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471237644] [2023-12-20 14:43:29,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:29,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:29,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:29,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:29,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:29,756 INFO L87 Difference]: Start difference. First operand 2092 states and 2950 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 14:43:29,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:29,884 INFO L93 Difference]: Finished difference Result 4253 states and 6055 transitions. [2023-12-20 14:43:29,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:29,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 121 [2023-12-20 14:43:29,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:29,897 INFO L225 Difference]: With dead ends: 4253 [2023-12-20 14:43:29,897 INFO L226 Difference]: Without dead ends: 2296 [2023-12-20 14:43:29,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:29,901 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 111 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:29,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 142 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:29,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2023-12-20 14:43:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2210. [2023-12-20 14:43:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2210 states, 1760 states have (on average 1.330681818181818) internal successors, (2342), 1787 states have internal predecessors, (2342), 253 states have call successors, (253), 176 states have call predecessors, (253), 196 states have return successors, (334), 248 states have call predecessors, (334), 253 states have call successors, (334) [2023-12-20 14:43:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 2929 transitions. [2023-12-20 14:43:30,002 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 2929 transitions. Word has length 121 [2023-12-20 14:43:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:30,003 INFO L495 AbstractCegarLoop]: Abstraction has 2210 states and 2929 transitions. [2023-12-20 14:43:30,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 14:43:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2929 transitions. [2023-12-20 14:43:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-20 14:43:30,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:30,006 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:30,026 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-20 14:43:30,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:30,212 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:30,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:30,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1991312345, now seen corresponding path program 1 times [2023-12-20 14:43:30,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:30,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539965274] [2023-12-20 14:43:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:30,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 14:43:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 14:43:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 14:43:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 14:43:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-20 14:43:30,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:30,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539965274] [2023-12-20 14:43:30,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539965274] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:30,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401555595] [2023-12-20 14:43:30,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:30,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:30,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:30,287 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:30,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 14:43:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 14:43:30,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-20 14:43:30,371 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:30,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401555595] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:30,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:30,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:30,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423727404] [2023-12-20 14:43:30,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:30,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:30,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:30,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:30,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:30,373 INFO L87 Difference]: Start difference. First operand 2210 states and 2929 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-20 14:43:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:30,481 INFO L93 Difference]: Finished difference Result 4452 states and 5938 transitions. [2023-12-20 14:43:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:30,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 121 [2023-12-20 14:43:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:30,490 INFO L225 Difference]: With dead ends: 4452 [2023-12-20 14:43:30,490 INFO L226 Difference]: Without dead ends: 2252 [2023-12-20 14:43:30,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:30,495 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 112 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:30,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 232 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2023-12-20 14:43:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2189. [2023-12-20 14:43:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 1739 states have (on average 1.2984473835537664) internal successors, (2258), 1766 states have internal predecessors, (2258), 253 states have call successors, (253), 176 states have call predecessors, (253), 196 states have return successors, (334), 248 states have call predecessors, (334), 253 states have call successors, (334) [2023-12-20 14:43:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2845 transitions. [2023-12-20 14:43:30,630 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2845 transitions. Word has length 121 [2023-12-20 14:43:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:30,631 INFO L495 AbstractCegarLoop]: Abstraction has 2189 states and 2845 transitions. [2023-12-20 14:43:30,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-20 14:43:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2845 transitions. [2023-12-20 14:43:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-20 14:43:30,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:30,633 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:30,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:30,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:30,839 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:30,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1687415604, now seen corresponding path program 1 times [2023-12-20 14:43:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:30,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677053607] [2023-12-20 14:43:30,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:30,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 14:43:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 14:43:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 14:43:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 14:43:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-20 14:43:30,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:30,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677053607] [2023-12-20 14:43:30,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677053607] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:30,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716982288] [2023-12-20 14:43:30,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:30,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:30,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:30,923 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:30,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 14:43:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 14:43:31,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 14:43:31,018 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:31,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716982288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:31,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:31,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:31,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213912281] [2023-12-20 14:43:31,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:31,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:31,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:31,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:31,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:31,019 INFO L87 Difference]: Start difference. First operand 2189 states and 2845 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 14:43:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:31,261 INFO L93 Difference]: Finished difference Result 6381 states and 8375 transitions. [2023-12-20 14:43:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:31,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 122 [2023-12-20 14:43:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:31,275 INFO L225 Difference]: With dead ends: 6381 [2023-12-20 14:43:31,275 INFO L226 Difference]: Without dead ends: 4202 [2023-12-20 14:43:31,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:31,280 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 99 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:31,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 333 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:31,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2023-12-20 14:43:31,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 4200. [2023-12-20 14:43:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4200 states, 3338 states have (on average 1.2828040742959856) internal successors, (4282), 3392 states have internal predecessors, (4282), 483 states have call successors, (483), 341 states have call predecessors, (483), 378 states have return successors, (729), 470 states have call predecessors, (729), 483 states have call successors, (729) [2023-12-20 14:43:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4200 states to 4200 states and 5494 transitions. [2023-12-20 14:43:31,511 INFO L78 Accepts]: Start accepts. Automaton has 4200 states and 5494 transitions. Word has length 122 [2023-12-20 14:43:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:31,512 INFO L495 AbstractCegarLoop]: Abstraction has 4200 states and 5494 transitions. [2023-12-20 14:43:31,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 14:43:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 4200 states and 5494 transitions. [2023-12-20 14:43:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-20 14:43:31,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:31,516 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:31,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-20 14:43:31,723 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,SelfDestructingSolverStorable20 [2023-12-20 14:43:31,723 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:31,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:31,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1886775416, now seen corresponding path program 1 times [2023-12-20 14:43:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:31,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091450707] [2023-12-20 14:43:31,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:31,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 14:43:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 14:43:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 14:43:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-20 14:43:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-20 14:43:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:31,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091450707] [2023-12-20 14:43:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091450707] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:31,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569747149] [2023-12-20 14:43:31,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:31,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:31,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:31,806 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:31,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 14:43:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:31,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 14:43:31,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-20 14:43:31,925 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:31,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569747149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:31,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:31,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 14:43:31,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297598667] [2023-12-20 14:43:31,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:31,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 14:43:31,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:31,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 14:43:31,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:31,927 INFO L87 Difference]: Start difference. First operand 4200 states and 5494 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 14:43:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:32,122 INFO L93 Difference]: Finished difference Result 6027 states and 8051 transitions. [2023-12-20 14:43:32,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 14:43:32,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-12-20 14:43:32,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:32,134 INFO L225 Difference]: With dead ends: 6027 [2023-12-20 14:43:32,135 INFO L226 Difference]: Without dead ends: 3867 [2023-12-20 14:43:32,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 14:43:32,140 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 72 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:32,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 296 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:32,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2023-12-20 14:43:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3824. [2023-12-20 14:43:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 3043 states have (on average 1.264212947748932) internal successors, (3847), 3093 states have internal predecessors, (3847), 439 states have call successors, (439), 311 states have call predecessors, (439), 341 states have return successors, (645), 423 states have call predecessors, (645), 439 states have call successors, (645) [2023-12-20 14:43:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 4931 transitions. [2023-12-20 14:43:32,350 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 4931 transitions. Word has length 123 [2023-12-20 14:43:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:32,350 INFO L495 AbstractCegarLoop]: Abstraction has 3824 states and 4931 transitions. [2023-12-20 14:43:32,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 14:43:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 4931 transitions. [2023-12-20 14:43:32,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-20 14:43:32,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:32,355 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:32,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:32,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:32,561 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:32,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:32,562 INFO L85 PathProgramCache]: Analyzing trace with hash -476751664, now seen corresponding path program 1 times [2023-12-20 14:43:32,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:32,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664761150] [2023-12-20 14:43:32,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:32,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 14:43:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 14:43:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 14:43:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 14:43:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-20 14:43:32,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:32,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664761150] [2023-12-20 14:43:32,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664761150] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:32,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916269922] [2023-12-20 14:43:32,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:32,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:32,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:32,637 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:32,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 14:43:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:32,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 14:43:32,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-20 14:43:32,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:32,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916269922] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:32,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:32,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-20 14:43:32,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033861262] [2023-12-20 14:43:32,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:32,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:43:32,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:32,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:43:32,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:43:32,784 INFO L87 Difference]: Start difference. First operand 3824 states and 4931 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 14:43:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:33,031 INFO L93 Difference]: Finished difference Result 6194 states and 8091 transitions. [2023-12-20 14:43:33,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 14:43:33,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-12-20 14:43:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:33,039 INFO L225 Difference]: With dead ends: 6194 [2023-12-20 14:43:33,040 INFO L226 Difference]: Without dead ends: 3562 [2023-12-20 14:43:33,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-20 14:43:33,044 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 128 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:33,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 185 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2023-12-20 14:43:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 2582. [2023-12-20 14:43:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2582 states, 2061 states have (on average 1.2290150412421155) internal successors, (2533), 2089 states have internal predecessors, (2533), 299 states have call successors, (299), 207 states have call predecessors, (299), 221 states have return successors, (425), 287 states have call predecessors, (425), 299 states have call successors, (425) [2023-12-20 14:43:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 3257 transitions. [2023-12-20 14:43:33,198 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 3257 transitions. Word has length 124 [2023-12-20 14:43:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:33,198 INFO L495 AbstractCegarLoop]: Abstraction has 2582 states and 3257 transitions. [2023-12-20 14:43:33,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 14:43:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 3257 transitions. [2023-12-20 14:43:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-20 14:43:33,200 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:33,200 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:33,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:33,405 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,SelfDestructingSolverStorable22 [2023-12-20 14:43:33,406 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:33,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1360260654, now seen corresponding path program 1 times [2023-12-20 14:43:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:33,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524808820] [2023-12-20 14:43:33,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 14:43:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 14:43:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 14:43:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 14:43:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-20 14:43:33,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:33,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524808820] [2023-12-20 14:43:33,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524808820] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:33,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158487489] [2023-12-20 14:43:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:33,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:33,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:33,470 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:33,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-20 14:43:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:33,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 14:43:33,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-20 14:43:33,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:33,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158487489] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:33,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:33,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-20 14:43:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763425259] [2023-12-20 14:43:33,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:33,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 14:43:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 14:43:33,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 14:43:33,589 INFO L87 Difference]: Start difference. First operand 2582 states and 3257 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 14:43:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:33,771 INFO L93 Difference]: Finished difference Result 4577 states and 5829 transitions. [2023-12-20 14:43:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 14:43:33,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-12-20 14:43:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:33,776 INFO L225 Difference]: With dead ends: 4577 [2023-12-20 14:43:33,776 INFO L226 Difference]: Without dead ends: 2005 [2023-12-20 14:43:33,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-20 14:43:33,780 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 155 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:33,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 179 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 14:43:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2023-12-20 14:43:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1985. [2023-12-20 14:43:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1589 states have (on average 1.1529263687853997) internal successors, (1832), 1607 states have internal predecessors, (1832), 223 states have call successors, (223), 158 states have call predecessors, (223), 172 states have return successors, (296), 221 states have call predecessors, (296), 223 states have call successors, (296) [2023-12-20 14:43:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2351 transitions. [2023-12-20 14:43:33,875 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2351 transitions. Word has length 124 [2023-12-20 14:43:33,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:33,875 INFO L495 AbstractCegarLoop]: Abstraction has 1985 states and 2351 transitions. [2023-12-20 14:43:33,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 14:43:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2351 transitions. [2023-12-20 14:43:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-20 14:43:33,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:33,877 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:33,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-20 14:43:34,083 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,SelfDestructingSolverStorable23 [2023-12-20 14:43:34,083 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:34,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1388760944, now seen corresponding path program 1 times [2023-12-20 14:43:34,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:34,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468793848] [2023-12-20 14:43:34,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:34,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 14:43:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 14:43:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 14:43:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 14:43:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-20 14:43:34,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:34,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468793848] [2023-12-20 14:43:34,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468793848] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 14:43:34,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716045448] [2023-12-20 14:43:34,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:34,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 14:43:34,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 14:43:34,155 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 14:43:34,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-20 14:43:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 14:43:34,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 14:43:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-20 14:43:34,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 14:43:34,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716045448] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:34,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 14:43:34,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-20 14:43:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731160062] [2023-12-20 14:43:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:34,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 14:43:34,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:34,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 14:43:34,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:34,270 INFO L87 Difference]: Start difference. First operand 1985 states and 2351 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 14:43:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:34,390 INFO L93 Difference]: Finished difference Result 3128 states and 3728 transitions. [2023-12-20 14:43:34,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 14:43:34,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 124 [2023-12-20 14:43:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:34,393 INFO L225 Difference]: With dead ends: 3128 [2023-12-20 14:43:34,393 INFO L226 Difference]: Without dead ends: 782 [2023-12-20 14:43:34,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:34,397 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 2 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:34,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 337 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 14:43:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2023-12-20 14:43:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2023-12-20 14:43:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 625 states have (on average 1.1184) internal successors, (699), 632 states have internal predecessors, (699), 90 states have call successors, (90), 62 states have call predecessors, (90), 66 states have return successors, (101), 88 states have call predecessors, (101), 90 states have call successors, (101) [2023-12-20 14:43:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 890 transitions. [2023-12-20 14:43:34,457 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 890 transitions. Word has length 124 [2023-12-20 14:43:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:34,457 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 890 transitions. [2023-12-20 14:43:34,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-20 14:43:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 890 transitions. [2023-12-20 14:43:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-20 14:43:34,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 14:43:34,458 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:34,466 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-20 14:43:34,664 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,SelfDestructingSolverStorable24 [2023-12-20 14:43:34,664 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 14:43:34,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 14:43:34,665 INFO L85 PathProgramCache]: Analyzing trace with hash -805635248, now seen corresponding path program 1 times [2023-12-20 14:43:34,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 14:43:34,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757789750] [2023-12-20 14:43:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 14:43:34,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 14:43:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 14:43:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 14:43:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 14:43:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 14:43:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 14:43:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 14:43:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 14:43:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 14:43:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 14:43:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 14:43:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 14:43:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-20 14:43:34,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 14:43:34,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757789750] [2023-12-20 14:43:34,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757789750] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 14:43:34,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 14:43:34,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 14:43:34,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273580503] [2023-12-20 14:43:34,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 14:43:34,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 14:43:34,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 14:43:34,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 14:43:34,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 14:43:34,748 INFO L87 Difference]: Start difference. First operand 782 states and 890 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-20 14:43:35,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 14:43:35,106 INFO L93 Difference]: Finished difference Result 939 states and 1065 transitions. [2023-12-20 14:43:35,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 14:43:35,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 124 [2023-12-20 14:43:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 14:43:35,107 INFO L225 Difference]: With dead ends: 939 [2023-12-20 14:43:35,107 INFO L226 Difference]: Without dead ends: 0 [2023-12-20 14:43:35,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-20 14:43:35,108 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 326 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 14:43:35,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 320 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 14:43:35,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-20 14:43:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-20 14:43:35,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 14:43:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-20 14:43:35,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2023-12-20 14:43:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 14:43:35,109 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-20 14:43:35,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-20 14:43:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-20 14:43:35,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-20 14:43:35,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-20 14:43:35,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-20 14:43:35,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-20 14:43:35,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-20 14:43:46,381 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 706 716) no Hoare annotation was computed. [2023-12-20 14:43:46,382 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 706 716) no Hoare annotation was computed. [2023-12-20 14:43:46,382 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 706 716) the Hoare annotation is: (let ((.cse5 (< ~E_M~0 2)) (.cse0 (< ~T1_E~0 2)) (.cse12 (not (= ~t1_pc~0 1))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (not (= ~m_i~0 1))) (.cse4 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (not (= ~q_free~0 0))) (.cse13 (< |old(~m_st~0)| 2)) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 (< 0 ~t1_pc~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 (< |old(~t1_st~0)| 2) .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~token~0 ~local~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 (< ~E_1~0 2) (not (= (+ ~local~0 1) ~token~0)) .cse11) (or .cse1 (and (<= ~t1_pc~0 0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse4 .cse6 (and (<= 1 ~m_pc~0) (or (< ~m_pc~0 2) (< 1 ~t1_pc~0))) .cse7 .cse8 .cse9 .cse10 .cse13 .cse11))) [2023-12-20 14:43:46,382 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2023-12-20 14:43:46,382 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2023-12-20 14:43:46,382 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 84 108) the Hoare annotation is: (let ((.cse11 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (let ((.cse3 (and .cse11 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse9 (not (= 2 |old(~c_dr_st~0)|))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (= ~m_pc~0 1)) (.cse6 (not (= ~q_free~0 0))) (.cse7 (not (= ~E_1~0 ~M_E~0))) (.cse8 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (and .cse11 (= ~c_dr_st~0 2)))) (and (or .cse0 .cse1 (not (= ~p_num_write~0 1)) .cse2 .cse3 (not (= ~p_dw_pc~0 0)) .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse7 .cse8 (not (= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0)) (< |old(~p_dw_st~0)| 2)) (or .cse0 .cse1 .cse9 .cse2 .cse5 .cse7 .cse8 .cse10) (or .cse0 .cse1 .cse9 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)))))) [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L61(lines 49 63) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L80(lines 68 82) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L639-1(lines 628 651) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L634-1(lines 628 651) no Hoare annotation was computed. [2023-12-20 14:43:46,383 INFO L899 garLoopResultBuilder]: For program point L629-1(lines 628 651) no Hoare annotation was computed. [2023-12-20 14:43:46,384 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 625 652) the Hoare annotation is: (let ((.cse19 (not (= ~m_pc~0 ~t1_pc~0))) (.cse17 (< 0 ~t1_pc~0)) (.cse13 (not (= ~m_st~0 0))) (.cse0 (< ~t1_st~0 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse11 (< |old(~E_1~0)| 2)) (.cse12 (< |old(~E_M~0)| 2)) (.cse15 (< |old(~T1_E~0)| 2)) (.cse16 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (not (= ~m_i~0 1))) (.cse18 (< ~m_st~0 2)) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse10 (not (= ~q_free~0 0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= (+ ~local~0 1) ~token~0)) .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2)) .cse16) (or .cse1 .cse17 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (or .cse0 .cse19 .cse1 .cse17 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse19 .cse1 .cse17 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (or .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 (= ~m_pc~0 1) .cse8 .cse9 .cse10 .cse14))) [2023-12-20 14:43:46,384 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 625 652) no Hoare annotation was computed. [2023-12-20 14:43:46,384 INFO L899 garLoopResultBuilder]: For program point L644-1(lines 625 652) no Hoare annotation was computed. [2023-12-20 14:43:46,384 INFO L899 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2023-12-20 14:43:46,384 INFO L899 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2023-12-20 14:43:46,384 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 681 705) the Hoare annotation is: (let ((.cse18 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse15 (not (= ~token~0 ~local~0))) (.cse19 (not (= (+ ~local~0 1) ~token~0))) (.cse13 (< |old(~t1_st~0)| 2)) (.cse14 (not (= ~t1_pc~0 1))) (.cse0 (< ~T1_E~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (< 0 ~t1_pc~0)) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= ~m_i~0 1))) (.cse5 (and .cse18 (= ~m_st~0 |old(~m_st~0)|))) (.cse6 (< ~E_M~0 2)) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse16 (< |old(~m_st~0)| 2)) (.cse17 (< ~E_1~0 2)) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15) (or .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (= ~m_pc~0 1) .cse10 .cse11 .cse16 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse12 .cse15) (or .cse0 (and .cse18 (= ~m_st~0 0)) .cse1 .cse3 .cse4 .cse13 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |old(~m_st~0)| 0)) .cse17 .cse19 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse19 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse12)))) [2023-12-20 14:43:46,384 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2023-12-20 14:43:46,384 INFO L899 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2023-12-20 14:43:46,385 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 681 705) no Hoare annotation was computed. [2023-12-20 14:43:46,385 INFO L899 garLoopResultBuilder]: For program point L505(lines 493 507) no Hoare annotation was computed. [2023-12-20 14:43:46,385 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 701) no Hoare annotation was computed. [2023-12-20 14:43:46,385 INFO L899 garLoopResultBuilder]: For program point L697-2(lines 681 705) no Hoare annotation was computed. [2023-12-20 14:43:46,385 INFO L899 garLoopResultBuilder]: For program point L689(lines 689 693) no Hoare annotation was computed. [2023-12-20 14:43:46,385 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2023-12-20 14:43:46,385 INFO L899 garLoopResultBuilder]: For program point L689-2(lines 689 693) no Hoare annotation was computed. [2023-12-20 14:43:46,385 INFO L899 garLoopResultBuilder]: For program point L524(lines 512 526) no Hoare annotation was computed. [2023-12-20 14:43:46,385 INFO L899 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2023-12-20 14:43:46,385 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 528 535) no Hoare annotation was computed. [2023-12-20 14:43:46,385 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 528 535) the Hoare annotation is: true [2023-12-20 14:43:46,385 INFO L895 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse15 (= ~m_st~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse7 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~m_st~0)) (.cse11 (= ~m_i~0 1)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14))) [2023-12-20 14:43:46,385 INFO L899 garLoopResultBuilder]: For program point L779(lines 768 781) no Hoare annotation was computed. [2023-12-20 14:43:46,386 INFO L895 garLoopResultBuilder]: At program point L581(line 581) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse15 (= ~m_st~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse7 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~m_st~0)) (.cse11 (= ~m_i~0 1)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14))) [2023-12-20 14:43:46,386 INFO L899 garLoopResultBuilder]: For program point L317(lines 306 319) no Hoare annotation was computed. [2023-12-20 14:43:46,386 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2023-12-20 14:43:46,386 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 734) no Hoare annotation was computed. [2023-12-20 14:43:46,386 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 109 151) no Hoare annotation was computed. [2023-12-20 14:43:46,386 INFO L899 garLoopResultBuilder]: For program point L730-2(lines 729 752) no Hoare annotation was computed. [2023-12-20 14:43:46,386 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2023-12-20 14:43:46,386 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2023-12-20 14:43:46,386 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2023-12-20 14:43:46,386 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 210 227) no Hoare annotation was computed. [2023-12-20 14:43:46,386 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2023-12-20 14:43:46,386 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2023-12-20 14:43:46,386 INFO L899 garLoopResultBuilder]: For program point L583(line 583) no Hoare annotation was computed. [2023-12-20 14:43:46,387 INFO L895 garLoopResultBuilder]: At program point L798-1(lines 798 835) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse15 (= ~m_st~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse7 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~m_st~0)) (.cse11 (= ~m_i~0 1)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14))) [2023-12-20 14:43:46,387 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~c_num_read~0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~q_free~0 1) (not (= ~m_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= ~E_1~0 2) (<= 2 ~p_dw_st~0) (= ~M_E~0 2)) [2023-12-20 14:43:46,387 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2023-12-20 14:43:46,387 INFO L899 garLoopResultBuilder]: For program point L815(line 815) no Hoare annotation was computed. [2023-12-20 14:43:46,387 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 454 489) no Hoare annotation was computed. [2023-12-20 14:43:46,387 INFO L895 garLoopResultBuilder]: At program point L469-1(lines 469 482) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse9 (<= 2 ~T1_E~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse14 (<= 2 ~m_st~0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= (+ ~local~0 1) ~token~0) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse10 .cse11 .cse12 .cse13))) [2023-12-20 14:43:46,387 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2023-12-20 14:43:46,387 INFO L899 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2023-12-20 14:43:46,387 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2023-12-20 14:43:46,387 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 783 841) no Hoare annotation was computed. [2023-12-20 14:43:46,387 INFO L899 garLoopResultBuilder]: For program point L817(lines 817 826) no Hoare annotation was computed. [2023-12-20 14:43:46,387 INFO L899 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2023-12-20 14:43:46,387 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-20 14:43:46,388 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse7 (= ~p_dw_st~0 0)) (.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse16 (= ~q_free~0 0)) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (= ~p_num_write~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (= ~q_free~0 1)) (.cse6 (not (= ~m_pc~0 1))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~E_1~0 2)) (.cse15 (<= 2 ~p_dw_st~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse14 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse15 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse8 .cse15 .cse9) (and .cse1 .cse3 .cse4 .cse6 .cse13 .cse8 .cse9) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse6 .cse16 .cse8 .cse15 .cse9) (and .cse10 .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9))) [2023-12-20 14:43:46,388 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2023-12-20 14:43:46,388 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 410 453) no Hoare annotation was computed. [2023-12-20 14:43:46,388 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 729 752) no Hoare annotation was computed. [2023-12-20 14:43:46,388 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2023-12-20 14:43:46,388 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2023-12-20 14:43:46,388 INFO L895 garLoopResultBuilder]: At program point L125-1(lines 125 145) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 1)) (.cse0 (= ~c_dr_st~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse5 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse6 (= ~E_1~0 2)) (.cse7 (= ~M_E~0 2))) (or (and (= ~c_num_read~0 ~p_num_write~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 (= ~c_last_read~0 ~p_last_write~0) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse5 .cse8 .cse6 .cse7) (and .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse5 .cse9 .cse6 .cse7))) [2023-12-20 14:43:46,388 INFO L895 garLoopResultBuilder]: At program point L604-1(lines 580 618) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse15 (= ~m_st~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse7 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~m_st~0)) (.cse11 (= ~m_i~0 1)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14))) [2023-12-20 14:43:46,388 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 321 349) no Hoare annotation was computed. [2023-12-20 14:43:46,389 INFO L895 garLoopResultBuilder]: At program point L439-1(lines 425 446) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 .cse8 (<= ~t1_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-12-20 14:43:46,389 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_free~0 0)) (.cse8 (= ~c_dr_st~0 2)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (not (= ~m_pc~0 1))) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_1~0 2)) (.cse7 (= ~M_E~0 2))) (or (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~p_num_write~0 1) .cse6 .cse7) (and .cse8 .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7))) [2023-12-20 14:43:46,389 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2023-12-20 14:43:46,389 INFO L899 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2023-12-20 14:43:46,389 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2023-12-20 14:43:46,389 INFO L895 garLoopResultBuilder]: At program point L770(line 770) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse15 (= ~m_st~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse7 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~m_st~0)) (.cse11 (= ~m_i~0 1)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14))) [2023-12-20 14:43:46,389 INFO L899 garLoopResultBuilder]: For program point L770-1(line 770) no Hoare annotation was computed. [2023-12-20 14:43:46,389 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2023-12-20 14:43:46,389 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse7 (= ~p_dw_st~0 0)) (.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse16 (= ~q_free~0 0)) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (= ~p_num_write~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (= ~q_free~0 1)) (.cse6 (not (= ~m_pc~0 1))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~E_1~0 2)) (.cse15 (<= 2 ~p_dw_st~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse14 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse15 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse8 .cse15 .cse9) (and .cse1 .cse3 .cse4 .cse6 .cse13 .cse8 .cse9) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse6 .cse16 .cse8 .cse15 .cse9) (and .cse10 .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9))) [2023-12-20 14:43:46,389 INFO L899 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2023-12-20 14:43:46,389 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 574 624) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 135) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 539 552) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L895 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse15 (= ~m_st~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse7 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~m_st~0)) (.cse11 (= ~m_i~0 1)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14))) [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L821-1(line 821) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L590-1(lines 580 618) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L772(lines 772 777) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 153 209) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L607-2(lines 607 614) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2023-12-20 14:43:46,390 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-20 14:43:46,391 INFO L895 garLoopResultBuilder]: At program point L806(line 806) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse15 (= ~m_st~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse7 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~m_st~0)) (.cse11 (= ~m_i~0 1)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14))) [2023-12-20 14:43:46,391 INFO L899 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2023-12-20 14:43:46,391 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2023-12-20 14:43:46,391 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 729 752) no Hoare annotation was computed. [2023-12-20 14:43:46,391 INFO L899 garLoopResultBuilder]: For program point L856(lines 856 859) no Hoare annotation was computed. [2023-12-20 14:43:46,391 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 248 301) no Hoare annotation was computed. [2023-12-20 14:43:46,391 INFO L895 garLoopResultBuilder]: At program point L791(line 791) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (<= ~t1_pc~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (= ~M_E~0 2)) [2023-12-20 14:43:46,391 INFO L899 garLoopResultBuilder]: For program point L791-1(line 791) no Hoare annotation was computed. [2023-12-20 14:43:46,391 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2023-12-20 14:43:46,391 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2023-12-20 14:43:46,391 INFO L899 garLoopResultBuilder]: For program point L593-2(lines 593 600) no Hoare annotation was computed. [2023-12-20 14:43:46,391 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2023-12-20 14:43:46,391 INFO L895 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse7 (= ~p_dw_st~0 0)) (.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse16 (= ~q_free~0 0)) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (= ~p_num_write~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (= ~q_free~0 1)) (.cse6 (not (= ~m_pc~0 1))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~E_1~0 2)) (.cse15 (<= 2 ~p_dw_st~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse14 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse15 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse8 .cse15 .cse9) (and .cse1 .cse3 .cse4 .cse6 .cse13 .cse8 .cse9) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse6 .cse16 .cse8 .cse15 .cse9) (and .cse10 .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9))) [2023-12-20 14:43:46,391 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2023-12-20 14:43:46,392 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2023-12-20 14:43:46,392 INFO L899 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2023-12-20 14:43:46,392 INFO L899 garLoopResultBuilder]: For program point $Ultimate##101(lines 439 445) no Hoare annotation was computed. [2023-12-20 14:43:46,392 INFO L899 garLoopResultBuilder]: For program point L545-1(lines 536 553) no Hoare annotation was computed. [2023-12-20 14:43:46,392 INFO L895 garLoopResultBuilder]: At program point L479(line 479) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_free~0 0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~m_i~0 1)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~t1_pc~0 1) .cse0 (<= 2 ~E_1~0) .cse1 .cse2 (= (+ ~local~0 1) ~token~0) .cse3 .cse4 .cse5 (<= 2 ~T1_E~0) .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (or (< 0 ~t1_pc~0) (< 0 ~m_pc~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (or (< ~m_pc~0 1) (and (<= ~t1_pc~0 1) (<= 2 ~m_pc~0)))))) [2023-12-20 14:43:46,392 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2023-12-20 14:43:46,392 INFO L895 garLoopResultBuilder]: At program point L793(line 793) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_1~0 2)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0) .cse14 .cse15) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-20 14:43:46,392 INFO L895 garLoopResultBuilder]: At program point L793-1(line 793) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_1~0 2)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0) .cse14 .cse15) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-20 14:43:46,392 INFO L895 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse15 (= ~m_st~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse7 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~m_st~0)) (.cse11 (= ~m_i~0 1)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14))) [2023-12-20 14:43:46,392 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2023-12-20 14:43:46,392 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse7 (= ~p_dw_st~0 0)) (.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse16 (= ~q_free~0 0)) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (= ~p_num_write~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (= ~q_free~0 1)) (.cse6 (not (= ~m_pc~0 1))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~E_1~0 2)) (.cse15 (<= 2 ~p_dw_st~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse14 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse15 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse8 .cse15 .cse9) (and .cse1 .cse3 .cse4 .cse6 .cse13 .cse8 .cse9) (and .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse6 .cse16 .cse8 .cse15 .cse9) (and .cse10 .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse14 .cse8 .cse15 .cse9))) [2023-12-20 14:43:46,393 INFO L895 garLoopResultBuilder]: At program point L810-1(line 810) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse15 (= ~m_st~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse7 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~m_st~0)) (.cse11 (= ~m_i~0 1)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14))) [2023-12-20 14:43:46,393 INFO L899 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2023-12-20 14:43:46,393 INFO L895 garLoopResultBuilder]: At program point L794(line 794) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_1~0 2)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0) .cse14 .cse15) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-20 14:43:46,393 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2023-12-20 14:43:46,393 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 (<= ~t1_pc~0 0) .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-12-20 14:43:46,393 INFO L899 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2023-12-20 14:43:46,393 INFO L895 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse15 (= ~m_st~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse7 (<= 2 ~E_M~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse17 (= ~token~0 ~local~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (<= 2 ~m_st~0)) (.cse11 (= ~m_i~0 1)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse15 .cse8 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse2 .cse4 .cse5 .cse6 .cse16 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14))) [2023-12-20 14:43:46,393 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2023-12-20 14:43:46,393 INFO L899 garLoopResultBuilder]: For program point L745-1(lines 726 753) no Hoare annotation was computed. [2023-12-20 14:43:46,393 INFO L895 garLoopResultBuilder]: At program point L200-1(lines 168 203) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~q_free~0 1)) (.cse5 (not (= ~m_pc~0 1))) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= ~E_1~0 2)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse8 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~p_dw_st~0 0) .cse6 .cse7 .cse8) (and .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse5 (= ~q_free~0 0) .cse7 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse8))) [2023-12-20 14:43:46,393 INFO L899 garLoopResultBuilder]: For program point L244(lines 231 246) no Hoare annotation was computed. [2023-12-20 14:43:46,393 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2023-12-20 14:43:46,393 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 228 247) the Hoare annotation is: true [2023-12-20 14:43:46,393 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2023-12-20 14:43:46,393 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2023-12-20 14:43:46,394 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-12-20 14:43:46,394 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-12-20 14:43:46,394 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-12-20 14:43:46,394 INFO L899 garLoopResultBuilder]: For program point L570(lines 557 572) no Hoare annotation was computed. [2023-12-20 14:43:46,394 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 567) no Hoare annotation was computed. [2023-12-20 14:43:46,394 INFO L899 garLoopResultBuilder]: For program point L558(lines 558 568) no Hoare annotation was computed. [2023-12-20 14:43:46,394 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 554 573) the Hoare annotation is: true [2023-12-20 14:43:46,394 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 554 573) no Hoare annotation was computed. [2023-12-20 14:43:46,394 INFO L899 garLoopResultBuilder]: For program point L672-1(lines 653 680) no Hoare annotation was computed. [2023-12-20 14:43:46,394 INFO L899 garLoopResultBuilder]: For program point L667-1(lines 656 679) no Hoare annotation was computed. [2023-12-20 14:43:46,394 INFO L899 garLoopResultBuilder]: For program point L662-1(lines 656 679) no Hoare annotation was computed. [2023-12-20 14:43:46,394 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 653 680) no Hoare annotation was computed. [2023-12-20 14:43:46,394 INFO L899 garLoopResultBuilder]: For program point L657-1(lines 656 679) no Hoare annotation was computed. [2023-12-20 14:43:46,394 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 653 680) the Hoare annotation is: (let ((.cse19 (not (= ~m_pc~0 ~t1_pc~0))) (.cse17 (< 0 ~t1_pc~0)) (.cse13 (not (= ~m_st~0 0))) (.cse0 (< ~t1_st~0 2)) (.cse4 (not (= ~t1_pc~0 1))) (.cse11 (< |old(~E_1~0)| 2)) (.cse12 (< |old(~E_M~0)| 2)) (.cse15 (< |old(~T1_E~0)| 2)) (.cse16 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (not (= ~m_i~0 1))) (.cse18 (< ~m_st~0 2)) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse10 (not (= ~q_free~0 0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= (+ ~local~0 1) ~token~0)) .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and (<= 1 ~m_pc~0) (< ~m_pc~0 2)) .cse16) (or .cse1 .cse17 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (or .cse0 .cse19 .cse1 .cse17 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse19 .cse1 .cse17 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (or .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 (= ~m_pc~0 1) .cse8 .cse9 .cse10 .cse14))) [2023-12-20 14:43:46,397 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 14:43:46,398 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 14:43:46,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 02:43:46 BoogieIcfgContainer [2023-12-20 14:43:46,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 14:43:46,419 INFO L158 Benchmark]: Toolchain (without parser) took 27607.86ms. Allocated memory was 291.5MB in the beginning and 1.0GB in the end (delta: 708.8MB). Free memory was 247.5MB in the beginning and 905.9MB in the end (delta: -658.4MB). Peak memory consumption was 597.8MB. Max. memory is 8.0GB. [2023-12-20 14:43:46,419 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 223.3MB. Free memory is still 173.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 14:43:46,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.88ms. Allocated memory is still 291.5MB. Free memory was 247.5MB in the beginning and 230.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-20 14:43:46,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.53ms. Allocated memory is still 291.5MB. Free memory was 230.9MB in the beginning and 228.1MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 14:43:46,419 INFO L158 Benchmark]: Boogie Preprocessor took 35.46ms. Allocated memory is still 291.5MB. Free memory was 228.1MB in the beginning and 225.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 14:43:46,419 INFO L158 Benchmark]: RCFGBuilder took 466.84ms. Allocated memory is still 291.5MB. Free memory was 225.2MB in the beginning and 251.4MB in the end (delta: -26.2MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. [2023-12-20 14:43:46,420 INFO L158 Benchmark]: TraceAbstraction took 26820.39ms. Allocated memory was 291.5MB in the beginning and 1.0GB in the end (delta: 708.8MB). Free memory was 250.9MB in the beginning and 905.9MB in the end (delta: -655.1MB). Peak memory consumption was 600.1MB. Max. memory is 8.0GB. [2023-12-20 14:43:46,420 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.09ms. Allocated memory is still 223.3MB. Free memory is still 173.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.88ms. Allocated memory is still 291.5MB. Free memory was 247.5MB in the beginning and 230.9MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.53ms. Allocated memory is still 291.5MB. Free memory was 230.9MB in the beginning and 228.1MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.46ms. Allocated memory is still 291.5MB. Free memory was 228.1MB in the beginning and 225.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 466.84ms. Allocated memory is still 291.5MB. Free memory was 225.2MB in the beginning and 251.4MB in the end (delta: -26.2MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. * TraceAbstraction took 26820.39ms. Allocated memory was 291.5MB in the beginning and 1.0GB in the end (delta: 708.8MB). Free memory was 250.9MB in the beginning and 905.9MB in the end (delta: -655.1MB). Peak memory consumption was 600.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 390]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 158 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 26.8s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6186 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5992 mSDsluCounter, 11137 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6781 mSDsCounter, 905 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6946 IncrementalHoareTripleChecker+Invalid, 7851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 905 mSolverCounterUnsat, 4356 mSDtfsCounter, 6946 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1942 GetRequests, 1752 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4200occurred in iteration=21, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 2647 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 2678 PreInvPairs, 3045 NumberOfFragments, 7918 HoareAnnotationTreeSize, 2678 FormulaSimplifications, 8434 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 37 FormulaSimplificationsInter, 43371 FormulaSimplificationTreeSizeReductionInter, 9.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 3317 NumberOfCodeBlocks, 3317 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3398 ConstructedInterpolants, 0 QuantifiedInterpolants, 5745 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4523 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 40 InterpolantComputations, 25 PerfectInterpolantSequences, 1365/1497 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) || ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_last_read == p_last_write)) && (E_1 == 2)) && (M_E == 2)) || (((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && (c_last_read == p_last_write)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && (p_dw_st == 0)) && (E_1 == 2)) && (M_E == 2)) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((c_dr_st == 2) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 0)) && (E_1 == 2)) && (M_E == 2))) || (((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && (E_1 == 2)) && (M_E == 2)) || ((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_1 == 2)) && (M_E == 2))) || ((((((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && (E_1 == 2)) && (M_E == 2))) || (((((((c_dr_st == 2) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 0)) && (E_1 == 2)) && (M_E == 2))) || ((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && (p_dw_st == 0)) && (E_1 == 2)) && (M_E == 2)) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((c_dr_st == 2) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((c_dr_st == 2) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (c_dr_pc == 0)) && (E_1 == 2)) && (M_E == 2))) || (((((((((p_last_write == q_buf_0) && ((c_num_read + 1) == p_num_write)) && (m_pc == t1_pc)) && (T1_E == 2)) && !((m_pc == 1))) && (q_free == 0)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (T1_E == 2)) && (q_free == 1)) && !((m_pc == 1))) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) - InvariantResult [Line: 798]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (t1_pc <= 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && ((local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((2 <= t1_st) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (m_pc == t1_pc)) && (2 <= E_M)) && (m_st == 0)) && (q_free == 0)) && (t1_pc <= 0)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= m_st)) && (2 <= T1_E)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && !((m_pc == 1))) && (q_free == 0)) && (2 <= m_st)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) RESULT: Ultimate proved your program to be correct! [2023-12-20 14:43:46,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...