/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/Problem05_label49+token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 11:42:44,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 11:42:44,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 11:42:44,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 11:42:44,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 11:42:44,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 11:42:44,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 11:42:44,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 11:42:44,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 11:42:44,285 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 11:42:44,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 11:42:44,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 11:42:44,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 11:42:44,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 11:42:44,286 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 11:42:44,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 11:42:44,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 11:42:44,287 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 11:42:44,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 11:42:44,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 11:42:44,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 11:42:44,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 11:42:44,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 11:42:44,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 11:42:44,289 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 11:42:44,289 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 11:42:44,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 11:42:44,290 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 11:42:44,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 11:42:44,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 11:42:44,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 11:42:44,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 11:42:44,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 11:42:44,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 11:42:44,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 11:42:44,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 11:42:44,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 11:42:44,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 11:42:44,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 11:42:44,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 11:42:44,292 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 11:42:44,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 11:42:44,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 11:42:44,293 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 11:42:44,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 11:42:44,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 11:42:44,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 11:42:44,472 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 11:42:44,472 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 11:42:44,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label49+token_ring.01.cil-2.c [2023-12-20 11:42:45,520 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 11:42:46,024 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 11:42:46,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label49+token_ring.01.cil-2.c [2023-12-20 11:42:46,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58cac2974/778a2ffd792b4534b9166294ab47dfbe/FLAG7584df391 [2023-12-20 11:42:46,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58cac2974/778a2ffd792b4534b9166294ab47dfbe [2023-12-20 11:42:46,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 11:42:46,078 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 11:42:46,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 11:42:46,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 11:42:46,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 11:42:46,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:42:46" (1/1) ... [2023-12-20 11:42:46,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589f394f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:46, skipping insertion in model container [2023-12-20 11:42:46,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:42:46" (1/1) ... [2023-12-20 11:42:46,234 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 11:42:47,527 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/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2023-12-20 11:42:47,549 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/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2023-12-20 11:42:47,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 11:42:47,654 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 11:42:48,245 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/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2023-12-20 11:42:48,250 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/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2023-12-20 11:42:48,268 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 11:42:48,310 INFO L206 MainTranslator]: Completed translation [2023-12-20 11:42:48,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48 WrapperNode [2023-12-20 11:42:48,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 11:42:48,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 11:42:48,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 11:42:48,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 11:42:48,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (1/1) ... [2023-12-20 11:42:48,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (1/1) ... [2023-12-20 11:42:48,713 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12579 [2023-12-20 11:42:48,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 11:42:48,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 11:42:48,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 11:42:48,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 11:42:48,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (1/1) ... [2023-12-20 11:42:48,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (1/1) ... [2023-12-20 11:42:48,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (1/1) ... [2023-12-20 11:42:48,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 11:42:48,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (1/1) ... [2023-12-20 11:42:48,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (1/1) ... [2023-12-20 11:42:49,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (1/1) ... [2023-12-20 11:42:49,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (1/1) ... [2023-12-20 11:42:49,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (1/1) ... [2023-12-20 11:42:49,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (1/1) ... [2023-12-20 11:42:49,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 11:42:49,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 11:42:49,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 11:42:49,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 11:42:49,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (1/1) ... [2023-12-20 11:42:49,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 11:42:49,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:42:49,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 11:42:49,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 11:42:49,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 11:42:49,235 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-20 11:42:49,236 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-20 11:42:49,236 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-20 11:42:49,236 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-20 11:42:49,236 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-20 11:42:49,236 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-20 11:42:49,236 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-20 11:42:49,236 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-20 11:42:49,236 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-20 11:42:49,236 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-20 11:42:49,236 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-20 11:42:49,236 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-20 11:42:49,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 11:42:49,236 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-20 11:42:49,236 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-20 11:42:49,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 11:42:49,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 11:42:49,316 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 11:42:49,318 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 11:42:54,812 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 11:42:54,901 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 11:42:54,902 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-20 11:42:54,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:42:54 BoogieIcfgContainer [2023-12-20 11:42:54,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 11:42:54,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 11:42:54,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 11:42:54,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 11:42:54,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 11:42:46" (1/3) ... [2023-12-20 11:42:54,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e7f901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:42:54, skipping insertion in model container [2023-12-20 11:42:54,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:42:48" (2/3) ... [2023-12-20 11:42:54,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e7f901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:42:54, skipping insertion in model container [2023-12-20 11:42:54,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:42:54" (3/3) ... [2023-12-20 11:42:54,912 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.01.cil-2.c [2023-12-20 11:42:54,924 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 11:42:54,924 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-20 11:42:54,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 11:42:55,000 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;@4dffae92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 11:42:55,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-20 11:42:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-20 11:42:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-20 11:42:55,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:42:55,017 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-20 11:42:55,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:42:55,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:42:55,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1135104280, now seen corresponding path program 1 times [2023-12-20 11:42:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:42:55,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434476634] [2023-12-20 11:42:55,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:42:55,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:42:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:55,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:42:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:55,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:42:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:55,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:42:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:42:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:55,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:42:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:42:55,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:42:55,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434476634] [2023-12-20 11:42:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434476634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:42:55,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:42:55,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 11:42:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000567338] [2023-12-20 11:42:55,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:42:55,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 11:42:55,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:42:55,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 11:42:55,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:42:55,327 INFO L87 Difference]: Start difference. First operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) 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-20 11:42:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:42:56,052 INFO L93 Difference]: Finished difference Result 4576 states and 8569 transitions. [2023-12-20 11:42:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 11:42:56,055 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-20 11:42:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:42:56,071 INFO L225 Difference]: With dead ends: 4576 [2023-12-20 11:42:56,071 INFO L226 Difference]: Without dead ends: 2351 [2023-12-20 11:42:56,077 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-20 11:42:56,080 INFO L413 NwaCegarLoop]: 4051 mSDtfsCounter, 4257 mSDsluCounter, 12127 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 16178 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 11:42:56,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 16178 Invalid, 531 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [72 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 11:42:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2023-12-20 11:42:56,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2310. [2023-12-20 11:42:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2268 states have (on average 1.843915343915344) internal successors, (4182), 2272 states have internal predecessors, (4182), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2023-12-20 11:42:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4237 transitions. [2023-12-20 11:42:56,182 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4237 transitions. Word has length 52 [2023-12-20 11:42:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:42:56,182 INFO L495 AbstractCegarLoop]: Abstraction has 2310 states and 4237 transitions. [2023-12-20 11:42:56,182 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-20 11:42:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4237 transitions. [2023-12-20 11:42:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-20 11:42:56,184 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:42:56,184 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-20 11:42:56,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 11:42:56,185 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:42:56,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:42:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash -668103068, now seen corresponding path program 1 times [2023-12-20 11:42:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:42:56,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599789289] [2023-12-20 11:42:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:42:56,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:42:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:56,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:42:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:42:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:42:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:56,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:42:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:56,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:42:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:42:56,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:42:56,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599789289] [2023-12-20 11:42:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599789289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:42:56,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:42:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 11:42:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411888456] [2023-12-20 11:42:56,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:42:56,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 11:42:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:42:56,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 11:42:56,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:42:56,317 INFO L87 Difference]: Start difference. First operand 2310 states and 4237 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-20 11:42:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:42:56,902 INFO L93 Difference]: Finished difference Result 2639 states and 4723 transitions. [2023-12-20 11:42:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 11:42:56,902 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-20 11:42:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:42:56,915 INFO L225 Difference]: With dead ends: 2639 [2023-12-20 11:42:56,915 INFO L226 Difference]: Without dead ends: 2457 [2023-12-20 11:42:56,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-20 11:42:56,918 INFO L413 NwaCegarLoop]: 4113 mSDtfsCounter, 4241 mSDsluCounter, 16292 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 20405 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 11:42:56,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 20405 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 11:42:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2023-12-20 11:42:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2394. [2023-12-20 11:42:56,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2335 states have (on average 1.833404710920771) internal successors, (4281), 2340 states have internal predecessors, (4281), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2023-12-20 11:42:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 4358 transitions. [2023-12-20 11:42:56,978 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 4358 transitions. Word has length 52 [2023-12-20 11:42:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:42:56,978 INFO L495 AbstractCegarLoop]: Abstraction has 2394 states and 4358 transitions. [2023-12-20 11:42:56,978 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-20 11:42:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 4358 transitions. [2023-12-20 11:42:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-20 11:42:56,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:42:56,985 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-20 11:42:56,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 11:42:56,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:42:56,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:42:56,989 INFO L85 PathProgramCache]: Analyzing trace with hash -244456346, now seen corresponding path program 1 times [2023-12-20 11:42:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:42:56,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831904513] [2023-12-20 11:42:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:42:56,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:42:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:57,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:42:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:57,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:42:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:57,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:42:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:57,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:42:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:42:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:42:57,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:42:57,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831904513] [2023-12-20 11:42:57,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831904513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:42:57,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:42:57,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 11:42:57,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200336951] [2023-12-20 11:42:57,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:42:57,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 11:42:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:42:57,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 11:42:57,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:42:57,272 INFO L87 Difference]: Start difference. First operand 2394 states and 4358 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-20 11:42:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:42:57,901 INFO L93 Difference]: Finished difference Result 2964 states and 5194 transitions. [2023-12-20 11:42:57,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 11:42:57,902 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-20 11:42:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:42:57,912 INFO L225 Difference]: With dead ends: 2964 [2023-12-20 11:42:57,912 INFO L226 Difference]: Without dead ends: 2698 [2023-12-20 11:42:57,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-20 11:42:57,917 INFO L413 NwaCegarLoop]: 4109 mSDtfsCounter, 4288 mSDsluCounter, 16287 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4298 SdHoareTripleChecker+Valid, 20396 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 11:42:57,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4298 Valid, 20396 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 11:42:57,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2023-12-20 11:42:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2559. [2023-12-20 11:42:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2468 states have (on average 1.8144246353322528) internal successors, (4478), 2475 states have internal predecessors, (4478), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2023-12-20 11:42:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4599 transitions. [2023-12-20 11:42:57,983 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4599 transitions. Word has length 52 [2023-12-20 11:42:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:42:57,984 INFO L495 AbstractCegarLoop]: Abstraction has 2559 states and 4599 transitions. [2023-12-20 11:42:57,984 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-20 11:42:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4599 transitions. [2023-12-20 11:42:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-20 11:42:57,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:42:57,985 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-20 11:42:57,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 11:42:57,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:42:57,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:42:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1616263644, now seen corresponding path program 1 times [2023-12-20 11:42:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:42:57,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881719038] [2023-12-20 11:42:57,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:42:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:42:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:58,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:42:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:58,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:42:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:58,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:42:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:58,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:42:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:42:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:42:58,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:42:58,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881719038] [2023-12-20 11:42:58,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881719038] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:42:58,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:42:58,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 11:42:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144134453] [2023-12-20 11:42:58,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:42:58,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 11:42:58,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:42:58,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 11:42:58,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:42:58,098 INFO L87 Difference]: Start difference. First operand 2559 states and 4599 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-20 11:42:58,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:42:58,582 INFO L93 Difference]: Finished difference Result 3480 states and 5949 transitions. [2023-12-20 11:42:58,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 11:42:58,582 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-20 11:42:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:42:58,593 INFO L225 Difference]: With dead ends: 3480 [2023-12-20 11:42:58,594 INFO L226 Difference]: Without dead ends: 3049 [2023-12-20 11:42:58,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-20 11:42:58,602 INFO L413 NwaCegarLoop]: 4098 mSDtfsCounter, 4235 mSDsluCounter, 16272 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4242 SdHoareTripleChecker+Valid, 20370 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 11:42:58,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4242 Valid, 20370 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 11:42:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2023-12-20 11:42:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2840. [2023-12-20 11:42:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2691 states have (on average 1.7822370865849126) internal successors, (4796), 2702 states have internal predecessors, (4796), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2023-12-20 11:42:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 5003 transitions. [2023-12-20 11:42:58,678 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 5003 transitions. Word has length 52 [2023-12-20 11:42:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:42:58,680 INFO L495 AbstractCegarLoop]: Abstraction has 2840 states and 5003 transitions. [2023-12-20 11:42:58,680 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-20 11:42:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 5003 transitions. [2023-12-20 11:42:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-20 11:42:58,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:42:58,683 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-20 11:42:58,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 11:42:58,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:42:58,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:42:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash 833336486, now seen corresponding path program 1 times [2023-12-20 11:42:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:42:58,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562046494] [2023-12-20 11:42:58,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:42:58,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:42:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:58,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:42:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:58,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:42:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:42:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:58,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:42:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:58,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:42:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:42:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:42:58,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562046494] [2023-12-20 11:42:58,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562046494] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:42:58,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:42:58,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 11:42:58,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836316506] [2023-12-20 11:42:58,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:42:58,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 11:42:58,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:42:58,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 11:42:58,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:42:58,777 INFO L87 Difference]: Start difference. First operand 2840 states and 5003 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-20 11:42:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:42:59,311 INFO L93 Difference]: Finished difference Result 4114 states and 6859 transitions. [2023-12-20 11:42:59,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 11:42:59,312 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-20 11:42:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:42:59,322 INFO L225 Difference]: With dead ends: 4114 [2023-12-20 11:42:59,322 INFO L226 Difference]: Without dead ends: 3403 [2023-12-20 11:42:59,324 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-20 11:42:59,324 INFO L413 NwaCegarLoop]: 4117 mSDtfsCounter, 4346 mSDsluCounter, 12122 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 16239 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 11:42:59,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 16239 Invalid, 650 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 11:42:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2023-12-20 11:42:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3212. [2023-12-20 11:42:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2980 states have (on average 1.7426174496644296) internal successors, (5193), 3000 states have internal predecessors, (5193), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2023-12-20 11:42:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 5508 transitions. [2023-12-20 11:42:59,392 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 5508 transitions. Word has length 52 [2023-12-20 11:42:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:42:59,392 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 5508 transitions. [2023-12-20 11:42:59,393 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-20 11:42:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 5508 transitions. [2023-12-20 11:42:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-20 11:42:59,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:42:59,395 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-20 11:42:59,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 11:42:59,395 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:42:59,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:42:59,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1387463119, now seen corresponding path program 1 times [2023-12-20 11:42:59,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:42:59,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150130534] [2023-12-20 11:42:59,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:42:59,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:42:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:42:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:59,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:42:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:59,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:42:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:42:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:59,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:42:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:59,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 11:42:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:59,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:42:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 11:42:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:59,459 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-20 11:42:59,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:42:59,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150130534] [2023-12-20 11:42:59,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150130534] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:42:59,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428130655] [2023-12-20 11:42:59,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:42:59,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:42:59,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:42:59,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:42:59,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 11:42:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:42:59,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 11:42:59,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:42:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 11:42:59,586 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:42:59,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428130655] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:42:59,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:42:59,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:42:59,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077531979] [2023-12-20 11:42:59,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:42:59,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:42:59,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:42:59,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:42:59,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:42:59,587 INFO L87 Difference]: Start difference. First operand 3212 states and 5508 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-20 11:42:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:42:59,675 INFO L93 Difference]: Finished difference Result 5267 states and 8483 transitions. [2023-12-20 11:42:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:42:59,676 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-20 11:42:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:42:59,687 INFO L225 Difference]: With dead ends: 5267 [2023-12-20 11:42:59,687 INFO L226 Difference]: Without dead ends: 4185 [2023-12-20 11:42:59,689 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-20 11:42:59,690 INFO L413 NwaCegarLoop]: 4194 mSDtfsCounter, 107 mSDsluCounter, 4088 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:42:59,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 8282 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:42:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2023-12-20 11:42:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4185. [2023-12-20 11:42:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 3744 states have (on average 1.670405982905983) internal successors, (6254), 3777 states have internal predecessors, (6254), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2023-12-20 11:42:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 6885 transitions. [2023-12-20 11:42:59,778 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 6885 transitions. Word has length 84 [2023-12-20 11:42:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:42:59,780 INFO L495 AbstractCegarLoop]: Abstraction has 4185 states and 6885 transitions. [2023-12-20 11:42:59,780 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-20 11:42:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 6885 transitions. [2023-12-20 11:42:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-20 11:42:59,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:42:59,785 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-20 11:42:59,792 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-20 11:42:59,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-20 11:42:59,992 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:42:59,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:42:59,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1055838485, now seen corresponding path program 1 times [2023-12-20 11:42:59,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:42:59,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265500249] [2023-12-20 11:42:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:42:59,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:43:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:00,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:43:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:00,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:43:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:00,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:43:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:00,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:43:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:00,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:43:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:00,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 11:43:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:00,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-20 11:43:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:00,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:00,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-20 11:43:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:00,112 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-20 11:43:00,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:43:00,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265500249] [2023-12-20 11:43:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265500249] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:43:00,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566330384] [2023-12-20 11:43:00,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:00,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:00,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:43:00,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:43:00,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 11:43:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:00,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 11:43:00,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:43:00,281 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-20 11:43:00,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:43:00,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566330384] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:43:00,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:43:00,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-20 11:43:00,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606125253] [2023-12-20 11:43:00,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:43:00,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:43:00,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:43:00,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:43:00,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:43:00,282 INFO L87 Difference]: Start difference. First operand 4185 states and 6885 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-20 11:43:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:43:00,430 INFO L93 Difference]: Finished difference Result 8169 states and 12572 transitions. [2023-12-20 11:43:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:43:00,430 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-20 11:43:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:43:00,453 INFO L225 Difference]: With dead ends: 8169 [2023-12-20 11:43:00,453 INFO L226 Difference]: Without dead ends: 6117 [2023-12-20 11:43:00,475 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-20 11:43:00,475 INFO L413 NwaCegarLoop]: 4111 mSDtfsCounter, 4036 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4036 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:43:00,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4036 Valid, 4229 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:43:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6117 states. [2023-12-20 11:43:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6117 to 6085. [2023-12-20 11:43:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6085 states, 5250 states have (on average 1.5895238095238096) internal successors, (8345), 5312 states have internal predecessors, (8345), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2023-12-20 11:43:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 9508 transitions. [2023-12-20 11:43:00,803 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 9508 transitions. Word has length 107 [2023-12-20 11:43:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:43:00,804 INFO L495 AbstractCegarLoop]: Abstraction has 6085 states and 9508 transitions. [2023-12-20 11:43:00,804 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-20 11:43:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 9508 transitions. [2023-12-20 11:43:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-20 11:43:00,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:43:00,811 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-20 11:43:00,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-20 11:43:01,022 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,SelfDestructingSolverStorable6 [2023-12-20 11:43:01,022 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:43:01,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:43:01,023 INFO L85 PathProgramCache]: Analyzing trace with hash 392176633, now seen corresponding path program 1 times [2023-12-20 11:43:01,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:43:01,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068485491] [2023-12-20 11:43:01,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:01,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:43:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:43:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:43:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:43:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:43:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:43:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 11:43:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 11:43:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 11:43:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 11:43:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,102 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-20 11:43:01,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:43:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068485491] [2023-12-20 11:43:01,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068485491] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:43:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105245778] [2023-12-20 11:43:01,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:01,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:01,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:43:01,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:43:01,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 11:43:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 11:43:01,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:43:01,282 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-20 11:43:01,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:43:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105245778] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:43:01,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:43:01,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:43:01,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951693289] [2023-12-20 11:43:01,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:43:01,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:43:01,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:43:01,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:43:01,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:43:01,284 INFO L87 Difference]: Start difference. First operand 6085 states and 9508 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-20 11:43:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:43:01,450 INFO L93 Difference]: Finished difference Result 9149 states and 13829 transitions. [2023-12-20 11:43:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:43:01,461 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-20 11:43:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:43:01,483 INFO L225 Difference]: With dead ends: 9149 [2023-12-20 11:43:01,484 INFO L226 Difference]: Without dead ends: 6373 [2023-12-20 11:43:01,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:43:01,493 INFO L413 NwaCegarLoop]: 4111 mSDtfsCounter, 4052 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4052 SdHoareTripleChecker+Valid, 4235 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:43:01,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4052 Valid, 4235 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:43:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2023-12-20 11:43:01,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6335. [2023-12-20 11:43:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 5468 states have (on average 1.5652889539136796) internal successors, (8559), 5530 states have internal predecessors, (8559), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2023-12-20 11:43:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 9760 transitions. [2023-12-20 11:43:01,713 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 9760 transitions. Word has length 122 [2023-12-20 11:43:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:43:01,713 INFO L495 AbstractCegarLoop]: Abstraction has 6335 states and 9760 transitions. [2023-12-20 11:43:01,714 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-20 11:43:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 9760 transitions. [2023-12-20 11:43:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-20 11:43:01,722 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:43:01,722 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-20 11:43:01,747 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-20 11:43:01,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:01,928 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:43:01,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:43:01,929 INFO L85 PathProgramCache]: Analyzing trace with hash -875086352, now seen corresponding path program 1 times [2023-12-20 11:43:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:43:01,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583653065] [2023-12-20 11:43:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:43:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:43:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:43:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:43:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:43:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:43:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 11:43:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:01,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:02,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 11:43:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:02,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 11:43:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:02,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:02,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 11:43:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:02,008 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-20 11:43:02,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:43:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583653065] [2023-12-20 11:43:02,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583653065] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:43:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045520926] [2023-12-20 11:43:02,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:02,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:02,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:43:02,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:43:02,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 11:43:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:02,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 11:43:02,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:43:02,112 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-20 11:43:02,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:43:02,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045520926] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:43:02,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:43:02,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:43:02,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272207542] [2023-12-20 11:43:02,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:43:02,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:43:02,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:43:02,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:43:02,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:43:02,114 INFO L87 Difference]: Start difference. First operand 6335 states and 9760 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-20 11:43:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:43:02,414 INFO L93 Difference]: Finished difference Result 14423 states and 21066 transitions. [2023-12-20 11:43:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:43:02,415 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-20 11:43:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:43:02,441 INFO L225 Difference]: With dead ends: 14423 [2023-12-20 11:43:02,441 INFO L226 Difference]: Without dead ends: 10223 [2023-12-20 11:43:02,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:43:02,451 INFO L413 NwaCegarLoop]: 4193 mSDtfsCounter, 120 mSDsluCounter, 4089 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:43:02,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 8282 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:43:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10223 states. [2023-12-20 11:43:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10223 to 10207. [2023-12-20 11:43:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10207 states, 8526 states have (on average 1.4828759089842833) internal successors, (12643), 8648 states have internal predecessors, (12643), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2023-12-20 11:43:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10207 states to 10207 states and 15120 transitions. [2023-12-20 11:43:02,753 INFO L78 Accepts]: Start accepts. Automaton has 10207 states and 15120 transitions. Word has length 123 [2023-12-20 11:43:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:43:02,754 INFO L495 AbstractCegarLoop]: Abstraction has 10207 states and 15120 transitions. [2023-12-20 11:43:02,754 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-20 11:43:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 10207 states and 15120 transitions. [2023-12-20 11:43:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-20 11:43:02,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:43:02,770 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-20 11:43:02,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 11:43:02,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:02,975 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:43:02,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:43:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1480009264, now seen corresponding path program 1 times [2023-12-20 11:43:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:43:02,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704807195] [2023-12-20 11:43:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:43:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:43:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:43:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:43:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:43:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:43:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 11:43:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 11:43:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 11:43:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-20 11:43:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,070 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-20 11:43:03,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:43:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704807195] [2023-12-20 11:43:03,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704807195] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:43:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486024484] [2023-12-20 11:43:03,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:03,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:03,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:43:03,074 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:43:03,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 11:43:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:03,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 11:43:03,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:43:03,196 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-20 11:43:03,196 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:43:03,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486024484] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:43:03,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:43:03,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:43:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629155093] [2023-12-20 11:43:03,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:43:03,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:43:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:43:03,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:43:03,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:43:03,197 INFO L87 Difference]: Start difference. First operand 10207 states and 15120 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-20 11:43:03,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:43:03,539 INFO L93 Difference]: Finished difference Result 14381 states and 21212 transitions. [2023-12-20 11:43:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:43:03,540 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-20 11:43:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:43:03,561 INFO L225 Difference]: With dead ends: 14381 [2023-12-20 11:43:03,561 INFO L226 Difference]: Without dead ends: 10227 [2023-12-20 11:43:03,567 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-20 11:43:03,567 INFO L413 NwaCegarLoop]: 4160 mSDtfsCounter, 106 mSDsluCounter, 4083 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 8243 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:43:03,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 8243 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:43:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10227 states. [2023-12-20 11:43:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10227 to 10183. [2023-12-20 11:43:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10183 states, 8502 states have (on average 1.4687132439426018) internal successors, (12487), 8624 states have internal predecessors, (12487), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2023-12-20 11:43:03,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10183 states to 10183 states and 14964 transitions. [2023-12-20 11:43:03,847 INFO L78 Accepts]: Start accepts. Automaton has 10183 states and 14964 transitions. Word has length 124 [2023-12-20 11:43:03,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:43:03,847 INFO L495 AbstractCegarLoop]: Abstraction has 10183 states and 14964 transitions. [2023-12-20 11:43:03,848 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-20 11:43:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 10183 states and 14964 transitions. [2023-12-20 11:43:03,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-20 11:43:03,864 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:43:03,865 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-20 11:43:03,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-20 11:43:04,070 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,SelfDestructingSolverStorable9 [2023-12-20 11:43:04,070 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:43:04,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:43:04,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1922845424, now seen corresponding path program 1 times [2023-12-20 11:43:04,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:43:04,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390823735] [2023-12-20 11:43:04,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:04,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:43:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:43:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:43:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:43:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:43:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:43:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 11:43:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 11:43:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 11:43:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-20 11:43:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,155 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-20 11:43:04,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:43:04,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390823735] [2023-12-20 11:43:04,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390823735] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:43:04,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555758045] [2023-12-20 11:43:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:04,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:04,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:43:04,157 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:43:04,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 11:43:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:04,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 11:43:04,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:43:04,259 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-20 11:43:04,259 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:43:04,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555758045] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:43:04,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:43:04,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:43:04,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347315853] [2023-12-20 11:43:04,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:43:04,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:43:04,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:43:04,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:43:04,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:43:04,261 INFO L87 Difference]: Start difference. First operand 10183 states and 14964 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-20 11:43:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:43:04,430 INFO L93 Difference]: Finished difference Result 16127 states and 23370 transitions. [2023-12-20 11:43:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:43:04,430 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-20 11:43:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:43:04,449 INFO L225 Difference]: With dead ends: 16127 [2023-12-20 11:43:04,450 INFO L226 Difference]: Without dead ends: 9051 [2023-12-20 11:43:04,463 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-20 11:43:04,464 INFO L413 NwaCegarLoop]: 4092 mSDtfsCounter, 4081 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 4112 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:43:04,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4081 Valid, 4112 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:43:04,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2023-12-20 11:43:04,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 8643. [2023-12-20 11:43:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8643 states, 7288 states have (on average 1.4523874862788144) internal successors, (10585), 7378 states have internal predecessors, (10585), 755 states have call successors, (755), 535 states have call predecessors, (755), 598 states have return successors, (1098), 745 states have call predecessors, (1098), 753 states have call successors, (1098) [2023-12-20 11:43:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8643 states to 8643 states and 12438 transitions. [2023-12-20 11:43:04,859 INFO L78 Accepts]: Start accepts. Automaton has 8643 states and 12438 transitions. Word has length 124 [2023-12-20 11:43:04,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:43:04,860 INFO L495 AbstractCegarLoop]: Abstraction has 8643 states and 12438 transitions. [2023-12-20 11:43:04,860 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-20 11:43:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 8643 states and 12438 transitions. [2023-12-20 11:43:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-20 11:43:04,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:43:04,868 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-20 11:43:04,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-20 11:43:05,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:05,074 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:43:05,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:43:05,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2110026461, now seen corresponding path program 1 times [2023-12-20 11:43:05,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:43:05,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431776963] [2023-12-20 11:43:05,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:05,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:43:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:43:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:43:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:43:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:43:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:43:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 11:43:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 11:43:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 11:43:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 11:43:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,152 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-20 11:43:05,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:43:05,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431776963] [2023-12-20 11:43:05,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431776963] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:43:05,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459409068] [2023-12-20 11:43:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:05,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:05,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:43:05,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:43:05,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 11:43:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:05,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 11:43:05,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:43:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-20 11:43:05,320 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:43:05,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459409068] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:43:05,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:43:05,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-20 11:43:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325559099] [2023-12-20 11:43:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:43:05,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 11:43:05,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:43:05,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 11:43:05,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 11:43:05,321 INFO L87 Difference]: Start difference. First operand 8643 states and 12438 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-20 11:43:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:43:05,587 INFO L93 Difference]: Finished difference Result 11183 states and 15869 transitions. [2023-12-20 11:43:05,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 11:43:05,587 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-20 11:43:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:43:05,603 INFO L225 Difference]: With dead ends: 11183 [2023-12-20 11:43:05,603 INFO L226 Difference]: Without dead ends: 6959 [2023-12-20 11:43:05,612 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-20 11:43:05,613 INFO L413 NwaCegarLoop]: 4044 mSDtfsCounter, 4099 mSDsluCounter, 8044 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 12088 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-20 11:43:05,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4107 Valid, 12088 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 11:43:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6959 states. [2023-12-20 11:43:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6959 to 6935. [2023-12-20 11:43:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 5938 states have (on average 1.469013135735938) internal successors, (8723), 5992 states have internal predecessors, (8723), 567 states have call successors, (567), 397 states have call predecessors, (567), 428 states have return successors, (766), 553 states have call predecessors, (766), 565 states have call successors, (766) [2023-12-20 11:43:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 10056 transitions. [2023-12-20 11:43:05,802 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 10056 transitions. Word has length 125 [2023-12-20 11:43:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:43:05,802 INFO L495 AbstractCegarLoop]: Abstraction has 6935 states and 10056 transitions. [2023-12-20 11:43:05,802 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-20 11:43:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 10056 transitions. [2023-12-20 11:43:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-20 11:43:05,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:43:05,808 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-20 11:43:05,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-20 11:43:06,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:06,021 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:43:06,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:43:06,022 INFO L85 PathProgramCache]: Analyzing trace with hash 565965921, now seen corresponding path program 1 times [2023-12-20 11:43:06,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:43:06,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745202778] [2023-12-20 11:43:06,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:06,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:43:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:43:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:43:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:43:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:43:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:43:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 11:43:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 11:43:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 11:43:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 11:43:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,132 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-20 11:43:06,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:43:06,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745202778] [2023-12-20 11:43:06,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745202778] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:43:06,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180677789] [2023-12-20 11:43:06,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:06,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:06,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:43:06,134 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:43:06,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 11:43:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 11:43:06,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:43:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-20 11:43:06,275 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:43:06,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180677789] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:43:06,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:43:06,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-20 11:43:06,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598802404] [2023-12-20 11:43:06,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:43:06,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 11:43:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:43:06,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 11:43:06,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 11:43:06,276 INFO L87 Difference]: Start difference. First operand 6935 states and 10056 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-20 11:43:06,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:43:06,545 INFO L93 Difference]: Finished difference Result 10847 states and 15238 transitions. [2023-12-20 11:43:06,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 11:43:06,545 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-20 11:43:06,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:43:06,562 INFO L225 Difference]: With dead ends: 10847 [2023-12-20 11:43:06,562 INFO L226 Difference]: Without dead ends: 6579 [2023-12-20 11:43:06,571 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-20 11:43:06,572 INFO L413 NwaCegarLoop]: 4042 mSDtfsCounter, 4129 mSDsluCounter, 8040 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 12082 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-20 11:43:06,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 12082 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 11:43:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2023-12-20 11:43:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 4985. [2023-12-20 11:43:06,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4985 states, 4408 states have (on average 1.5181488203266789) internal successors, (6692), 4438 states have internal predecessors, (6692), 331 states have call successors, (331), 229 states have call predecessors, (331), 244 states have return successors, (439), 321 states have call predecessors, (439), 329 states have call successors, (439) [2023-12-20 11:43:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 7462 transitions. [2023-12-20 11:43:06,708 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 7462 transitions. Word has length 125 [2023-12-20 11:43:06,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:43:06,709 INFO L495 AbstractCegarLoop]: Abstraction has 4985 states and 7462 transitions. [2023-12-20 11:43:06,709 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-20 11:43:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 7462 transitions. [2023-12-20 11:43:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-20 11:43:06,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:43:06,712 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-20 11:43:06,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-20 11:43:06,918 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,SelfDestructingSolverStorable12 [2023-12-20 11:43:06,918 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:43:06,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:43:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash -317543069, now seen corresponding path program 1 times [2023-12-20 11:43:06,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:43:06,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209935057] [2023-12-20 11:43:06,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:06,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:43:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:43:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:43:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:43:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:43:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:43:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 11:43:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 11:43:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 11:43:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 11:43:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:06,999 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-20 11:43:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:43:06,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209935057] [2023-12-20 11:43:06,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209935057] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:43:06,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737404636] [2023-12-20 11:43:07,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:07,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:07,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:43:07,020 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:43:07,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 11:43:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 11:43:07,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:43:07,154 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-20 11:43:07,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:43:07,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737404636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:43:07,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:43:07,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-20 11:43:07,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672823434] [2023-12-20 11:43:07,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:43:07,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 11:43:07,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:43:07,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 11:43:07,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:43:07,156 INFO L87 Difference]: Start difference. First operand 4985 states and 7462 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-20 11:43:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:43:07,275 INFO L93 Difference]: Finished difference Result 6831 states and 9780 transitions. [2023-12-20 11:43:07,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 11:43:07,276 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-20 11:43:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:43:07,283 INFO L225 Difference]: With dead ends: 6831 [2023-12-20 11:43:07,283 INFO L226 Difference]: Without dead ends: 3978 [2023-12-20 11:43:07,288 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-20 11:43:07,288 INFO L413 NwaCegarLoop]: 4084 mSDtfsCounter, 11 mSDsluCounter, 8161 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12245 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:43:07,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12245 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:43:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2023-12-20 11:43:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3978. [2023-12-20 11:43:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3609 states have (on average 1.5777223607647548) internal successors, (5694), 3629 states have internal predecessors, (5694), 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-20 11:43:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 6155 transitions. [2023-12-20 11:43:07,377 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 6155 transitions. Word has length 125 [2023-12-20 11:43:07,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:43:07,378 INFO L495 AbstractCegarLoop]: Abstraction has 3978 states and 6155 transitions. [2023-12-20 11:43:07,378 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-20 11:43:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 6155 transitions. [2023-12-20 11:43:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-20 11:43:07,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:43:07,381 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-20 11:43:07,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-20 11:43:07,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-20 11:43:07,586 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:43:07,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:43:07,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1515651619, now seen corresponding path program 1 times [2023-12-20 11:43:07,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:43:07,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737908261] [2023-12-20 11:43:07,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:07,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:43:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:43:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:43:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:43:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:43:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:43:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 11:43:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 11:43:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 11:43:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 11:43:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-20 11:43:07,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:43:07,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737908261] [2023-12-20 11:43:07,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737908261] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:43:07,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139645321] [2023-12-20 11:43:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:07,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:43:07,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:43:07,677 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:43:07,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 11:43:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:07,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 11:43:07,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:43:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-20 11:43:07,764 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:43:07,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139645321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:43:07,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:43:07,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-20 11:43:07,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681366151] [2023-12-20 11:43:07,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:43:07,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 11:43:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:43:07,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 11:43:07,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:43:07,766 INFO L87 Difference]: Start difference. First operand 3978 states and 6155 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-20 11:43:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:43:07,854 INFO L93 Difference]: Finished difference Result 5069 states and 7465 transitions. [2023-12-20 11:43:07,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 11:43:07,854 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-20 11:43:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:43:07,859 INFO L225 Difference]: With dead ends: 5069 [2023-12-20 11:43:07,859 INFO L226 Difference]: Without dead ends: 2852 [2023-12-20 11:43:07,864 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-20 11:43:07,864 INFO L413 NwaCegarLoop]: 4083 mSDtfsCounter, 2 mSDsluCounter, 8161 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12244 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:43:07,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12244 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:43:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2023-12-20 11:43:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2023-12-20 11:43:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2704 states have (on average 1.7082100591715976) internal successors, (4619), 2713 states have internal predecessors, (4619), 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-20 11:43:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4791 transitions. [2023-12-20 11:43:07,914 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4791 transitions. Word has length 125 [2023-12-20 11:43:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:43:07,914 INFO L495 AbstractCegarLoop]: Abstraction has 2852 states and 4791 transitions. [2023-12-20 11:43:07,914 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-20 11:43:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4791 transitions. [2023-12-20 11:43:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-20 11:43:07,917 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:43:07,917 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-20 11:43:07,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-20 11:43:08,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-20 11:43:08,122 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:43:08,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:43:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1882288285, now seen corresponding path program 1 times [2023-12-20 11:43:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:43:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536158496] [2023-12-20 11:43:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:43:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:43:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:43:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:43:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:43:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:43:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 11:43:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 11:43:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 11:43:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 11:43:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-20 11:43:08,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:43:08,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536158496] [2023-12-20 11:43:08,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536158496] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:43:08,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:43:08,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 11:43:08,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600405044] [2023-12-20 11:43:08,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:43:08,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 11:43:08,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:43:08,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 11:43:08,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:43:08,223 INFO L87 Difference]: Start difference. First operand 2852 states and 4791 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-20 11:43:08,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:43:08,659 INFO L93 Difference]: Finished difference Result 2874 states and 4812 transitions. [2023-12-20 11:43:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 11:43:08,660 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-20 11:43:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:43:08,665 INFO L225 Difference]: With dead ends: 2874 [2023-12-20 11:43:08,665 INFO L226 Difference]: Without dead ends: 2871 [2023-12-20 11:43:08,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-20 11:43:08,666 INFO L413 NwaCegarLoop]: 4084 mSDtfsCounter, 4294 mSDsluCounter, 12093 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4317 SdHoareTripleChecker+Valid, 16177 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.2s IncrementalHoareTripleChecker+Time [2023-12-20 11:43:08,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4317 Valid, 16177 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 11:43:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2023-12-20 11:43:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2851. [2023-12-20 11:43:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2704 states have (on average 1.7074704142011834) internal successors, (4617), 2712 states have internal predecessors, (4617), 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-20 11:43:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 4788 transitions. [2023-12-20 11:43:08,731 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 4788 transitions. Word has length 125 [2023-12-20 11:43:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:43:08,731 INFO L495 AbstractCegarLoop]: Abstraction has 2851 states and 4788 transitions. [2023-12-20 11:43:08,731 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-20 11:43:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 4788 transitions. [2023-12-20 11:43:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-20 11:43:08,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:43:08,733 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-20 11:43:08,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-20 11:43:08,733 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:43:08,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:43:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1749844747, now seen corresponding path program 1 times [2023-12-20 11:43:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:43:08,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560626888] [2023-12-20 11:43:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:08,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:43:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:43:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 11:43:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:43:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 11:43:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 11:43:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 11:43:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 11:43:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 11:43:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:43:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 11:43:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:43:08,827 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-20 11:43:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:43:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560626888] [2023-12-20 11:43:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560626888] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:43:08,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:43:08,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 11:43:08,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81773166] [2023-12-20 11:43:08,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:43:08,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 11:43:08,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:43:08,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 11:43:08,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 11:43:08,828 INFO L87 Difference]: Start difference. First operand 2851 states and 4788 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-20 11:43:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:43:09,045 INFO L93 Difference]: Finished difference Result 3246 states and 5240 transitions. [2023-12-20 11:43:09,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 11:43:09,045 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-20 11:43:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:43:09,050 INFO L225 Difference]: With dead ends: 3246 [2023-12-20 11:43:09,050 INFO L226 Difference]: Without dead ends: 2881 [2023-12-20 11:43:09,051 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-20 11:43:09,052 INFO L413 NwaCegarLoop]: 4045 mSDtfsCounter, 93 mSDsluCounter, 12027 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 16072 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.1s IncrementalHoareTripleChecker+Time [2023-12-20 11:43:09,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 16072 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 11:43:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2023-12-20 11:43:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2853. [2023-12-20 11:43:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2706 states have (on average 1.7069475240206948) internal successors, (4619), 2714 states have internal predecessors, (4619), 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-20 11:43:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4790 transitions. [2023-12-20 11:43:09,142 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4790 transitions. Word has length 129 [2023-12-20 11:43:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:43:09,143 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 4790 transitions. [2023-12-20 11:43:09,143 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-20 11:43:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4790 transitions. [2023-12-20 11:43:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-20 11:43:09,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:43:09,144 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-20 11:43:09,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-20 11:43:09,144 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:43:09,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:43:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash -360147520, now seen corresponding path program 1 times [2023-12-20 11:43:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:43:09,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097364713] [2023-12-20 11:43:09,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:43:09,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:43:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 11:43:09,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 11:43:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 11:43:09,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 11:43:09,186 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 11:43:09,187 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-20 11:43:09,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-20 11:43:09,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-20 11:43:09,190 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:43:09,192 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 11:43:09,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 11:43:09 BoogieIcfgContainer [2023-12-20 11:43:09,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 11:43:09,266 INFO L158 Benchmark]: Toolchain (without parser) took 23187.70ms. Allocated memory was 294.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 244.4MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 192.2MB. Max. memory is 8.0GB. [2023-12-20 11:43:09,266 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory was 132.1MB in the beginning and 132.0MB in the end (delta: 89.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 11:43:09,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2233.03ms. Allocated memory is still 294.6MB. Free memory was 243.9MB in the beginning and 159.2MB in the end (delta: 84.7MB). Peak memory consumption was 156.0MB. Max. memory is 8.0GB. [2023-12-20 11:43:09,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 400.58ms. Allocated memory was 294.6MB in the beginning and 494.9MB in the end (delta: 200.3MB). Free memory was 159.2MB in the beginning and 352.1MB in the end (delta: -192.9MB). Peak memory consumption was 96.5MB. Max. memory is 8.0GB. [2023-12-20 11:43:09,267 INFO L158 Benchmark]: Boogie Preprocessor took 456.27ms. Allocated memory is still 494.9MB. Free memory was 351.6MB in the beginning and 325.9MB in the end (delta: 25.7MB). Peak memory consumption was 81.3MB. Max. memory is 8.0GB. [2023-12-20 11:43:09,267 INFO L158 Benchmark]: RCFGBuilder took 5732.11ms. Allocated memory was 494.9MB in the beginning and 1.5GB in the end (delta: 1.0GB). Free memory was 325.9MB in the beginning and 1.0GB in the end (delta: -691.5MB). Peak memory consumption was 343.9MB. Max. memory is 8.0GB. [2023-12-20 11:43:09,267 INFO L158 Benchmark]: TraceAbstraction took 14359.06ms. Allocated memory was 1.5GB in the beginning and 2.7GB in the end (delta: 1.2GB). Free memory was 1.0GB in the beginning and 2.5GB in the end (delta: -1.5GB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 11:43:09,268 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory was 132.1MB in the beginning and 132.0MB in the end (delta: 89.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2233.03ms. Allocated memory is still 294.6MB. Free memory was 243.9MB in the beginning and 159.2MB in the end (delta: 84.7MB). Peak memory consumption was 156.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 400.58ms. Allocated memory was 294.6MB in the beginning and 494.9MB in the end (delta: 200.3MB). Free memory was 159.2MB in the beginning and 352.1MB in the end (delta: -192.9MB). Peak memory consumption was 96.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 456.27ms. Allocated memory is still 494.9MB. Free memory was 351.6MB in the beginning and 325.9MB in the end (delta: 25.7MB). Peak memory consumption was 81.3MB. Max. memory is 8.0GB. * RCFGBuilder took 5732.11ms. Allocated memory was 494.9MB in the beginning and 1.5GB in the end (delta: 1.0GB). Free memory was 325.9MB in the beginning and 1.0GB in the end (delta: -691.5MB). Peak memory consumption was 343.9MB. Max. memory is 8.0GB. * TraceAbstraction took 14359.06ms. Allocated memory was 1.5GB in the beginning and 2.7GB in the end (delta: 1.2GB). Free memory was 1.0GB in the beginning and 2.5GB in the end (delta: -1.5GB). There was no memory consumed. 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11385-L11396] { 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE, EXPR \read(tmp_ndt_2) [L11404] EXPR t1_st = 1 [L11405] CALL, EXPR transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET, EXPR transmit1() [L11399-L11410] { 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE, EXPR \read(tmp_ndt_1) [L11390] EXPR m_st = 1 [L11391] CALL, EXPR master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET, EXPR master() [L11385-L11396] { 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE, EXPR \read(tmp_ndt_2) [L11404] EXPR t1_st = 1 [L11405] CALL, EXPR transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET, EXPR transmit1() [L11399-L11410] { 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, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11094]: 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 8 procedures, 2226 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46594 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46497 mSDsluCounter, 211879 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142148 mSDsCounter, 430 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4490 IncrementalHoareTripleChecker+Invalid, 4920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 430 mSolverCounterUnsat, 69731 mSDtfsCounter, 4490 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1633 GetRequests, 1501 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10207occurred in iteration=9, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 2847 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3012 NumberOfCodeBlocks, 3012 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2855 ConstructedInterpolants, 0 QuantifiedInterpolants, 4370 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4144 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 1310/1466 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-20 11:43:09,283 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...