/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 18:03:53,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 18:03:54,000 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-15 18:03:54,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 18:03:54,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 18:03:54,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 18:03:54,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 18:03:54,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 18:03:54,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 18:03:54,023 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 18:03:54,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 18:03:54,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 18:03:54,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 18:03:54,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 18:03:54,025 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 18:03:54,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 18:03:54,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 18:03:54,026 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 18:03:54,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 18:03:54,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 18:03:54,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 18:03:54,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 18:03:54,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 18:03:54,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 18:03:54,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 18:03:54,028 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 18:03:54,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 18:03:54,029 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 18:03:54,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 18:03:54,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 18:03:54,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 18:03:54,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 18:03:54,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 18:03:54,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 18:03:54,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 18:03:54,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 18:03:54,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 18:03:54,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 18:03:54,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 18:03:54,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 18:03:54,032 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 18:03:54,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 18:03:54,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 18:03:54,033 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 18:03:54,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 18:03:54,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 18:03:54,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 18:03:54,234 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 18:03:54,234 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 18:03:54,235 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-2.c [2023-12-15 18:03:55,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 18:03:55,573 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 18:03:55,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2023-12-15 18:03:55,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d4e93c/bf75ad9121184404a5facd4aadde5d7e/FLAGdf22247dc [2023-12-15 18:03:55,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d4e93c/bf75ad9121184404a5facd4aadde5d7e [2023-12-15 18:03:55,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 18:03:55,604 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 18:03:55,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 18:03:55,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 18:03:55,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 18:03:55,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 06:03:55" (1/1) ... [2023-12-15 18:03:55,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4a3d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:55, skipping insertion in model container [2023-12-15 18:03:55,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 06:03:55" (1/1) ... [2023-12-15 18:03:55,654 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 18:03:55,818 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-2.c[913,926] [2023-12-15 18:03:55,887 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-2.c[5977,5990] [2023-12-15 18:03:55,930 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 18:03:55,950 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 18:03:55,963 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-2.c[913,926] [2023-12-15 18:03:55,991 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-2.c[5977,5990] [2023-12-15 18:03:56,007 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 18:03:56,024 INFO L206 MainTranslator]: Completed translation [2023-12-15 18:03:56,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56 WrapperNode [2023-12-15 18:03:56,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 18:03:56,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 18:03:56,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 18:03:56,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 18:03:56,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (1/1) ... [2023-12-15 18:03:56,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (1/1) ... [2023-12-15 18:03:56,069 INFO L138 Inliner]: procedures = 50, calls = 52, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 429 [2023-12-15 18:03:56,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 18:03:56,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 18:03:56,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 18:03:56,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 18:03:56,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (1/1) ... [2023-12-15 18:03:56,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (1/1) ... [2023-12-15 18:03:56,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (1/1) ... [2023-12-15 18:03:56,114 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-15 18:03:56,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (1/1) ... [2023-12-15 18:03:56,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (1/1) ... [2023-12-15 18:03:56,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (1/1) ... [2023-12-15 18:03:56,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (1/1) ... [2023-12-15 18:03:56,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (1/1) ... [2023-12-15 18:03:56,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (1/1) ... [2023-12-15 18:03:56,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 18:03:56,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 18:03:56,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 18:03:56,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 18:03:56,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (1/1) ... [2023-12-15 18:03:56,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 18:03:56,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:03:56,180 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-15 18:03:56,189 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-15 18:03:56,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 18:03:56,208 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-15 18:03:56,208 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-15 18:03:56,208 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-12-15 18:03:56,208 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-12-15 18:03:56,208 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-15 18:03:56,208 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-15 18:03:56,208 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-15 18:03:56,209 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-15 18:03:56,209 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-15 18:03:56,209 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-15 18:03:56,209 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-15 18:03:56,209 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-15 18:03:56,209 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-15 18:03:56,209 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-15 18:03:56,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 18:03:56,210 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-15 18:03:56,210 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-15 18:03:56,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 18:03:56,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 18:03:56,210 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-15 18:03:56,210 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-15 18:03:56,210 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2023-12-15 18:03:56,210 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2023-12-15 18:03:56,286 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 18:03:56,288 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 18:03:56,664 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 18:03:56,719 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 18:03:56,719 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-15 18:03:56,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 06:03:56 BoogieIcfgContainer [2023-12-15 18:03:56,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 18:03:56,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 18:03:56,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 18:03:56,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 18:03:56,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 06:03:55" (1/3) ... [2023-12-15 18:03:56,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79622219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 06:03:56, skipping insertion in model container [2023-12-15 18:03:56,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 06:03:56" (2/3) ... [2023-12-15 18:03:56,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79622219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 06:03:56, skipping insertion in model container [2023-12-15 18:03:56,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 06:03:56" (3/3) ... [2023-12-15 18:03:56,729 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2023-12-15 18:03:56,741 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 18:03:56,742 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-15 18:03:56,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 18:03:56,793 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;@14196b5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 18:03:56,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-15 18:03:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 130 states have (on average 1.646153846153846) internal successors, (214), 137 states have internal predecessors, (214), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-15 18:03:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-15 18:03:56,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:03:56,807 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-15 18:03:56,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:03:56,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:03:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash -606829876, now seen corresponding path program 1 times [2023-12-15 18:03:56,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:03:56,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182351888] [2023-12-15 18:03:56,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:03:56,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:03:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:57,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 18:03:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:57,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 18:03:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:57,075 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-15 18:03:57,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:03:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182351888] [2023-12-15 18:03:57,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182351888] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:03:57,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:03:57,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 18:03:57,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226402902] [2023-12-15 18:03:57,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:03:57,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 18:03:57,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:03:57,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 18:03:57,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 18:03:57,106 INFO L87 Difference]: Start difference. First operand has 166 states, 130 states have (on average 1.646153846153846) internal successors, (214), 137 states have internal predecessors, (214), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) 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-15 18:03:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:03:57,462 INFO L93 Difference]: Finished difference Result 383 states and 606 transitions. [2023-12-15 18:03:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 18:03:57,465 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-15 18:03:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:03:57,481 INFO L225 Difference]: With dead ends: 383 [2023-12-15 18:03:57,482 INFO L226 Difference]: Without dead ends: 223 [2023-12-15 18:03:57,487 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-15 18:03:57,492 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 272 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 18:03:57,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 354 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 18:03:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-12-15 18:03:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2023-12-15 18:03:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.4745762711864407) internal successors, (261), 182 states have internal predecessors, (261), 27 states have call successors, (27), 12 states have call predecessors, (27), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2023-12-15 18:03:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 317 transitions. [2023-12-15 18:03:57,579 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 317 transitions. Word has length 37 [2023-12-15 18:03:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:03:57,580 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 317 transitions. [2023-12-15 18:03:57,580 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-15 18:03:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 317 transitions. [2023-12-15 18:03:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-15 18:03:57,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:03:57,589 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-15 18:03:57,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 18:03:57,589 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:03:57,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:03:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1995858696, now seen corresponding path program 1 times [2023-12-15 18:03:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:03:57,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364802616] [2023-12-15 18:03:57,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:03:57,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:03:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:57,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 18:03:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:57,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 18:03:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:57,710 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-15 18:03:57,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:03:57,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364802616] [2023-12-15 18:03:57,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364802616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:03:57,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:03:57,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 18:03:57,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880709314] [2023-12-15 18:03:57,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:03:57,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 18:03:57,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:03:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 18:03:57,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 18:03:57,714 INFO L87 Difference]: Start difference. First operand 217 states and 317 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-15 18:03:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:03:57,982 INFO L93 Difference]: Finished difference Result 451 states and 661 transitions. [2023-12-15 18:03:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 18:03:57,983 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-15 18:03:57,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:03:57,986 INFO L225 Difference]: With dead ends: 451 [2023-12-15 18:03:57,986 INFO L226 Difference]: Without dead ends: 340 [2023-12-15 18:03:57,987 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-15 18:03:57,988 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 285 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 18:03:57,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 343 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 18:03:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-12-15 18:03:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 317. [2023-12-15 18:03:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 264 states have (on average 1.4356060606060606) internal successors, (379), 270 states have internal predecessors, (379), 35 states have call successors, (35), 16 states have call predecessors, (35), 16 states have return successors, (43), 31 states have call predecessors, (43), 31 states have call successors, (43) [2023-12-15 18:03:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 457 transitions. [2023-12-15 18:03:58,019 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 457 transitions. Word has length 38 [2023-12-15 18:03:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:03:58,019 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 457 transitions. [2023-12-15 18:03:58,020 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-15 18:03:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 457 transitions. [2023-12-15 18:03:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-15 18:03:58,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:03:58,021 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-15 18:03:58,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 18:03:58,022 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:03:58,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:03:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash -691838602, now seen corresponding path program 1 times [2023-12-15 18:03:58,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:03:58,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466019495] [2023-12-15 18:03:58,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:03:58,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:03:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:58,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 18:03:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-15 18:03:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:58,083 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-15 18:03:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:03:58,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466019495] [2023-12-15 18:03:58,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466019495] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:03:58,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:03:58,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 18:03:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645492016] [2023-12-15 18:03:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:03:58,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 18:03:58,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:03:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 18:03:58,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 18:03:58,086 INFO L87 Difference]: Start difference. First operand 317 states and 457 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-15 18:03:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:03:58,317 INFO L93 Difference]: Finished difference Result 737 states and 1038 transitions. [2023-12-15 18:03:58,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 18:03:58,317 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-15 18:03:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:03:58,324 INFO L225 Difference]: With dead ends: 737 [2023-12-15 18:03:58,325 INFO L226 Difference]: Without dead ends: 526 [2023-12-15 18:03:58,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 18:03:58,330 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 138 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 18:03:58,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 457 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 18:03:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2023-12-15 18:03:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 422. [2023-12-15 18:03:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 357 states have (on average 1.42296918767507) internal successors, (508), 365 states have internal predecessors, (508), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2023-12-15 18:03:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 598 transitions. [2023-12-15 18:03:58,366 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 598 transitions. Word has length 39 [2023-12-15 18:03:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:03:58,366 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 598 transitions. [2023-12-15 18:03:58,366 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-15 18:03:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 598 transitions. [2023-12-15 18:03:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-15 18:03:58,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:03:58,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:03:58,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 18:03:58,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:03:58,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:03:58,369 INFO L85 PathProgramCache]: Analyzing trace with hash -717734268, now seen corresponding path program 1 times [2023-12-15 18:03:58,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:03:58,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928069406] [2023-12-15 18:03:58,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:03:58,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:03:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:03:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:58,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:03:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:58,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:03:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:58,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:03:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:58,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:03:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:58,442 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-15 18:03:58,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:03:58,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928069406] [2023-12-15 18:03:58,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928069406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:03:58,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:03:58,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 18:03:58,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556745475] [2023-12-15 18:03:58,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:03:58,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 18:03:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:03:58,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 18:03:58,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 18:03:58,449 INFO L87 Difference]: Start difference. First operand 422 states and 598 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, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 18:03:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:03:58,798 INFO L93 Difference]: Finished difference Result 538 states and 774 transitions. [2023-12-15 18:03:58,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 18:03:58,799 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, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-15 18:03:58,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:03:58,803 INFO L225 Difference]: With dead ends: 538 [2023-12-15 18:03:58,803 INFO L226 Difference]: Without dead ends: 442 [2023-12-15 18:03:58,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-15 18:03:58,811 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 262 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 18:03:58,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 396 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 18:03:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-12-15 18:03:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 422. [2023-12-15 18:03:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 357 states have (on average 1.4201680672268908) internal successors, (507), 365 states have internal predecessors, (507), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2023-12-15 18:03:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 597 transitions. [2023-12-15 18:03:58,856 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 597 transitions. Word has length 52 [2023-12-15 18:03:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:03:58,857 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 597 transitions. [2023-12-15 18:03:58,857 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, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 18:03:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 597 transitions. [2023-12-15 18:03:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-15 18:03:58,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:03:58,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 18:03:58,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 18:03:58,862 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:03:58,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:03:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1648960326, now seen corresponding path program 1 times [2023-12-15 18:03:58,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:03:58,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522341093] [2023-12-15 18:03:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:03:58,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:03:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:58,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:03:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:58,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:03:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:59,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:03:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:59,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:03:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:59,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:03:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 18:03:59,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:03:59,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522341093] [2023-12-15 18:03:59,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522341093] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:03:59,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:03:59,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 18:03:59,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444041383] [2023-12-15 18:03:59,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:03:59,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 18:03:59,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:03:59,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 18:03:59,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 18:03:59,051 INFO L87 Difference]: Start difference. First operand 422 states and 597 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 18:03:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:03:59,611 INFO L93 Difference]: Finished difference Result 645 states and 933 transitions. [2023-12-15 18:03:59,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 18:03:59,614 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-15 18:03:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:03:59,622 INFO L225 Difference]: With dead ends: 645 [2023-12-15 18:03:59,622 INFO L226 Difference]: Without dead ends: 552 [2023-12-15 18:03:59,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-15 18:03:59,626 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 427 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 18:03:59,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 516 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 18:03:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2023-12-15 18:03:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 511. [2023-12-15 18:03:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 429 states have (on average 1.435897435897436) internal successors, (616), 438 states have internal predecessors, (616), 51 states have call successors, (51), 28 states have call predecessors, (51), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2023-12-15 18:03:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 729 transitions. [2023-12-15 18:03:59,666 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 729 transitions. Word has length 52 [2023-12-15 18:03:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:03:59,668 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 729 transitions. [2023-12-15 18:03:59,668 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 18:03:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 729 transitions. [2023-12-15 18:03:59,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-15 18:03:59,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:03:59,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:03:59,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 18:03:59,670 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:03:59,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:03:59,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2115961538, now seen corresponding path program 1 times [2023-12-15 18:03:59,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:03:59,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987869507] [2023-12-15 18:03:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:03:59,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:03:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:59,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:03:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:59,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:03:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:59,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:03:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:59,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:03:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:59,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:03:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:03:59,808 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-15 18:03:59,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:03:59,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987869507] [2023-12-15 18:03:59,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987869507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:03:59,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:03:59,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 18:03:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859007277] [2023-12-15 18:03:59,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:03:59,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 18:03:59,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:03:59,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 18:03:59,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 18:03:59,810 INFO L87 Difference]: Start difference. First operand 511 states and 729 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 18:04:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:00,538 INFO L93 Difference]: Finished difference Result 840 states and 1215 transitions. [2023-12-15 18:04:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 18:04:00,538 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-15 18:04:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:00,542 INFO L225 Difference]: With dead ends: 840 [2023-12-15 18:04:00,543 INFO L226 Difference]: Without dead ends: 658 [2023-12-15 18:04:00,543 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-15 18:04:00,544 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 426 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:00,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 847 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 18:04:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2023-12-15 18:04:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 595. [2023-12-15 18:04:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 496 states have (on average 1.4415322580645162) internal successors, (715), 506 states have internal predecessors, (715), 61 states have call successors, (61), 34 states have call predecessors, (61), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2023-12-15 18:04:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 850 transitions. [2023-12-15 18:04:00,606 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 850 transitions. Word has length 52 [2023-12-15 18:04:00,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:00,606 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 850 transitions. [2023-12-15 18:04:00,606 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 18:04:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 850 transitions. [2023-12-15 18:04:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-15 18:04:00,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:00,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:04:00,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 18:04:00,608 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:00,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1755359036, now seen corresponding path program 1 times [2023-12-15 18:04:00,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:00,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556286851] [2023-12-15 18:04:00,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:00,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:00,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:00,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:00,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:00,715 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-15 18:04:00,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:00,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556286851] [2023-12-15 18:04:00,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556286851] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:00,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:04:00,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 18:04:00,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911966959] [2023-12-15 18:04:00,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:00,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 18:04:00,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:00,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 18:04:00,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 18:04:00,717 INFO L87 Difference]: Start difference. First operand 595 states and 850 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 18:04:01,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:01,381 INFO L93 Difference]: Finished difference Result 1142 states and 1654 transitions. [2023-12-15 18:04:01,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 18:04:01,382 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-15 18:04:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:01,386 INFO L225 Difference]: With dead ends: 1142 [2023-12-15 18:04:01,387 INFO L226 Difference]: Without dead ends: 876 [2023-12-15 18:04:01,388 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-15 18:04:01,389 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 418 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:01,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 834 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 18:04:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2023-12-15 18:04:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 743. [2023-12-15 18:04:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 612 states have (on average 1.4411764705882353) internal successors, (882), 624 states have internal predecessors, (882), 79 states have call successors, (79), 46 states have call predecessors, (79), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2023-12-15 18:04:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1061 transitions. [2023-12-15 18:04:01,445 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1061 transitions. Word has length 52 [2023-12-15 18:04:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:01,445 INFO L495 AbstractCegarLoop]: Abstraction has 743 states and 1061 transitions. [2023-12-15 18:04:01,446 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 18:04:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1061 transitions. [2023-12-15 18:04:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-15 18:04:01,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:01,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:04:01,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 18:04:01,451 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:01,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:01,452 INFO L85 PathProgramCache]: Analyzing trace with hash 694241094, now seen corresponding path program 1 times [2023-12-15 18:04:01,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:01,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299014456] [2023-12-15 18:04:01,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:01,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:01,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:01,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:01,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:01,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:01,557 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-15 18:04:01,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:01,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299014456] [2023-12-15 18:04:01,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299014456] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:01,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:04:01,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 18:04:01,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973808254] [2023-12-15 18:04:01,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:01,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 18:04:01,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:01,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 18:04:01,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 18:04:01,559 INFO L87 Difference]: Start difference. First operand 743 states and 1061 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 18:04:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:02,125 INFO L93 Difference]: Finished difference Result 1511 states and 2192 transitions. [2023-12-15 18:04:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 18:04:02,126 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-15 18:04:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:02,131 INFO L225 Difference]: With dead ends: 1511 [2023-12-15 18:04:02,131 INFO L226 Difference]: Without dead ends: 1098 [2023-12-15 18:04:02,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 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-15 18:04:02,133 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 523 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:02,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 598 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 18:04:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2023-12-15 18:04:02,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 973. [2023-12-15 18:04:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 791 states have (on average 1.4310998735777496) internal successors, (1132), 808 states have internal predecessors, (1132), 110 states have call successors, (110), 64 states have call predecessors, (110), 70 states have return successors, (135), 104 states have call predecessors, (135), 106 states have call successors, (135) [2023-12-15 18:04:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1377 transitions. [2023-12-15 18:04:02,191 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1377 transitions. Word has length 52 [2023-12-15 18:04:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:02,191 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1377 transitions. [2023-12-15 18:04:02,191 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 18:04:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1377 transitions. [2023-12-15 18:04:02,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-15 18:04:02,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:02,193 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-15 18:04:02,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 18:04:02,193 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:02,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:02,194 INFO L85 PathProgramCache]: Analyzing trace with hash 551888671, now seen corresponding path program 1 times [2023-12-15 18:04:02,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:02,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368530120] [2023-12-15 18:04:02,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:02,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:02,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 18:04:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 18:04:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:02,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 18:04:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:02,236 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-15 18:04:02,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:02,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368530120] [2023-12-15 18:04:02,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368530120] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:02,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:04:02,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 18:04:02,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735084851] [2023-12-15 18:04:02,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:02,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 18:04:02,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:02,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 18:04:02,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 18:04:02,238 INFO L87 Difference]: Start difference. First operand 973 states and 1377 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-15 18:04:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:02,449 INFO L93 Difference]: Finished difference Result 1489 states and 2094 transitions. [2023-12-15 18:04:02,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 18:04:02,449 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-15 18:04:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:02,455 INFO L225 Difference]: With dead ends: 1489 [2023-12-15 18:04:02,455 INFO L226 Difference]: Without dead ends: 1173 [2023-12-15 18:04:02,457 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-15 18:04:02,457 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 123 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:02,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 501 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 18:04:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2023-12-15 18:04:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1139. [2023-12-15 18:04:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 933 states have (on average 1.4019292604501608) internal successors, (1308), 952 states have internal predecessors, (1308), 124 states have call successors, (124), 72 states have call predecessors, (124), 80 states have return successors, (159), 118 states have call predecessors, (159), 120 states have call successors, (159) [2023-12-15 18:04:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1591 transitions. [2023-12-15 18:04:02,539 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1591 transitions. Word has length 54 [2023-12-15 18:04:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:02,540 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 1591 transitions. [2023-12-15 18:04:02,540 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-15 18:04:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1591 transitions. [2023-12-15 18:04:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-15 18:04:02,543 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:02,543 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-15 18:04:02,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 18:04:02,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:02,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1856387684, now seen corresponding path program 1 times [2023-12-15 18:04:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273744665] [2023-12-15 18:04:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 18:04:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:02,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 18:04:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:02,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 18:04:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:02,605 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-15 18:04:02,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273744665] [2023-12-15 18:04:02,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273744665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:02,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:04:02,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 18:04:02,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4715343] [2023-12-15 18:04:02,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:02,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 18:04:02,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:02,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 18:04:02,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 18:04:02,607 INFO L87 Difference]: Start difference. First operand 1139 states and 1591 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-15 18:04:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:02,804 INFO L93 Difference]: Finished difference Result 1718 states and 2370 transitions. [2023-12-15 18:04:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 18:04:02,804 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-15 18:04:02,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:02,811 INFO L225 Difference]: With dead ends: 1718 [2023-12-15 18:04:02,811 INFO L226 Difference]: Without dead ends: 1316 [2023-12-15 18:04:02,814 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-15 18:04:02,815 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 270 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:02,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 353 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 18:04:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2023-12-15 18:04:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1267. [2023-12-15 18:04:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1045 states have (on average 1.3808612440191388) internal successors, (1443), 1066 states have internal predecessors, (1443), 132 states have call successors, (132), 78 states have call predecessors, (132), 88 states have return successors, (173), 126 states have call predecessors, (173), 128 states have call successors, (173) [2023-12-15 18:04:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1748 transitions. [2023-12-15 18:04:02,890 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1748 transitions. Word has length 59 [2023-12-15 18:04:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:02,891 INFO L495 AbstractCegarLoop]: Abstraction has 1267 states and 1748 transitions. [2023-12-15 18:04:02,891 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-15 18:04:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1748 transitions. [2023-12-15 18:04:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-15 18:04:02,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:02,894 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-15 18:04:02,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 18:04:02,894 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:02,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:02,895 INFO L85 PathProgramCache]: Analyzing trace with hash 424839686, now seen corresponding path program 1 times [2023-12-15 18:04:02,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:02,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603101416] [2023-12-15 18:04:02,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:02,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:02,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 18:04:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:02,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 18:04:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-15 18:04:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:02,989 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-15 18:04:02,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:02,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603101416] [2023-12-15 18:04:02,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603101416] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:02,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727476446] [2023-12-15 18:04:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:02,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:02,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:02,996 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-15 18:04:03,007 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-15 18:04:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:03,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 18:04:03,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:03,175 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-15 18:04:03,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 18:04:03,238 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-15 18:04:03,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727476446] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:03,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-15 18:04:03,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2023-12-15 18:04:03,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917272691] [2023-12-15 18:04:03,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:03,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 18:04:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 18:04:03,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 18:04:03,240 INFO L87 Difference]: Start difference. First operand 1267 states and 1748 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-15 18:04:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:03,431 INFO L93 Difference]: Finished difference Result 1317 states and 1810 transitions. [2023-12-15 18:04:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 18:04:03,432 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-15 18:04:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:03,437 INFO L225 Difference]: With dead ends: 1317 [2023-12-15 18:04:03,437 INFO L226 Difference]: Without dead ends: 1314 [2023-12-15 18:04:03,438 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-15 18:04:03,439 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 386 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:03,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 287 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 18:04:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2023-12-15 18:04:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1266. [2023-12-15 18:04:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1045 states have (on average 1.3789473684210527) internal successors, (1441), 1065 states have internal predecessors, (1441), 131 states have call successors, (131), 78 states have call predecessors, (131), 88 states have return successors, (173), 126 states have call predecessors, (173), 128 states have call successors, (173) [2023-12-15 18:04:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1745 transitions. [2023-12-15 18:04:03,528 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1745 transitions. Word has length 60 [2023-12-15 18:04:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:03,528 INFO L495 AbstractCegarLoop]: Abstraction has 1266 states and 1745 transitions. [2023-12-15 18:04:03,528 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-15 18:04:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1745 transitions. [2023-12-15 18:04:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-15 18:04:03,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:03,530 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-15 18:04:03,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 18:04:03,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-15 18:04:03,736 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:03,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:03,737 INFO L85 PathProgramCache]: Analyzing trace with hash 284512671, now seen corresponding path program 1 times [2023-12-15 18:04:03,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:03,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523711699] [2023-12-15 18:04:03,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:03,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:03,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 18:04:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:03,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 18:04:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:03,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-15 18:04:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:03,800 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-15 18:04:03,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:03,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523711699] [2023-12-15 18:04:03,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523711699] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:03,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973832525] [2023-12-15 18:04:03,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:03,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:03,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:03,802 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-15 18:04:03,833 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-15 18:04:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:03,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-15 18:04:03,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:04,078 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-15 18:04:04,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 18:04:04,152 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-15 18:04:04,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973832525] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 18:04:04,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 18:04:04,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2023-12-15 18:04:04,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370271518] [2023-12-15 18:04:04,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 18:04:04,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 18:04:04,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:04,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 18:04:04,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 18:04:04,154 INFO L87 Difference]: Start difference. First operand 1266 states and 1745 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-15 18:04:04,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:04,916 INFO L93 Difference]: Finished difference Result 2611 states and 3573 transitions. [2023-12-15 18:04:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-15 18:04:04,917 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-15 18:04:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:04,928 INFO L225 Difference]: With dead ends: 2611 [2023-12-15 18:04:04,928 INFO L226 Difference]: Without dead ends: 2129 [2023-12-15 18:04:04,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2023-12-15 18:04:04,932 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 495 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:04,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1397 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 18:04:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2023-12-15 18:04:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1602. [2023-12-15 18:04:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1342 states have (on average 1.3576751117734724) internal successors, (1822), 1370 states have internal predecessors, (1822), 151 states have call successors, (151), 92 states have call predecessors, (151), 107 states have return successors, (207), 143 states have call predecessors, (207), 148 states have call successors, (207) [2023-12-15 18:04:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2180 transitions. [2023-12-15 18:04:05,102 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2180 transitions. Word has length 61 [2023-12-15 18:04:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:05,102 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2180 transitions. [2023-12-15 18:04:05,103 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-15 18:04:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2180 transitions. [2023-12-15 18:04:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-15 18:04:05,106 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:05,107 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-15 18:04:05,115 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-15 18:04:05,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-15 18:04:05,313 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:05,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:05,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1432619718, now seen corresponding path program 1 times [2023-12-15 18:04:05,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:05,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743854514] [2023-12-15 18:04:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:05,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 18:04:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:05,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 18:04:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:05,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 18:04:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:05,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 18:04:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-15 18:04:05,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:05,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743854514] [2023-12-15 18:04:05,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743854514] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:05,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985232521] [2023-12-15 18:04:05,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:05,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:05,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:05,402 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-15 18:04:05,433 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-15 18:04:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:05,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 18:04:05,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-15 18:04:05,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:04:05,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985232521] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:05,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:04:05,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-15 18:04:05,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910296533] [2023-12-15 18:04:05,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:05,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:04:05,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:05,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:04:05,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 18:04:05,536 INFO L87 Difference]: Start difference. First operand 1602 states and 2180 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-15 18:04:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:05,663 INFO L93 Difference]: Finished difference Result 2234 states and 3027 transitions. [2023-12-15 18:04:05,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:04:05,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2023-12-15 18:04:05,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:05,670 INFO L225 Difference]: With dead ends: 2234 [2023-12-15 18:04:05,670 INFO L226 Difference]: Without dead ends: 1494 [2023-12-15 18:04:05,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 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-15 18:04:05,673 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 195 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:05,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 304 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:04:05,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2023-12-15 18:04:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1479. [2023-12-15 18:04:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1235 states have (on average 1.3587044534412955) internal successors, (1678), 1262 states have internal predecessors, (1678), 143 states have call successors, (143), 86 states have call predecessors, (143), 99 states have return successors, (193), 134 states have call predecessors, (193), 140 states have call successors, (193) [2023-12-15 18:04:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2014 transitions. [2023-12-15 18:04:05,774 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2014 transitions. Word has length 78 [2023-12-15 18:04:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:05,775 INFO L495 AbstractCegarLoop]: Abstraction has 1479 states and 2014 transitions. [2023-12-15 18:04:05,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-15 18:04:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2014 transitions. [2023-12-15 18:04:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-15 18:04:05,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:05,779 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, 1] [2023-12-15 18:04:05,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 18:04:05,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:05,985 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:05,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:05,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1923430360, now seen corresponding path program 1 times [2023-12-15 18:04:05,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:05,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599887289] [2023-12-15 18:04:05,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:05,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-15 18:04:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 18:04:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 18:04:06,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:06,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599887289] [2023-12-15 18:04:06,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599887289] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:06,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98635535] [2023-12-15 18:04:06,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:06,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:06,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:06,074 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-15 18:04:06,096 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-15 18:04:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 18:04:06,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:06,188 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-15 18:04:06,189 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:04:06,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98635535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:06,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:04:06,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-15 18:04:06,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014350239] [2023-12-15 18:04:06,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:06,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:04:06,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:06,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:04:06,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 18:04:06,191 INFO L87 Difference]: Start difference. First operand 1479 states and 2014 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 18:04:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:06,343 INFO L93 Difference]: Finished difference Result 1968 states and 2734 transitions. [2023-12-15 18:04:06,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:04:06,344 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2023-12-15 18:04:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:06,351 INFO L225 Difference]: With dead ends: 1968 [2023-12-15 18:04:06,352 INFO L226 Difference]: Without dead ends: 1702 [2023-12-15 18:04:06,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 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-15 18:04:06,353 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 98 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:06,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 513 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:04:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2023-12-15 18:04:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2023-12-15 18:04:06,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1410 states have (on average 1.3673758865248227) internal successors, (1928), 1439 states have internal predecessors, (1928), 171 states have call successors, (171), 104 states have call predecessors, (171), 119 states have return successors, (235), 162 states have call predecessors, (235), 168 states have call successors, (235) [2023-12-15 18:04:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2334 transitions. [2023-12-15 18:04:06,468 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2334 transitions. Word has length 84 [2023-12-15 18:04:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:06,469 INFO L495 AbstractCegarLoop]: Abstraction has 1702 states and 2334 transitions. [2023-12-15 18:04:06,469 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 18:04:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2334 transitions. [2023-12-15 18:04:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-15 18:04:06,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:06,473 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-15 18:04:06,487 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-15 18:04:06,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:06,679 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:06,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:06,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1515349538, now seen corresponding path program 1 times [2023-12-15 18:04:06,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:06,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060222907] [2023-12-15 18:04:06,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:06,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 18:04:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 18:04:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-15 18:04:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 18:04:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 18:04:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-15 18:04:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:06,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060222907] [2023-12-15 18:04:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060222907] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:06,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933677857] [2023-12-15 18:04:06,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:06,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:06,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:06,771 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-15 18:04:06,793 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-15 18:04:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:06,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 18:04:06,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:06,883 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-15 18:04:06,883 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:04:06,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933677857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:06,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:04:06,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-15 18:04:06,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818926876] [2023-12-15 18:04:06,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:06,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:04:06,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:06,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:04:06,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 18:04:06,885 INFO L87 Difference]: Start difference. First operand 1702 states and 2334 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-15 18:04:07,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:07,030 INFO L93 Difference]: Finished difference Result 2036 states and 2757 transitions. [2023-12-15 18:04:07,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:04:07,031 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-15 18:04:07,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:07,037 INFO L225 Difference]: With dead ends: 2036 [2023-12-15 18:04:07,037 INFO L226 Difference]: Without dead ends: 875 [2023-12-15 18:04:07,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 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-15 18:04:07,041 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 56 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 441 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-15 18:04:07,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 441 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:04:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2023-12-15 18:04:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2023-12-15 18:04:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 686 states have (on average 1.4431486880466473) internal successors, (990), 699 states have internal predecessors, (990), 114 states have call successors, (114), 67 states have call predecessors, (114), 74 states have return successors, (143), 112 states have call predecessors, (143), 112 states have call successors, (143) [2023-12-15 18:04:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1247 transitions. [2023-12-15 18:04:07,101 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1247 transitions. Word has length 92 [2023-12-15 18:04:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:07,101 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1247 transitions. [2023-12-15 18:04:07,101 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-15 18:04:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1247 transitions. [2023-12-15 18:04:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-15 18:04:07,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:07,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 18:04:07,112 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-15 18:04:07,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-15 18:04:07,310 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:07,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1803339243, now seen corresponding path program 1 times [2023-12-15 18:04:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:07,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81192120] [2023-12-15 18:04:07,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:07,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:07,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:07,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:07,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-15 18:04:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:07,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:07,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-15 18:04:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:07,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:07,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 18:04:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 18:04:07,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:07,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81192120] [2023-12-15 18:04:07,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81192120] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:07,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107093715] [2023-12-15 18:04:07,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:07,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:07,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:07,412 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-15 18:04:07,414 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-15 18:04:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:07,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 18:04:07,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 18:04:07,611 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:04:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107093715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:07,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:04:07,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-15 18:04:07,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448112795] [2023-12-15 18:04:07,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:07,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:04:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:07,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:04:07,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 18:04:07,613 INFO L87 Difference]: Start difference. First operand 875 states and 1247 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 18:04:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:07,728 INFO L93 Difference]: Finished difference Result 2547 states and 3654 transitions. [2023-12-15 18:04:07,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:04:07,729 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2023-12-15 18:04:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:07,736 INFO L225 Difference]: With dead ends: 2547 [2023-12-15 18:04:07,736 INFO L226 Difference]: Without dead ends: 1681 [2023-12-15 18:04:07,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 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-15 18:04:07,739 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 78 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 271 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-15 18:04:07,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 271 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:04:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2023-12-15 18:04:07,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1666. [2023-12-15 18:04:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1316 states have (on average 1.4361702127659575) internal successors, (1890), 1340 states have internal predecessors, (1890), 206 states have call successors, (206), 128 states have call predecessors, (206), 143 states have return successors, (257), 201 states have call predecessors, (257), 204 states have call successors, (257) [2023-12-15 18:04:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2353 transitions. [2023-12-15 18:04:07,876 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2353 transitions. Word has length 107 [2023-12-15 18:04:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:07,877 INFO L495 AbstractCegarLoop]: Abstraction has 1666 states and 2353 transitions. [2023-12-15 18:04:07,877 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 18:04:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2353 transitions. [2023-12-15 18:04:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-15 18:04:07,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:07,882 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 18:04:07,891 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-15 18:04:08,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-15 18:04:08,089 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:08,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:08,090 INFO L85 PathProgramCache]: Analyzing trace with hash 886730534, now seen corresponding path program 1 times [2023-12-15 18:04:08,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:08,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767370155] [2023-12-15 18:04:08,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:08,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 18:04:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 18:04:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 18:04:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 18:04:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-15 18:04:08,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:08,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767370155] [2023-12-15 18:04:08,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767370155] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:08,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215807971] [2023-12-15 18:04:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:08,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:08,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:08,187 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-15 18:04:08,208 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-15 18:04:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 18:04:08,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-15 18:04:08,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:04:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215807971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:08,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:04:08,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-15 18:04:08,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367380314] [2023-12-15 18:04:08,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:08,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:04:08,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:08,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:04:08,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 18:04:08,317 INFO L87 Difference]: Start difference. First operand 1666 states and 2353 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-15 18:04:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:08,443 INFO L93 Difference]: Finished difference Result 3498 states and 4950 transitions. [2023-12-15 18:04:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:04:08,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 122 [2023-12-15 18:04:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:08,451 INFO L225 Difference]: With dead ends: 3498 [2023-12-15 18:04:08,451 INFO L226 Difference]: Without dead ends: 1842 [2023-12-15 18:04:08,455 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-15 18:04:08,455 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 96 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:08,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 255 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:04:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2023-12-15 18:04:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1824. [2023-12-15 18:04:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1450 states have (on average 1.3958620689655172) internal successors, (2024), 1474 states have internal predecessors, (2024), 212 states have call successors, (212), 146 states have call predecessors, (212), 161 states have return successors, (281), 207 states have call predecessors, (281), 210 states have call successors, (281) [2023-12-15 18:04:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2517 transitions. [2023-12-15 18:04:08,630 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2517 transitions. Word has length 122 [2023-12-15 18:04:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:08,630 INFO L495 AbstractCegarLoop]: Abstraction has 1824 states and 2517 transitions. [2023-12-15 18:04:08,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-15 18:04:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2517 transitions. [2023-12-15 18:04:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 18:04:08,634 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:08,634 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 18:04:08,647 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-15 18:04:08,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:08,842 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:08,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1241209588, now seen corresponding path program 1 times [2023-12-15 18:04:08,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:08,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464628121] [2023-12-15 18:04:08,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:08,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-15 18:04:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 18:04:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 18:04:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 18:04:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-15 18:04:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464628121] [2023-12-15 18:04:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464628121] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720670343] [2023-12-15 18:04:08,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:08,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:08,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:08,951 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-15 18:04:08,968 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-15 18:04:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 18:04:09,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-15 18:04:09,067 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:04:09,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720670343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:09,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:04:09,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-15 18:04:09,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161445131] [2023-12-15 18:04:09,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:09,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:04:09,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:09,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:04:09,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 18:04:09,070 INFO L87 Difference]: Start difference. First operand 1824 states and 2517 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 18:04:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:09,308 INFO L93 Difference]: Finished difference Result 5314 states and 7402 transitions. [2023-12-15 18:04:09,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:04:09,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-12-15 18:04:09,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:09,323 INFO L225 Difference]: With dead ends: 5314 [2023-12-15 18:04:09,323 INFO L226 Difference]: Without dead ends: 3500 [2023-12-15 18:04:09,327 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-15 18:04:09,328 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 120 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 366 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-15 18:04:09,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 366 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:04:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2023-12-15 18:04:09,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 3484. [2023-12-15 18:04:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 2773 states have (on average 1.3836999639379732) internal successors, (3837), 2820 states have internal predecessors, (3837), 399 states have call successors, (399), 280 states have call predecessors, (399), 311 states have return successors, (606), 391 states have call predecessors, (606), 397 states have call successors, (606) [2023-12-15 18:04:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 4842 transitions. [2023-12-15 18:04:09,582 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 4842 transitions. Word has length 123 [2023-12-15 18:04:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:09,582 INFO L495 AbstractCegarLoop]: Abstraction has 3484 states and 4842 transitions. [2023-12-15 18:04:09,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 18:04:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 4842 transitions. [2023-12-15 18:04:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-15 18:04:09,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:09,590 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 18:04:09,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-15 18:04:09,797 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,SelfDestructingSolverStorable17 [2023-12-15 18:04:09,797 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:09,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1773469757, now seen corresponding path program 1 times [2023-12-15 18:04:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:09,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219041196] [2023-12-15 18:04:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 18:04:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 18:04:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 18:04:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 18:04:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-15 18:04:09,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:09,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219041196] [2023-12-15 18:04:09,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219041196] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:09,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677966879] [2023-12-15 18:04:09,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:09,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:09,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:09,939 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-15 18:04:09,965 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-15 18:04:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 18:04:10,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 18:04:10,086 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:04:10,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677966879] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:10,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:04:10,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-15 18:04:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208321078] [2023-12-15 18:04:10,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:10,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:04:10,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:10,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:04:10,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 18:04:10,089 INFO L87 Difference]: Start difference. First operand 3484 states and 4842 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 18:04:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:10,337 INFO L93 Difference]: Finished difference Result 5297 states and 7527 transitions. [2023-12-15 18:04:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:04:10,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 124 [2023-12-15 18:04:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:10,367 INFO L225 Difference]: With dead ends: 5297 [2023-12-15 18:04:10,368 INFO L226 Difference]: Without dead ends: 3499 [2023-12-15 18:04:10,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 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-15 18:04:10,376 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 106 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 327 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-15 18:04:10,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 327 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:04:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3499 states. [2023-12-15 18:04:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3499 to 3484. [2023-12-15 18:04:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 2773 states have (on average 1.3635052289938694) internal successors, (3781), 2820 states have internal predecessors, (3781), 399 states have call successors, (399), 280 states have call predecessors, (399), 311 states have return successors, (606), 391 states have call predecessors, (606), 397 states have call successors, (606) [2023-12-15 18:04:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 4786 transitions. [2023-12-15 18:04:10,649 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 4786 transitions. Word has length 124 [2023-12-15 18:04:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:10,649 INFO L495 AbstractCegarLoop]: Abstraction has 3484 states and 4786 transitions. [2023-12-15 18:04:10,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 18:04:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 4786 transitions. [2023-12-15 18:04:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-15 18:04:10,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:10,655 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 18:04:10,662 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-15 18:04:10,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:10,862 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:10,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:10,862 INFO L85 PathProgramCache]: Analyzing trace with hash 881357149, now seen corresponding path program 1 times [2023-12-15 18:04:10,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:10,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106847742] [2023-12-15 18:04:10,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:10,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 18:04:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 18:04:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 18:04:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 18:04:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-15 18:04:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106847742] [2023-12-15 18:04:10,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106847742] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755545948] [2023-12-15 18:04:10,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:10,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:10,964 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-15 18:04:10,997 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-15 18:04:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 18:04:11,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-15 18:04:11,105 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:04:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755545948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:11,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:04:11,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-15 18:04:11,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081026151] [2023-12-15 18:04:11,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:11,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 18:04:11,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:11,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 18:04:11,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 18:04:11,106 INFO L87 Difference]: Start difference. First operand 3484 states and 4786 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 18:04:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:11,398 INFO L93 Difference]: Finished difference Result 6662 states and 9272 transitions. [2023-12-15 18:04:11,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 18:04:11,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 124 [2023-12-15 18:04:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:11,412 INFO L225 Difference]: With dead ends: 6662 [2023-12-15 18:04:11,412 INFO L226 Difference]: Without dead ends: 3430 [2023-12-15 18:04:11,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 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-15 18:04:11,423 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 154 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-15 18:04:11,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 154 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:04:11,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2023-12-15 18:04:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3186. [2023-12-15 18:04:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 2534 states have (on average 1.303472770323599) internal successors, (3303), 2573 states have internal predecessors, (3303), 369 states have call successors, (369), 259 states have call predecessors, (369), 282 states have return successors, (486), 357 states have call predecessors, (486), 367 states have call successors, (486) [2023-12-15 18:04:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 4158 transitions. [2023-12-15 18:04:11,662 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 4158 transitions. Word has length 124 [2023-12-15 18:04:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:11,662 INFO L495 AbstractCegarLoop]: Abstraction has 3186 states and 4158 transitions. [2023-12-15 18:04:11,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 18:04:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 4158 transitions. [2023-12-15 18:04:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 18:04:11,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:11,668 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 18:04:11,674 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-15 18:04:11,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:11,874 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:11,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:11,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1721015244, now seen corresponding path program 1 times [2023-12-15 18:04:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:11,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979241019] [2023-12-15 18:04:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 18:04:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 18:04:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 18:04:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 18:04:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-15 18:04:11,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979241019] [2023-12-15 18:04:11,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979241019] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574500939] [2023-12-15 18:04:11,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:11,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:11,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:11,976 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-15 18:04:11,996 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-15 18:04:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 18:04:12,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:12,166 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-15 18:04:12,167 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:04:12,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574500939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:12,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:04:12,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-15 18:04:12,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413271411] [2023-12-15 18:04:12,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:12,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 18:04:12,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:12,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 18:04:12,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-15 18:04:12,169 INFO L87 Difference]: Start difference. First operand 3186 states and 4158 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 18:04:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:12,448 INFO L93 Difference]: Finished difference Result 5202 states and 6873 transitions. [2023-12-15 18:04:12,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 18:04:12,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-12-15 18:04:12,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:12,463 INFO L225 Difference]: With dead ends: 5202 [2023-12-15 18:04:12,464 INFO L226 Difference]: Without dead ends: 2928 [2023-12-15 18:04:12,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 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-15 18:04:12,471 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 141 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:12,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 214 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 18:04:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2023-12-15 18:04:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2116. [2023-12-15 18:04:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 1688 states have (on average 1.2683649289099526) internal successors, (2141), 1711 states have internal predecessors, (2141), 247 states have call successors, (247), 169 states have call predecessors, (247), 180 states have return successors, (315), 237 states have call predecessors, (315), 245 states have call successors, (315) [2023-12-15 18:04:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2703 transitions. [2023-12-15 18:04:12,646 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2703 transitions. Word has length 125 [2023-12-15 18:04:12,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:12,646 INFO L495 AbstractCegarLoop]: Abstraction has 2116 states and 2703 transitions. [2023-12-15 18:04:12,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 18:04:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2703 transitions. [2023-12-15 18:04:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 18:04:12,649 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:12,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 18:04:12,655 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-15 18:04:12,854 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,SelfDestructingSolverStorable20 [2023-12-15 18:04:12,855 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:12,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:12,855 INFO L85 PathProgramCache]: Analyzing trace with hash 954977138, now seen corresponding path program 1 times [2023-12-15 18:04:12,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:12,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687779235] [2023-12-15 18:04:12,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:12,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 18:04:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 18:04:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 18:04:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 18:04:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-15 18:04:12,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:12,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687779235] [2023-12-15 18:04:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687779235] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:12,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581692653] [2023-12-15 18:04:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:12,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:12,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:12,972 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-15 18:04:12,994 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-15 18:04:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 18:04:13,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:13,166 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-15 18:04:13,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:04:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581692653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:13,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:04:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-15 18:04:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884881088] [2023-12-15 18:04:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:13,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 18:04:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 18:04:13,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-15 18:04:13,168 INFO L87 Difference]: Start difference. First operand 2116 states and 2703 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 18:04:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:13,454 INFO L93 Difference]: Finished difference Result 4352 states and 5694 transitions. [2023-12-15 18:04:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 18:04:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-12-15 18:04:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:13,463 INFO L225 Difference]: With dead ends: 4352 [2023-12-15 18:04:13,463 INFO L226 Difference]: Without dead ends: 2246 [2023-12-15 18:04:13,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 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-15 18:04:13,469 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 171 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:13,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 208 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 18:04:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2023-12-15 18:04:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2198. [2023-12-15 18:04:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2198 states, 1764 states have (on average 1.2046485260770976) internal successors, (2125), 1787 states have internal predecessors, (2125), 247 states have call successors, (247), 175 states have call predecessors, (247), 186 states have return successors, (315), 237 states have call predecessors, (315), 245 states have call successors, (315) [2023-12-15 18:04:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 2687 transitions. [2023-12-15 18:04:13,633 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 2687 transitions. Word has length 125 [2023-12-15 18:04:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:13,634 INFO L495 AbstractCegarLoop]: Abstraction has 2198 states and 2687 transitions. [2023-12-15 18:04:13,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 18:04:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 2687 transitions. [2023-12-15 18:04:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 18:04:13,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:13,637 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 18:04:13,646 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-15 18:04:13,843 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,SelfDestructingSolverStorable21 [2023-12-15 18:04:13,844 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:13,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:13,844 INFO L85 PathProgramCache]: Analyzing trace with hash 71468148, now seen corresponding path program 1 times [2023-12-15 18:04:13,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:13,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689644400] [2023-12-15 18:04:13,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:13,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 18:04:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 18:04:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 18:04:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 18:04:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-15 18:04:13,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:13,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689644400] [2023-12-15 18:04:13,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689644400] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:13,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258718535] [2023-12-15 18:04:13,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:13,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:13,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:13,940 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 18:04:13,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-15 18:04:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 18:04:14,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-15 18:04:14,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:04:14,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258718535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:14,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:04:14,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-15 18:04:14,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018007891] [2023-12-15 18:04:14,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:14,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 18:04:14,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:14,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 18:04:14,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 18:04:14,054 INFO L87 Difference]: Start difference. First operand 2198 states and 2687 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 18:04:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:14,207 INFO L93 Difference]: Finished difference Result 4044 states and 5005 transitions. [2023-12-15 18:04:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 18:04:14,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-12-15 18:04:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:14,219 INFO L225 Difference]: With dead ends: 4044 [2023-12-15 18:04:14,219 INFO L226 Difference]: Without dead ends: 1858 [2023-12-15 18:04:14,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 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-15 18:04:14,225 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 11 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 371 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-15 18:04:14,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 371 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:04:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2023-12-15 18:04:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2023-12-15 18:04:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1490 states have (on average 1.165771812080537) internal successors, (1737), 1509 states have internal predecessors, (1737), 209 states have call successors, (209), 147 states have call predecessors, (209), 158 states have return successors, (252), 203 states have call predecessors, (252), 207 states have call successors, (252) [2023-12-15 18:04:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2198 transitions. [2023-12-15 18:04:14,354 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2198 transitions. Word has length 125 [2023-12-15 18:04:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:14,355 INFO L495 AbstractCegarLoop]: Abstraction has 1858 states and 2198 transitions. [2023-12-15 18:04:14,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 18:04:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2198 transitions. [2023-12-15 18:04:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 18:04:14,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:14,357 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, 1] [2023-12-15 18:04:14,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-15 18:04:14,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-15 18:04:14,565 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:14,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1904662836, now seen corresponding path program 1 times [2023-12-15 18:04:14,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:14,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686542461] [2023-12-15 18:04:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 18:04:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 18:04:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 18:04:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 18:04:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,649 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-15 18:04:14,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686542461] [2023-12-15 18:04:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686542461] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 18:04:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947820785] [2023-12-15 18:04:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:14,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:14,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 18:04:14,651 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 18:04:14,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-15 18:04:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:14,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 18:04:14,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 18:04:14,754 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-15 18:04:14,754 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 18:04:14,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947820785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:14,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 18:04:14,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-15 18:04:14,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154016972] [2023-12-15 18:04:14,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:14,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 18:04:14,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:14,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 18:04:14,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 18:04:14,756 INFO L87 Difference]: Start difference. First operand 1858 states and 2198 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 18:04:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:14,876 INFO L93 Difference]: Finished difference Result 2949 states and 3508 transitions. [2023-12-15 18:04:14,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 18:04:14,877 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-12-15 18:04:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:14,879 INFO L225 Difference]: With dead ends: 2949 [2023-12-15 18:04:14,879 INFO L226 Difference]: Without dead ends: 732 [2023-12-15 18:04:14,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 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-15 18:04:14,884 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 2 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 373 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-15 18:04:14,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 373 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 18:04:14,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2023-12-15 18:04:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2023-12-15 18:04:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 585 states have (on average 1.1316239316239316) internal successors, (662), 593 states have internal predecessors, (662), 85 states have call successors, (85), 58 states have call predecessors, (85), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2023-12-15 18:04:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 834 transitions. [2023-12-15 18:04:14,977 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 834 transitions. Word has length 125 [2023-12-15 18:04:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:14,977 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 834 transitions. [2023-12-15 18:04:14,978 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 18:04:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 834 transitions. [2023-12-15 18:04:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 18:04:14,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:14,979 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, 1] [2023-12-15 18:04:14,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-15 18:04:15,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 18:04:15,187 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:15,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:15,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1493277068, now seen corresponding path program 1 times [2023-12-15 18:04:15,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:15,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915146253] [2023-12-15 18:04:15,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:15,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 18:04:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 18:04:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 18:04:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 18:04:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,311 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-15 18:04:15,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:15,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915146253] [2023-12-15 18:04:15,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915146253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:15,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:04:15,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 18:04:15,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439901938] [2023-12-15 18:04:15,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:15,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 18:04:15,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:15,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 18:04:15,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 18:04:15,313 INFO L87 Difference]: Start difference. First operand 732 states and 834 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-15 18:04:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:15,735 INFO L93 Difference]: Finished difference Result 754 states and 855 transitions. [2023-12-15 18:04:15,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 18:04:15,736 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), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 125 [2023-12-15 18:04:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:15,738 INFO L225 Difference]: With dead ends: 754 [2023-12-15 18:04:15,738 INFO L226 Difference]: Without dead ends: 751 [2023-12-15 18:04:15,739 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-15 18:04:15,740 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 337 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:15,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 349 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 18:04:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2023-12-15 18:04:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 731. [2023-12-15 18:04:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 585 states have (on average 1.1282051282051282) internal successors, (660), 592 states have internal predecessors, (660), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2023-12-15 18:04:15,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 831 transitions. [2023-12-15 18:04:15,813 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 831 transitions. Word has length 125 [2023-12-15 18:04:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:15,813 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 831 transitions. [2023-12-15 18:04:15,813 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), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-15 18:04:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 831 transitions. [2023-12-15 18:04:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-15 18:04:15,815 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:15,815 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, 1, 1, 1, 1, 1] [2023-12-15 18:04:15,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-15 18:04:15,816 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:15,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:15,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1655734244, now seen corresponding path program 1 times [2023-12-15 18:04:15,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:15,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599555913] [2023-12-15 18:04:15,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 18:04:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 18:04:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 18:04:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 18:04:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 18:04:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 18:04:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 18:04:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 18:04:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 18:04:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 18:04:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 18:04:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-15 18:04:15,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 18:04:15,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599555913] [2023-12-15 18:04:15,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599555913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 18:04:15,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 18:04:15,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 18:04:15,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284151567] [2023-12-15 18:04:15,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 18:04:15,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 18:04:15,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 18:04:15,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 18:04:15,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 18:04:15,877 INFO L87 Difference]: Start difference. First operand 731 states and 831 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 18:04:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 18:04:16,109 INFO L93 Difference]: Finished difference Result 1126 states and 1283 transitions. [2023-12-15 18:04:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 18:04:16,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 129 [2023-12-15 18:04:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 18:04:16,111 INFO L225 Difference]: With dead ends: 1126 [2023-12-15 18:04:16,111 INFO L226 Difference]: Without dead ends: 761 [2023-12-15 18:04:16,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 18:04:16,113 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 93 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 18:04:16,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 244 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 18:04:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2023-12-15 18:04:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 733. [2023-12-15 18:04:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 587 states have (on average 1.1277683134582623) internal successors, (662), 594 states have internal predecessors, (662), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2023-12-15 18:04:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 833 transitions. [2023-12-15 18:04:16,176 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 833 transitions. Word has length 129 [2023-12-15 18:04:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 18:04:16,176 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 833 transitions. [2023-12-15 18:04:16,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 18:04:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 833 transitions. [2023-12-15 18:04:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-15 18:04:16,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 18:04:16,179 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, 1, 1, 1, 1, 1, 1] [2023-12-15 18:04:16,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-15 18:04:16,179 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 18:04:16,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 18:04:16,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1441011305, now seen corresponding path program 1 times [2023-12-15 18:04:16,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 18:04:16,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995865239] [2023-12-15 18:04:16,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 18:04:16,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 18:04:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 18:04:16,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 18:04:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 18:04:16,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 18:04:16,253 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 18:04:16,254 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-15 18:04:16,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-15 18:04:16,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-15 18:04:16,259 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 18:04:16,263 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 18:04:16,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 06:04:16 BoogieIcfgContainer [2023-12-15 18:04:16,376 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 18:04:16,376 INFO L158 Benchmark]: Toolchain (without parser) took 20771.95ms. Allocated memory was 264.2MB in the beginning and 788.5MB in the end (delta: 524.3MB). Free memory was 211.1MB in the beginning and 366.5MB in the end (delta: -155.4MB). Peak memory consumption was 369.9MB. Max. memory is 8.0GB. [2023-12-15 18:04:16,376 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 181.4MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 18:04:16,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.38ms. Allocated memory is still 264.2MB. Free memory was 211.1MB in the beginning and 194.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 18:04:16,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.82ms. Allocated memory is still 264.2MB. Free memory was 194.3MB in the beginning and 191.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 18:04:16,377 INFO L158 Benchmark]: Boogie Preprocessor took 64.49ms. Allocated memory is still 264.2MB. Free memory was 191.7MB in the beginning and 188.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 18:04:16,377 INFO L158 Benchmark]: RCFGBuilder took 584.47ms. Allocated memory is still 264.2MB. Free memory was 188.5MB in the beginning and 158.1MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-12-15 18:04:16,377 INFO L158 Benchmark]: TraceAbstraction took 19654.60ms. Allocated memory was 264.2MB in the beginning and 788.5MB in the end (delta: 524.3MB). Free memory was 157.1MB in the beginning and 366.5MB in the end (delta: -209.4MB). Peak memory consumption was 315.4MB. Max. memory is 8.0GB. [2023-12-15 18:04:16,378 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.34ms. Allocated memory is still 181.4MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 419.38ms. Allocated memory is still 264.2MB. Free memory was 211.1MB in the beginning and 194.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.82ms. Allocated memory is still 264.2MB. Free memory was 194.3MB in the beginning and 191.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.49ms. Allocated memory is still 264.2MB. Free memory was 191.7MB in the beginning and 188.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 584.47ms. Allocated memory is still 264.2MB. Free memory was 188.5MB in the beginning and 158.1MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 19654.60ms. Allocated memory was 264.2MB in the beginning and 788.5MB in the end (delta: 524.3MB). Free memory was 157.1MB in the beginning and 366.5MB in the end (delta: -209.4MB). Peak memory consumption was 315.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int m_st ; [L397] int t1_st ; [L398] int m_i ; [L399] int t1_i ; [L400] int M_E = 2; [L401] int T1_E = 2; [L402] int E_M = 2; [L403] int E_1 = 2; [L407] int token ; [L409] int local ; [L868] COND FALSE !(__VERIFIER_nondet_int()) [L871] CALL main2() [L855] int __retres1 ; [L859] CALL init_model2() [L770] m_i = 1 [L771] t1_i = 1 [L859] RET init_model2() [L860] CALL start_simulation2() [L796] int kernel_st ; [L797] int tmp ; [L798] int tmp___0 ; [L802] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L803] FCALL update_channels2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL init_threads2() [L552] COND TRUE m_i == 1 [L553] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L557] COND TRUE t1_i == 1 [L558] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] RET init_threads2() [L805] CALL fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L646] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L651] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L656] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L806] CALL activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L506] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L516] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L518] return (__retres1); [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L525] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L535] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L537] return (__retres1); [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L806] RET activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] CALL reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L669] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L674] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L679] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L684] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] RET reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L810] COND TRUE 1 [L813] kernel_st = 1 [L814] CALL eval2() [L588] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L592] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L567] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L583] return (__retres1); [L595] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L602-L613] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE, EXPR \read(tmp_ndt_2) [L621] EXPR t1_st = 1 [L622] CALL, EXPR transmit1() [L470] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L481] COND TRUE 1 [L483] t1_pc = 1 [L484] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] RET, EXPR transmit1() [L616-L627] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L592] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L567] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L583] return (__retres1); [L595] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE, EXPR \read(tmp_ndt_1) [L607] EXPR m_st = 1 [L608] CALL, EXPR master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L425] COND TRUE 1 [L428] token = __VERIFIER_nondet_int() [L429] local = token [L430] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L431] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L723] CALL activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L506] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L516] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L518] return (__retres1); [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L525] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L526] COND TRUE E_1 == 1 [L527] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L537] return (__retres1); [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND TRUE \read(tmp___0) [L710] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L723] RET activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, token=0] [L431] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L432] E_1 = 2 [L433] m_pc = 1 [L434] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L608] RET, EXPR master() [L602-L613] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp=1, token=0] [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE, EXPR \read(tmp_ndt_2) [L621] EXPR t1_st = 1 [L622] CALL, EXPR transmit1() [L470] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L473] COND TRUE t1_pc == 1 [L489] token += 1 [L490] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L723] CALL activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L506] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L507] COND TRUE E_M == 1 [L508] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L518] return (__retres1); [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND TRUE \read(tmp) [L702] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L525] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L526] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L535] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L537] return (__retres1); [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L723] RET activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L492] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L481] COND TRUE 1 [L483] t1_pc = 1 [L484] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L622] RET, EXPR transmit1() [L616-L627] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L592] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L595] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L567] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L583] return (__retres1); [L595] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L417] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L439] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L444] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L445] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L450] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L451] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L452] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L453] CALL error2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L390] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 166 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5839 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5652 mSDsluCounter, 11273 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6629 mSDsCounter, 751 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6254 IncrementalHoareTripleChecker+Invalid, 7005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 751 mSolverCounterUnsat, 4644 mSDtfsCounter, 6254 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2160 GetRequests, 1980 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3484occurred in iteration=18, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 2404 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3821 NumberOfCodeBlocks, 3821 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3770 ConstructedInterpolants, 0 QuantifiedInterpolants, 6050 SizeOfPredicates, 4 NumberOfNonLiveVariables, 5359 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 42 InterpolantComputations, 25 PerfectInterpolantSequences, 1551/1767 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-15 18:04:16,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...