./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82b800c515c04812d9c150cf365a0cfa0ea150fbe8533e2e65b2216ea091fd6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:20:08,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:20:08,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:20:08,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:20:08,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:20:08,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:20:08,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:20:08,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:20:08,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:20:08,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:20:08,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:20:08,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:20:08,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:20:08,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:20:08,512 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:20:08,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:20:08,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:20:08,513 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:20:08,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:20:08,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:20:08,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:20:08,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:20:08,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:20:08,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:20:08,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:20:08,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:20:08,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:20:08,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:20:08,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:20:08,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:20:08,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:20:08,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:20:08,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:20:08,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:20:08,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:20:08,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:20:08,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:20:08,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:20:08,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:20:08,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:20:08,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:20:08,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:20:08,523 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d82b800c515c04812d9c150cf365a0cfa0ea150fbe8533e2e65b2216ea091fd6 [2024-10-14 04:20:08,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:20:08,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:20:08,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:20:08,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:20:08,767 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:20:08,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c [2024-10-14 04:20:10,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:20:10,609 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:20:10,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c [2024-10-14 04:20:10,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf285c4c8/52e110a25c2e43e09873ad3cfd6a74c5/FLAG6e6bf0edf [2024-10-14 04:20:11,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf285c4c8/52e110a25c2e43e09873ad3cfd6a74c5 [2024-10-14 04:20:11,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:20:11,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:20:11,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:20:11,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:20:11,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:20:11,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:20:11" (1/1) ... [2024-10-14 04:20:11,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594ea603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:11, skipping insertion in model container [2024-10-14 04:20:11,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:20:11" (1/1) ... [2024-10-14 04:20:11,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:20:12,651 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c[377069,377082] [2024-10-14 04:20:12,678 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c[383339,383352] [2024-10-14 04:20:12,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:20:12,836 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:20:13,431 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c[377069,377082] [2024-10-14 04:20:13,436 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c[383339,383352] [2024-10-14 04:20:13,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:20:13,606 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:20:13,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13 WrapperNode [2024-10-14 04:20:13,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:20:13,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:20:13,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:20:13,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:20:13,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (1/1) ... [2024-10-14 04:20:13,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (1/1) ... [2024-10-14 04:20:14,056 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12993 [2024-10-14 04:20:14,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:20:14,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:20:14,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:20:14,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:20:14,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (1/1) ... [2024-10-14 04:20:14,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (1/1) ... [2024-10-14 04:20:14,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (1/1) ... [2024-10-14 04:20:14,206 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]. [2024-10-14 04:20:14,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (1/1) ... [2024-10-14 04:20:14,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (1/1) ... [2024-10-14 04:20:14,371 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (1/1) ... [2024-10-14 04:20:14,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (1/1) ... [2024-10-14 04:20:14,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (1/1) ... [2024-10-14 04:20:14,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (1/1) ... [2024-10-14 04:20:14,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:20:14,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:20:14,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:20:14,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:20:14,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (1/1) ... [2024-10-14 04:20:14,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:20:14,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:20:14,550 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) [2024-10-14 04:20:14,555 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 [2024-10-14 04:20:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:20:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:20:14,586 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:20:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:20:14,587 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:20:14,587 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:20:14,587 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:20:14,587 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:20:14,587 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:20:14,587 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:20:14,587 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:20:14,587 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:20:14,588 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:20:14,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:20:14,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:20:14,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:20:14,700 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:20:14,702 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:20:21,073 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2024-10-14 04:20:21,073 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:20:21,179 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:20:21,179 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-14 04:20:21,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:20:21 BoogieIcfgContainer [2024-10-14 04:20:21,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:20:21,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:20:21,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:20:21,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:20:21,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:20:11" (1/3) ... [2024-10-14 04:20:21,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23095474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:20:21, skipping insertion in model container [2024-10-14 04:20:21,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:20:13" (2/3) ... [2024-10-14 04:20:21,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23095474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:20:21, skipping insertion in model container [2024-10-14 04:20:21,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:20:21" (3/3) ... [2024-10-14 04:20:21,190 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.08.cil-1.c [2024-10-14 04:20:21,204 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:20:21,204 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:20:21,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:20:21,295 INFO L333 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, 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;@7a4803a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:20:21,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:20:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 2379 states, 2348 states have (on average 1.8794718909710393) internal successors, (4413), 2351 states have internal predecessors, (4413), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 04:20:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:21,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:21,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:21,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:21,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:21,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2060137260, now seen corresponding path program 1 times [2024-10-14 04:20:21,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:21,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347097157] [2024-10-14 04:20:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:21,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:21,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:21,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:21,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347097157] [2024-10-14 04:20:21,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347097157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:21,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:21,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:20:21,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535513630] [2024-10-14 04:20:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:21,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:20:21,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:21,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:20:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:20:21,815 INFO L87 Difference]: Start difference. First operand has 2379 states, 2348 states have (on average 1.8794718909710393) internal successors, (4413), 2351 states have internal predecessors, (4413), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:20:23,003 INFO L93 Difference]: Finished difference Result 4844 states and 9066 transitions. [2024-10-14 04:20:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:20:23,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:20:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:20:23,024 INFO L225 Difference]: With dead ends: 4844 [2024-10-14 04:20:23,024 INFO L226 Difference]: Without dead ends: 2465 [2024-10-14 04:20:23,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:20:23,034 INFO L432 NwaCegarLoop]: 4181 mSDtfsCounter, 695 mSDsluCounter, 12116 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 16297 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:20:23,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 16297 Invalid, 806 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 04:20:23,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2024-10-14 04:20:23,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2375. [2024-10-14 04:20:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2345 states have (on average 1.8426439232409382) internal successors, (4321), 2347 states have internal predecessors, (4321), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 04:20:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 4365 transitions. [2024-10-14 04:20:23,162 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 4365 transitions. Word has length 121 [2024-10-14 04:20:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:20:23,163 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 4365 transitions. [2024-10-14 04:20:23,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 4365 transitions. [2024-10-14 04:20:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:23,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:23,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:23,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:20:23,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:23,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash 58250990, now seen corresponding path program 1 times [2024-10-14 04:20:23,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:23,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299160732] [2024-10-14 04:20:23,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:23,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:23,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:23,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:23,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:23,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:23,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:23,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299160732] [2024-10-14 04:20:23,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299160732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:23,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:23,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:20:23,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017742245] [2024-10-14 04:20:23,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:23,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:20:23,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:20:23,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:20:23,490 INFO L87 Difference]: Start difference. First operand 2375 states and 4365 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:20:25,251 INFO L93 Difference]: Finished difference Result 3046 states and 5475 transitions. [2024-10-14 04:20:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:20:25,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:20:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:20:25,262 INFO L225 Difference]: With dead ends: 3046 [2024-10-14 04:20:25,262 INFO L226 Difference]: Without dead ends: 2806 [2024-10-14 04:20:25,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:20:25,265 INFO L432 NwaCegarLoop]: 4154 mSDtfsCounter, 4998 mSDsluCounter, 12445 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5013 SdHoareTripleChecker+Valid, 16599 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:20:25,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5013 Valid, 16599 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 04:20:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2024-10-14 04:20:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2627. [2024-10-14 04:20:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2573 states have (on average 1.8239409249902838) internal successors, (4693), 2576 states have internal predecessors, (4693), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-14 04:20:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 4774 transitions. [2024-10-14 04:20:25,336 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 4774 transitions. Word has length 121 [2024-10-14 04:20:25,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:20:25,337 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 4774 transitions. [2024-10-14 04:20:25,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 4774 transitions. [2024-10-14 04:20:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:25,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:25,338 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:25,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:20:25,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:25,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:25,339 INFO L85 PathProgramCache]: Analyzing trace with hash 603539502, now seen corresponding path program 1 times [2024-10-14 04:20:25,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:25,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652040628] [2024-10-14 04:20:25,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:25,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:25,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:25,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:25,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:25,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:25,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:25,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652040628] [2024-10-14 04:20:25,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652040628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:25,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:25,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:20:25,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795173603] [2024-10-14 04:20:25,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:25,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:20:25,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:25,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:20:25,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:20:25,548 INFO L87 Difference]: Start difference. First operand 2627 states and 4774 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:20:28,061 INFO L93 Difference]: Finished difference Result 3651 states and 6465 transitions. [2024-10-14 04:20:28,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:20:28,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:20:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:20:28,073 INFO L225 Difference]: With dead ends: 3651 [2024-10-14 04:20:28,073 INFO L226 Difference]: Without dead ends: 3159 [2024-10-14 04:20:28,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:20:28,076 INFO L432 NwaCegarLoop]: 4300 mSDtfsCounter, 5019 mSDsluCounter, 16941 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5034 SdHoareTripleChecker+Valid, 21241 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:20:28,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5034 Valid, 21241 Invalid, 2691 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 2638 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 04:20:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3159 states. [2024-10-14 04:20:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3159 to 2860. [2024-10-14 04:20:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2782 states have (on average 1.8069734004313445) internal successors, (5027), 2786 states have internal predecessors, (5027), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-14 04:20:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 5144 transitions. [2024-10-14 04:20:28,168 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 5144 transitions. Word has length 121 [2024-10-14 04:20:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:20:28,168 INFO L471 AbstractCegarLoop]: Abstraction has 2860 states and 5144 transitions. [2024-10-14 04:20:28,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 5144 transitions. [2024-10-14 04:20:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:28,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:28,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:28,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:20:28,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:28,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:28,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1429854544, now seen corresponding path program 1 times [2024-10-14 04:20:28,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:28,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480737235] [2024-10-14 04:20:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:28,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:28,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:28,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:28,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:28,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:28,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480737235] [2024-10-14 04:20:28,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480737235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:28,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:28,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:20:28,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927047610] [2024-10-14 04:20:28,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:28,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:20:28,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:28,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:20:28,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:20:28,408 INFO L87 Difference]: Start difference. First operand 2860 states and 5144 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:20:30,838 INFO L93 Difference]: Finished difference Result 4537 states and 7907 transitions. [2024-10-14 04:20:30,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:20:30,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:20:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:20:30,854 INFO L225 Difference]: With dead ends: 4537 [2024-10-14 04:20:30,854 INFO L226 Difference]: Without dead ends: 3812 [2024-10-14 04:20:30,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:20:30,860 INFO L432 NwaCegarLoop]: 4163 mSDtfsCounter, 5097 mSDsluCounter, 16578 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5112 SdHoareTripleChecker+Valid, 20741 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:20:30,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5112 Valid, 20741 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 04:20:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2024-10-14 04:20:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 3327. [2024-10-14 04:20:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3201 states have (on average 1.7794439237738207) internal successors, (5696), 3207 states have internal predecessors, (5696), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-14 04:20:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5889 transitions. [2024-10-14 04:20:30,951 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5889 transitions. Word has length 121 [2024-10-14 04:20:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:20:30,951 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5889 transitions. [2024-10-14 04:20:30,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5889 transitions. [2024-10-14 04:20:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:30,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:30,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:30,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:20:30,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:30,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:30,955 INFO L85 PathProgramCache]: Analyzing trace with hash 998404078, now seen corresponding path program 1 times [2024-10-14 04:20:30,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:30,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789778714] [2024-10-14 04:20:30,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:30,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:31,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:31,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:31,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:31,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:31,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:31,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789778714] [2024-10-14 04:20:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789778714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:31,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:31,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:20:31,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675747544] [2024-10-14 04:20:31,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:31,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:20:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:31,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:20:31,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:20:31,188 INFO L87 Difference]: Start difference. First operand 3327 states and 5889 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:20:32,393 INFO L93 Difference]: Finished difference Result 4994 states and 8645 transitions. [2024-10-14 04:20:32,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:20:32,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:20:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:20:32,405 INFO L225 Difference]: With dead ends: 4994 [2024-10-14 04:20:32,405 INFO L226 Difference]: Without dead ends: 3802 [2024-10-14 04:20:32,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:20:32,409 INFO L432 NwaCegarLoop]: 4141 mSDtfsCounter, 4728 mSDsluCounter, 16388 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4744 SdHoareTripleChecker+Valid, 20529 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:20:32,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4744 Valid, 20529 Invalid, 1398 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 04:20:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2024-10-14 04:20:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3327. [2024-10-14 04:20:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3201 states have (on average 1.7778819119025304) internal successors, (5691), 3207 states have internal predecessors, (5691), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-14 04:20:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5884 transitions. [2024-10-14 04:20:32,521 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5884 transitions. Word has length 121 [2024-10-14 04:20:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:20:32,521 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5884 transitions. [2024-10-14 04:20:32,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5884 transitions. [2024-10-14 04:20:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:32,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:32,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:32,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:20:32,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:32,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash -308738320, now seen corresponding path program 1 times [2024-10-14 04:20:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:32,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410680530] [2024-10-14 04:20:32,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:32,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:32,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:32,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:32,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:32,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:32,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:32,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:32,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410680530] [2024-10-14 04:20:32,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410680530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:32,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:32,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:20:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896896873] [2024-10-14 04:20:32,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:32,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:20:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:32,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:20:32,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:20:32,716 INFO L87 Difference]: Start difference. First operand 3327 states and 5884 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:20:33,894 INFO L93 Difference]: Finished difference Result 4983 states and 8609 transitions. [2024-10-14 04:20:33,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:20:33,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:20:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:20:33,909 INFO L225 Difference]: With dead ends: 4983 [2024-10-14 04:20:33,909 INFO L226 Difference]: Without dead ends: 3791 [2024-10-14 04:20:33,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:20:33,915 INFO L432 NwaCegarLoop]: 4141 mSDtfsCounter, 4833 mSDsluCounter, 12312 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4849 SdHoareTripleChecker+Valid, 16453 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:20:33,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4849 Valid, 16453 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 04:20:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2024-10-14 04:20:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 3327. [2024-10-14 04:20:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3201 states have (on average 1.7763199000312402) internal successors, (5686), 3207 states have internal predecessors, (5686), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-14 04:20:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5879 transitions. [2024-10-14 04:20:34,043 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5879 transitions. Word has length 121 [2024-10-14 04:20:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:20:34,044 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5879 transitions. [2024-10-14 04:20:34,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5879 transitions. [2024-10-14 04:20:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:34,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:34,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:34,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:20:34,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:34,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash 722302578, now seen corresponding path program 1 times [2024-10-14 04:20:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:34,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535451643] [2024-10-14 04:20:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:34,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:34,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:34,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:34,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:34,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:34,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:34,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535451643] [2024-10-14 04:20:34,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535451643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:34,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:34,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:20:34,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066186894] [2024-10-14 04:20:34,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:34,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:20:34,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:34,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:20:34,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:20:34,249 INFO L87 Difference]: Start difference. First operand 3327 states and 5879 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:20:36,367 INFO L93 Difference]: Finished difference Result 6219 states and 10582 transitions. [2024-10-14 04:20:36,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:20:36,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:20:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:20:36,394 INFO L225 Difference]: With dead ends: 6219 [2024-10-14 04:20:36,394 INFO L226 Difference]: Without dead ends: 5027 [2024-10-14 04:20:36,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:20:36,399 INFO L432 NwaCegarLoop]: 4298 mSDtfsCounter, 5002 mSDsluCounter, 16941 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5017 SdHoareTripleChecker+Valid, 21239 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:20:36,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5017 Valid, 21239 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 04:20:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2024-10-14 04:20:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 4276. [2024-10-14 04:20:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4054 states have (on average 1.735816477553034) internal successors, (7037), 4064 states have internal predecessors, (7037), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-14 04:20:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 7388 transitions. [2024-10-14 04:20:36,619 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 7388 transitions. Word has length 121 [2024-10-14 04:20:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:20:36,619 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 7388 transitions. [2024-10-14 04:20:36,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 7388 transitions. [2024-10-14 04:20:36,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:36,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:36,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:36,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:20:36,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:36,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:36,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1184100688, now seen corresponding path program 1 times [2024-10-14 04:20:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:36,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102914077] [2024-10-14 04:20:36,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:36,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:36,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:36,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:36,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:36,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:36,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:36,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102914077] [2024-10-14 04:20:36,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102914077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:36,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:36,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:20:36,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402253508] [2024-10-14 04:20:36,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:36,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:20:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:36,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:20:36,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:20:36,759 INFO L87 Difference]: Start difference. First operand 4276 states and 7388 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:20:38,319 INFO L93 Difference]: Finished difference Result 7177 states and 12134 transitions. [2024-10-14 04:20:38,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:20:38,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:20:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:20:38,335 INFO L225 Difference]: With dead ends: 7177 [2024-10-14 04:20:38,335 INFO L226 Difference]: Without dead ends: 5036 [2024-10-14 04:20:38,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:20:38,342 INFO L432 NwaCegarLoop]: 4141 mSDtfsCounter, 4724 mSDsluCounter, 16388 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4740 SdHoareTripleChecker+Valid, 20529 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:20:38,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4740 Valid, 20529 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 04:20:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2024-10-14 04:20:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4276. [2024-10-14 04:20:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4054 states have (on average 1.7335964479526393) internal successors, (7028), 4064 states have internal predecessors, (7028), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-14 04:20:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 7379 transitions. [2024-10-14 04:20:38,698 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 7379 transitions. Word has length 121 [2024-10-14 04:20:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:20:38,698 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 7379 transitions. [2024-10-14 04:20:38,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 7379 transitions. [2024-10-14 04:20:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:38,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:38,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:38,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:20:38,700 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:38,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash 416970418, now seen corresponding path program 1 times [2024-10-14 04:20:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:38,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352758549] [2024-10-14 04:20:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:38,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:38,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:38,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:38,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:38,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:38,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:38,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352758549] [2024-10-14 04:20:38,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352758549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:38,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:38,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:20:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594905160] [2024-10-14 04:20:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:38,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:20:38,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:38,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:20:38,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:20:38,876 INFO L87 Difference]: Start difference. First operand 4276 states and 7379 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:20:41,125 INFO L93 Difference]: Finished difference Result 9610 states and 16003 transitions. [2024-10-14 04:20:41,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:20:41,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:20:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:20:41,139 INFO L225 Difference]: With dead ends: 9610 [2024-10-14 04:20:41,139 INFO L226 Difference]: Without dead ends: 7469 [2024-10-14 04:20:41,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:20:41,145 INFO L432 NwaCegarLoop]: 4298 mSDtfsCounter, 4994 mSDsluCounter, 16941 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5009 SdHoareTripleChecker+Valid, 21239 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:20:41,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5009 Valid, 21239 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 04:20:41,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2024-10-14 04:20:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 6184. [2024-10-14 04:20:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6184 states, 5770 states have (on average 1.6863084922010398) internal successors, (9730), 5788 states have internal predecessors, (9730), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-10-14 04:20:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6184 states to 6184 states and 10415 transitions. [2024-10-14 04:20:41,339 INFO L78 Accepts]: Start accepts. Automaton has 6184 states and 10415 transitions. Word has length 121 [2024-10-14 04:20:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:20:41,340 INFO L471 AbstractCegarLoop]: Abstraction has 6184 states and 10415 transitions. [2024-10-14 04:20:41,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 6184 states and 10415 transitions. [2024-10-14 04:20:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:41,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:41,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:41,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:20:41,345 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:41,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:41,346 INFO L85 PathProgramCache]: Analyzing trace with hash -639760784, now seen corresponding path program 1 times [2024-10-14 04:20:41,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:41,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964399431] [2024-10-14 04:20:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:41,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:41,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:41,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:41,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:41,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:41,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:41,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964399431] [2024-10-14 04:20:41,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964399431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:41,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:41,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:20:41,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935595609] [2024-10-14 04:20:41,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:41,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:20:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:20:41,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:20:41,495 INFO L87 Difference]: Start difference. First operand 6184 states and 10415 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:20:43,955 INFO L93 Difference]: Finished difference Result 18072 states and 29651 transitions. [2024-10-14 04:20:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:20:43,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:20:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:20:43,991 INFO L225 Difference]: With dead ends: 18072 [2024-10-14 04:20:43,991 INFO L226 Difference]: Without dead ends: 14023 [2024-10-14 04:20:44,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:20:44,006 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5287 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5311 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:20:44,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5311 Valid, 21232 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 04:20:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14023 states. [2024-10-14 04:20:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14023 to 9981. [2024-10-14 04:20:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9981 states, 9199 states have (on average 1.6453962387216001) internal successors, (15136), 9233 states have internal predecessors, (15136), 550 states have call successors, (550), 198 states have call predecessors, (550), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2024-10-14 04:20:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9981 states to 9981 states and 16511 transitions. [2024-10-14 04:20:44,614 INFO L78 Accepts]: Start accepts. Automaton has 9981 states and 16511 transitions. Word has length 121 [2024-10-14 04:20:44,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:20:44,614 INFO L471 AbstractCegarLoop]: Abstraction has 9981 states and 16511 transitions. [2024-10-14 04:20:44,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 9981 states and 16511 transitions. [2024-10-14 04:20:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:44,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:44,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:44,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:20:44,620 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:44,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:44,621 INFO L85 PathProgramCache]: Analyzing trace with hash 711624434, now seen corresponding path program 1 times [2024-10-14 04:20:44,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:44,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055415113] [2024-10-14 04:20:44,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:44,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:44,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:44,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:44,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:44,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055415113] [2024-10-14 04:20:44,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055415113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:44,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:44,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:20:44,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683165242] [2024-10-14 04:20:44,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:44,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:20:44,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:44,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:20:44,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:20:44,822 INFO L87 Difference]: Start difference. First operand 9981 states and 16511 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:20:49,187 INFO L93 Difference]: Finished difference Result 32883 states and 53741 transitions. [2024-10-14 04:20:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:20:49,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:20:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:20:49,253 INFO L225 Difference]: With dead ends: 32883 [2024-10-14 04:20:49,253 INFO L226 Difference]: Without dead ends: 25037 [2024-10-14 04:20:49,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:20:49,279 INFO L432 NwaCegarLoop]: 4189 mSDtfsCounter, 5120 mSDsluCounter, 16600 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 20789 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:20:49,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 20789 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 04:20:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25037 states. [2024-10-14 04:20:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25037 to 17414. [2024-10-14 04:20:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17414 states, 15912 states have (on average 1.6165158371040724) internal successors, (25722), 15978 states have internal predecessors, (25722), 1046 states have call successors, (1046), 390 states have call predecessors, (1046), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-10-14 04:20:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17414 states to 17414 states and 28607 transitions. [2024-10-14 04:20:50,316 INFO L78 Accepts]: Start accepts. Automaton has 17414 states and 28607 transitions. Word has length 121 [2024-10-14 04:20:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:20:50,316 INFO L471 AbstractCegarLoop]: Abstraction has 17414 states and 28607 transitions. [2024-10-14 04:20:50,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17414 states and 28607 transitions. [2024-10-14 04:20:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:50,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:50,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:50,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:20:50,326 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:50,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:50,326 INFO L85 PathProgramCache]: Analyzing trace with hash -907350480, now seen corresponding path program 1 times [2024-10-14 04:20:50,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:50,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572188865] [2024-10-14 04:20:50,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:50,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:50,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:50,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:50,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:50,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:50,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:50,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:50,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572188865] [2024-10-14 04:20:50,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572188865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:50,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:50,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:20:50,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028042033] [2024-10-14 04:20:50,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:50,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:20:50,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:50,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:20:50,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:20:50,467 INFO L87 Difference]: Start difference. First operand 17414 states and 28607 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:20:54,857 INFO L93 Difference]: Finished difference Result 61578 states and 100971 transitions. [2024-10-14 04:20:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:20:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:20:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:20:54,995 INFO L225 Difference]: With dead ends: 61578 [2024-10-14 04:20:54,995 INFO L226 Difference]: Without dead ends: 46299 [2024-10-14 04:20:55,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:20:55,039 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5221 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5245 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:20:55,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5245 Valid, 21232 Invalid, 2525 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 04:20:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46299 states. [2024-10-14 04:20:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46299 to 32439. [2024-10-14 04:20:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32439 states, 29529 states have (on average 1.598835043516543) internal successors, (47212), 29659 states have internal predecessors, (47212), 2006 states have call successors, (2006), 774 states have call predecessors, (2006), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2024-10-14 04:20:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32439 states to 32439 states and 53539 transitions. [2024-10-14 04:20:57,851 INFO L78 Accepts]: Start accepts. Automaton has 32439 states and 53539 transitions. Word has length 121 [2024-10-14 04:20:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:20:57,852 INFO L471 AbstractCegarLoop]: Abstraction has 32439 states and 53539 transitions. [2024-10-14 04:20:57,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:20:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 32439 states and 53539 transitions. [2024-10-14 04:20:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:20:57,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:20:57,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:20:57,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:20:57,902 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:20:57,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:20:57,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1790859470, now seen corresponding path program 1 times [2024-10-14 04:20:57,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:20:57,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341662536] [2024-10-14 04:20:57,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:20:57,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:20:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:58,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:20:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:58,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:20:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:58,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:20:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:58,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:20:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:20:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:20:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:20:58,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:20:58,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341662536] [2024-10-14 04:20:58,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341662536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:20:58,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:20:58,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:20:58,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044601798] [2024-10-14 04:20:58,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:20:58,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:20:58,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:20:58,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:20:58,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:20:58,222 INFO L87 Difference]: Start difference. First operand 32439 states and 53539 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:21:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:21:06,726 INFO L93 Difference]: Finished difference Result 116759 states and 193853 transitions. [2024-10-14 04:21:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:21:06,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-14 04:21:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:21:07,229 INFO L225 Difference]: With dead ends: 116759 [2024-10-14 04:21:07,230 INFO L226 Difference]: Without dead ends: 86455 [2024-10-14 04:21:07,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:21:07,298 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5030 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5044 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:21:07,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5044 Valid, 21232 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2755 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 04:21:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86455 states. [2024-10-14 04:21:11,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86455 to 62617. [2024-10-14 04:21:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62617 states, 56955 states have (on average 1.5903081380036872) internal successors, (90576), 57213 states have internal predecessors, (90576), 3862 states have call successors, (3862), 1542 states have call predecessors, (3862), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-10-14 04:21:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62617 states to 62617 states and 105117 transitions. [2024-10-14 04:21:11,977 INFO L78 Accepts]: Start accepts. Automaton has 62617 states and 105117 transitions. Word has length 121 [2024-10-14 04:21:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:21:11,978 INFO L471 AbstractCegarLoop]: Abstraction has 62617 states and 105117 transitions. [2024-10-14 04:21:11,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:21:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 62617 states and 105117 transitions. [2024-10-14 04:21:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 04:21:12,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:12,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:12,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:21:12,059 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:12,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:12,059 INFO L85 PathProgramCache]: Analyzing trace with hash 563525812, now seen corresponding path program 1 times [2024-10-14 04:21:12,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:12,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050697696] [2024-10-14 04:21:12,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:12,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:12,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:12,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 04:21:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:12,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 04:21:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:12,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 04:21:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 04:21:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:21:12,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:12,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050697696] [2024-10-14 04:21:12,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050697696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:12,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:12,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:21:12,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736643994] [2024-10-14 04:21:12,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:12,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:21:12,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:12,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:21:12,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:21:12,325 INFO L87 Difference]: Start difference. First operand 62617 states and 105117 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)