./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_label49+token_ring.11.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.11.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 baa3d7d596cfacd752b448b2d94171196ab29c96dae98d968ce044a2cc25c48f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:27:26,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:27:26,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:27:26,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:27:26,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:27:26,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:27:26,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:27:26,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:27:26,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:27:26,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:27:26,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:27:26,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:27:26,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:27:26,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:27:26,407 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:27:26,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:27:26,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:27:26,408 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:27:26,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:27:26,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:27:26,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:27:26,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:27:26,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:27:26,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:27:26,412 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:27:26,413 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:27:26,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:27:26,413 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:27:26,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:27:26,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:27:26,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:27:26,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:27:26,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:27:26,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:27:26,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:27:26,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:27:26,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:27:26,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:27:26,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:27:26,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:27:26,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:27:26,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:27:26,415 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-clean/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-clean/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 -> baa3d7d596cfacd752b448b2d94171196ab29c96dae98d968ce044a2cc25c48f [2024-10-11 04:27:26,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:27:26,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:27:26,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:27:26,627 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:27:26,627 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:27:26,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.11.cil-1.c [2024-10-11 04:27:27,833 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:27:28,268 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:27:28,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.11.cil-1.c [2024-10-11 04:27:28,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ebe5cb294/ce142d06e52949f885259cbc5e9c2e26/FLAG739afa190 [2024-10-11 04:27:28,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ebe5cb294/ce142d06e52949f885259cbc5e9c2e26 [2024-10-11 04:27:28,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:27:28,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:27:28,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:27:28,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:27:28,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:27:28,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:27:28" (1/1) ... [2024-10-11 04:27:28,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f65578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:28, skipping insertion in model container [2024-10-11 04:27:28,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:27:28" (1/1) ... [2024-10-11 04:27:28,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:27:29,713 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_label49+token_ring.11.cil-1.c[380593,380606] [2024-10-11 04:27:29,740 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_label49+token_ring.11.cil-1.c[383339,383352] [2024-10-11 04:27:29,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:27:29,970 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:27:30,567 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_label49+token_ring.11.cil-1.c[380593,380606] [2024-10-11 04:27:30,575 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_label49+token_ring.11.cil-1.c[383339,383352] [2024-10-11 04:27:30,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:27:30,646 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:27:30,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30 WrapperNode [2024-10-11 04:27:30,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:27:30,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:27:30,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:27:30,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:27:30,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (1/1) ... [2024-10-11 04:27:30,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (1/1) ... [2024-10-11 04:27:31,021 INFO L138 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 13179 [2024-10-11 04:27:31,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:27:31,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:27:31,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:27:31,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:27:31,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (1/1) ... [2024-10-11 04:27:31,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (1/1) ... [2024-10-11 04:27:31,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (1/1) ... [2024-10-11 04:27:31,129 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-11 04:27:31,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (1/1) ... [2024-10-11 04:27:31,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (1/1) ... [2024-10-11 04:27:31,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (1/1) ... [2024-10-11 04:27:31,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (1/1) ... [2024-10-11 04:27:31,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (1/1) ... [2024-10-11 04:27:31,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (1/1) ... [2024-10-11 04:27:31,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:27:31,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:27:31,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:27:31,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:27:31,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (1/1) ... [2024-10-11 04:27:31,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:27:31,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:27:31,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:27:31,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:27:31,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:27:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:27:31,522 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:27:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:27:31,522 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:27:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:27:31,523 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:27:31,523 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:27:31,524 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:27:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:27:31,524 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:27:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:27:31,524 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:27:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:27:31,524 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:27:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:27:31,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:27:31,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:27:31,643 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:27:31,645 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:27:37,619 INFO L? ?]: Removed 1753 outVars from TransFormulas that were not future-live. [2024-10-11 04:27:37,619 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:27:37,696 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:27:37,697 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-11 04:27:37,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:27:37 BoogieIcfgContainer [2024-10-11 04:27:37,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:27:37,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:27:37,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:27:37,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:27:37,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:27:28" (1/3) ... [2024-10-11 04:27:37,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5896a3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:27:37, skipping insertion in model container [2024-10-11 04:27:37,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:30" (2/3) ... [2024-10-11 04:27:37,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5896a3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:27:37, skipping insertion in model container [2024-10-11 04:27:37,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:27:37" (3/3) ... [2024-10-11 04:27:37,707 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.11.cil-1.c [2024-10-11 04:27:37,725 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:27:37,725 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:27:37,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:27:37,807 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;@43d11c87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:27:37,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:27:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 2456 states, 2419 states have (on average 1.8768085985944605) internal successors, (4540), 2424 states have internal predecessors, (4540), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 04:27:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:27:37,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:37,835 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:27:37,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:37,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:37,839 INFO L85 PathProgramCache]: Analyzing trace with hash 190505612, now seen corresponding path program 1 times [2024-10-11 04:27:37,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:37,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102351217] [2024-10-11 04:27:37,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:37,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:38,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:27:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:38,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:27:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:38,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:27:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:38,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:27:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:38,311 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-11 04:27:38,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:38,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102351217] [2024-10-11 04:27:38,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102351217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:38,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:27:38,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:27:38,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125352672] [2024-10-11 04:27:38,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:38,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:27:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:38,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:27:38,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:27:38,348 INFO L87 Difference]: Start difference. First operand has 2456 states, 2419 states have (on average 1.8768085985944605) internal successors, (4540), 2424 states have internal predecessors, (4540), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:27:39,818 INFO L93 Difference]: Finished difference Result 5021 states and 9382 transitions. [2024-10-11 04:27:39,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:27:39,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:27:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:27:39,846 INFO L225 Difference]: With dead ends: 5021 [2024-10-11 04:27:39,847 INFO L226 Difference]: Without dead ends: 2571 [2024-10-11 04:27:39,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:27:39,860 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 916 mSDsluCounter, 12200 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 16449 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:27:39,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 16449 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:27:39,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2024-10-11 04:27:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2451. [2024-10-11 04:27:40,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2416 states have (on average 1.8385761589403973) internal successors, (4442), 2419 states have internal predecessors, (4442), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 04:27:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 4494 transitions. [2024-10-11 04:27:40,053 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 4494 transitions. Word has length 152 [2024-10-11 04:27:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:27:40,054 INFO L471 AbstractCegarLoop]: Abstraction has 2451 states and 4494 transitions. [2024-10-11 04:27:40,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 4494 transitions. [2024-10-11 04:27:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:27:40,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:40,057 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:27:40,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:27:40,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:40,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1978375434, now seen corresponding path program 1 times [2024-10-11 04:27:40,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:40,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591132618] [2024-10-11 04:27:40,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:40,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:40,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:40,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:27:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:40,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:27:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:40,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:27:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:40,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:27:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:40,355 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-11 04:27:40,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:40,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591132618] [2024-10-11 04:27:40,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591132618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:40,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:27:40,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:27:40,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436725420] [2024-10-11 04:27:40,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:40,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:27:40,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:40,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:27:40,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:27:40,361 INFO L87 Difference]: Start difference. First operand 2451 states and 4494 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:27:42,559 INFO L93 Difference]: Finished difference Result 3334 states and 5970 transitions. [2024-10-11 04:27:42,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:27:42,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:27:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:27:42,570 INFO L225 Difference]: With dead ends: 3334 [2024-10-11 04:27:42,570 INFO L226 Difference]: Without dead ends: 3021 [2024-10-11 04:27:42,572 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-11 04:27:42,573 INFO L432 NwaCegarLoop]: 4216 mSDtfsCounter, 5341 mSDsluCounter, 12642 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5359 SdHoareTripleChecker+Valid, 16858 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:27:42,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5359 Valid, 16858 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:27:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2024-10-11 04:27:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2780. [2024-10-11 04:27:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2718 states have (on average 1.8178807947019868) internal successors, (4941), 2722 states have internal predecessors, (4941), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-10-11 04:27:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 5036 transitions. [2024-10-11 04:27:42,632 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 5036 transitions. Word has length 152 [2024-10-11 04:27:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:27:42,632 INFO L471 AbstractCegarLoop]: Abstraction has 2780 states and 5036 transitions. [2024-10-11 04:27:42,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 5036 transitions. [2024-10-11 04:27:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:27:42,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:42,639 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:27:42,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:27:42,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:42,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:42,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1779625978, now seen corresponding path program 1 times [2024-10-11 04:27:42,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:42,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927104385] [2024-10-11 04:27:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:42,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:42,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:42,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:27:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:42,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:27:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:42,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:27:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:42,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:27:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:42,966 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-11 04:27:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:42,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927104385] [2024-10-11 04:27:42,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927104385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:42,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:27:42,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:27:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690370176] [2024-10-11 04:27:42,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:42,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:27:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:42,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:27:42,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:27:42,969 INFO L87 Difference]: Start difference. First operand 2780 states and 5036 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:27:45,742 INFO L93 Difference]: Finished difference Result 4129 states and 7292 transitions. [2024-10-11 04:27:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:27:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:27:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:27:45,756 INFO L225 Difference]: With dead ends: 4129 [2024-10-11 04:27:45,756 INFO L226 Difference]: Without dead ends: 3487 [2024-10-11 04:27:45,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:27:45,761 INFO L432 NwaCegarLoop]: 4412 mSDtfsCounter, 5370 mSDsluCounter, 17339 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5388 SdHoareTripleChecker+Valid, 21751 SdHoareTripleChecker+Invalid, 3539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:27:45,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5388 Valid, 21751 Invalid, 3539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3476 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 04:27:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2024-10-11 04:27:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3084. [2024-10-11 04:27:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2995 states have (on average 1.7996661101836393) internal successors, (5390), 3000 states have internal predecessors, (5390), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-11 04:27:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 5527 transitions. [2024-10-11 04:27:45,919 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 5527 transitions. Word has length 152 [2024-10-11 04:27:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:27:45,920 INFO L471 AbstractCegarLoop]: Abstraction has 3084 states and 5527 transitions. [2024-10-11 04:27:45,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 5527 transitions. [2024-10-11 04:27:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:27:45,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:45,922 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:27:45,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:27:45,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:45,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1970468744, now seen corresponding path program 1 times [2024-10-11 04:27:45,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:45,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999876847] [2024-10-11 04:27:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:45,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:46,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:46,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:27:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:46,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:27:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:46,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:27:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:46,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:27:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:46,200 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-11 04:27:46,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:46,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999876847] [2024-10-11 04:27:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999876847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:46,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:27:46,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:27:46,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854119638] [2024-10-11 04:27:46,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:46,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:27:46,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:46,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:27:46,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:27:46,204 INFO L87 Difference]: Start difference. First operand 3084 states and 5527 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:27:49,191 INFO L93 Difference]: Finished difference Result 5294 states and 9217 transitions. [2024-10-11 04:27:49,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:27:49,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:27:49,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:27:49,207 INFO L225 Difference]: With dead ends: 5294 [2024-10-11 04:27:49,207 INFO L226 Difference]: Without dead ends: 4348 [2024-10-11 04:27:49,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:27:49,211 INFO L432 NwaCegarLoop]: 4410 mSDtfsCounter, 5368 mSDsluCounter, 17339 mSDsCounter, 0 mSdLazyCounter, 3472 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5386 SdHoareTripleChecker+Valid, 21749 SdHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:27:49,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5386 Valid, 21749 Invalid, 3537 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3472 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:27:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states. [2024-10-11 04:27:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 3693. [2024-10-11 04:27:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3550 states have (on average 1.771549295774648) internal successors, (6289), 3557 states have internal predecessors, (6289), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:27:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 6514 transitions. [2024-10-11 04:27:49,462 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 6514 transitions. Word has length 152 [2024-10-11 04:27:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:27:49,463 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 6514 transitions. [2024-10-11 04:27:49,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 6514 transitions. [2024-10-11 04:27:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:27:49,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:49,465 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:27:49,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:27:49,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:49,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:49,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1649338426, now seen corresponding path program 1 times [2024-10-11 04:27:49,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:49,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290045374] [2024-10-11 04:27:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:49,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:49,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:49,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:27:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:49,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:27:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:49,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:27:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:49,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:27:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:49,700 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-11 04:27:49,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:49,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290045374] [2024-10-11 04:27:49,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290045374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:49,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:27:49,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:27:49,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457117078] [2024-10-11 04:27:49,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:49,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:27:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:49,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:27:49,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:27:49,706 INFO L87 Difference]: Start difference. First operand 3693 states and 6514 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:27:50,870 INFO L93 Difference]: Finished difference Result 5891 states and 10195 transitions. [2024-10-11 04:27:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:27:50,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:27:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:27:50,884 INFO L225 Difference]: With dead ends: 5891 [2024-10-11 04:27:50,884 INFO L226 Difference]: Without dead ends: 4336 [2024-10-11 04:27:50,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:27:50,888 INFO L432 NwaCegarLoop]: 4203 mSDtfsCounter, 5113 mSDsluCounter, 12468 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5132 SdHoareTripleChecker+Valid, 16671 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:27:50,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5132 Valid, 16671 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:27:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4336 states. [2024-10-11 04:27:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4336 to 3693. [2024-10-11 04:27:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3550 states have (on average 1.7701408450704226) internal successors, (6284), 3557 states have internal predecessors, (6284), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:27:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 6509 transitions. [2024-10-11 04:27:50,986 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 6509 transitions. Word has length 152 [2024-10-11 04:27:50,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:27:50,986 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 6509 transitions. [2024-10-11 04:27:50,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 6509 transitions. [2024-10-11 04:27:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:27:50,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:50,988 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:27:50,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:27:50,989 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:50,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1697576904, now seen corresponding path program 1 times [2024-10-11 04:27:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675345123] [2024-10-11 04:27:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:51,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:27:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:51,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:27:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:51,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:27:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:51,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:27:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:51,184 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-11 04:27:51,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:51,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675345123] [2024-10-11 04:27:51,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675345123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:51,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:27:51,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:27:51,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770026397] [2024-10-11 04:27:51,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:51,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:27:51,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:51,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:27:51,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:27:51,187 INFO L87 Difference]: Start difference. First operand 3693 states and 6509 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:27:52,456 INFO L93 Difference]: Finished difference Result 5885 states and 10169 transitions. [2024-10-11 04:27:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:27:52,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:27:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:27:52,472 INFO L225 Difference]: With dead ends: 5885 [2024-10-11 04:27:52,473 INFO L226 Difference]: Without dead ends: 4330 [2024-10-11 04:27:52,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:27:52,482 INFO L432 NwaCegarLoop]: 4203 mSDtfsCounter, 5111 mSDsluCounter, 12468 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5130 SdHoareTripleChecker+Valid, 16671 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:27:52,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5130 Valid, 16671 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:27:52,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2024-10-11 04:27:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 3693. [2024-10-11 04:27:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3550 states have (on average 1.7687323943661972) internal successors, (6279), 3557 states have internal predecessors, (6279), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:27:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 6504 transitions. [2024-10-11 04:27:52,590 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 6504 transitions. Word has length 152 [2024-10-11 04:27:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:27:52,591 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 6504 transitions. [2024-10-11 04:27:52,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 6504 transitions. [2024-10-11 04:27:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:27:52,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:52,594 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:27:52,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:27:52,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:52,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1112805254, now seen corresponding path program 1 times [2024-10-11 04:27:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:52,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379822550] [2024-10-11 04:27:52,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:52,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:52,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:27:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:52,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:27:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:27:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:52,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:27:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:52,797 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-11 04:27:52,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:52,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379822550] [2024-10-11 04:27:52,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379822550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:52,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:27:52,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:27:52,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918518291] [2024-10-11 04:27:52,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:52,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:27:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:52,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:27:52,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:27:52,799 INFO L87 Difference]: Start difference. First operand 3693 states and 6504 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:27:54,211 INFO L93 Difference]: Finished difference Result 5878 states and 10141 transitions. [2024-10-11 04:27:54,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:27:54,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:27:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:27:54,223 INFO L225 Difference]: With dead ends: 5878 [2024-10-11 04:27:54,223 INFO L226 Difference]: Without dead ends: 4323 [2024-10-11 04:27:54,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:27:54,230 INFO L432 NwaCegarLoop]: 4203 mSDtfsCounter, 4972 mSDsluCounter, 16586 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4991 SdHoareTripleChecker+Valid, 20789 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:27:54,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4991 Valid, 20789 Invalid, 1803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:27:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2024-10-11 04:27:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 3693. [2024-10-11 04:27:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3550 states have (on average 1.7673239436619719) internal successors, (6274), 3557 states have internal predecessors, (6274), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:27:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 6499 transitions. [2024-10-11 04:27:54,331 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 6499 transitions. Word has length 152 [2024-10-11 04:27:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:27:54,331 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 6499 transitions. [2024-10-11 04:27:54,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:54,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 6499 transitions. [2024-10-11 04:27:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:27:54,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:54,333 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:27:54,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:27:54,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:54,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:54,334 INFO L85 PathProgramCache]: Analyzing trace with hash 678299656, now seen corresponding path program 1 times [2024-10-11 04:27:54,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:54,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092417790] [2024-10-11 04:27:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:54,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:54,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:27:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:27:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:54,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:27:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:54,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:27:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:54,535 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-11 04:27:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:54,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092417790] [2024-10-11 04:27:54,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092417790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:54,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:27:54,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:27:54,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981184712] [2024-10-11 04:27:54,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:54,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:27:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:27:54,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:27:54,537 INFO L87 Difference]: Start difference. First operand 3693 states and 6499 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:27:55,828 INFO L93 Difference]: Finished difference Result 5866 states and 10103 transitions. [2024-10-11 04:27:55,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:27:55,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:27:55,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:27:55,840 INFO L225 Difference]: With dead ends: 5866 [2024-10-11 04:27:55,840 INFO L226 Difference]: Without dead ends: 4311 [2024-10-11 04:27:55,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:27:55,845 INFO L432 NwaCegarLoop]: 4203 mSDtfsCounter, 5111 mSDsluCounter, 12468 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5130 SdHoareTripleChecker+Valid, 16671 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:27:55,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5130 Valid, 16671 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:27:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4311 states. [2024-10-11 04:27:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4311 to 3693. [2024-10-11 04:27:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3550 states have (on average 1.7659154929577465) internal successors, (6269), 3557 states have internal predecessors, (6269), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:27:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 6494 transitions. [2024-10-11 04:27:55,961 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 6494 transitions. Word has length 152 [2024-10-11 04:27:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:27:55,963 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 6494 transitions. [2024-10-11 04:27:55,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 6494 transitions. [2024-10-11 04:27:55,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:27:55,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:55,965 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:27:55,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:27:55,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:55,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:55,966 INFO L85 PathProgramCache]: Analyzing trace with hash -28296950, now seen corresponding path program 1 times [2024-10-11 04:27:55,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:55,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849843704] [2024-10-11 04:27:55,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:55,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:56,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:56,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:27:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:56,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:27:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:56,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:27:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:56,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:27:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:56,172 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-11 04:27:56,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:56,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849843704] [2024-10-11 04:27:56,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849843704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:56,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:27:56,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:27:56,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539393038] [2024-10-11 04:27:56,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:56,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:27:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:27:56,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:27:56,174 INFO L87 Difference]: Start difference. First operand 3693 states and 6494 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:27:58,902 INFO L93 Difference]: Finished difference Result 7494 states and 12734 transitions. [2024-10-11 04:27:58,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:27:58,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:27:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:27:58,917 INFO L225 Difference]: With dead ends: 7494 [2024-10-11 04:27:58,917 INFO L226 Difference]: Without dead ends: 5939 [2024-10-11 04:27:58,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:27:58,922 INFO L432 NwaCegarLoop]: 4410 mSDtfsCounter, 5339 mSDsluCounter, 17339 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5357 SdHoareTripleChecker+Valid, 21749 SdHoareTripleChecker+Invalid, 3407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:27:58,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5357 Valid, 21749 Invalid, 3407 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 04:27:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5939 states. [2024-10-11 04:27:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5939 to 4934. [2024-10-11 04:27:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4934 states, 4683 states have (on average 1.7258167841127483) internal successors, (8082), 4694 states have internal predecessors, (8082), 187 states have call successors, (187), 55 states have call predecessors, (187), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-10-11 04:27:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 8489 transitions. [2024-10-11 04:27:59,158 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 8489 transitions. Word has length 152 [2024-10-11 04:27:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:27:59,159 INFO L471 AbstractCegarLoop]: Abstraction has 4934 states and 8489 transitions. [2024-10-11 04:27:59,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:27:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 8489 transitions. [2024-10-11 04:27:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:27:59,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:59,162 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:27:59,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:27:59,162 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:59,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:59,162 INFO L85 PathProgramCache]: Analyzing trace with hash 918740936, now seen corresponding path program 1 times [2024-10-11 04:27:59,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:59,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785333567] [2024-10-11 04:27:59,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:59,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:27:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:59,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:27:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:59,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:27:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:59,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:27:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:59,385 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-11 04:27:59,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:59,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785333567] [2024-10-11 04:27:59,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785333567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:59,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:27:59,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:27:59,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251961921] [2024-10-11 04:27:59,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:59,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:27:59,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:59,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:27:59,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:27:59,387 INFO L87 Difference]: Start difference. First operand 4934 states and 8489 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:02,269 INFO L93 Difference]: Finished difference Result 11959 states and 20005 transitions. [2024-10-11 04:28:02,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:28:02,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:28:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:02,293 INFO L225 Difference]: With dead ends: 11959 [2024-10-11 04:28:02,293 INFO L226 Difference]: Without dead ends: 9163 [2024-10-11 04:28:02,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:28:02,300 INFO L432 NwaCegarLoop]: 4410 mSDtfsCounter, 5338 mSDsluCounter, 17339 mSDsCounter, 0 mSdLazyCounter, 3329 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5356 SdHoareTripleChecker+Valid, 21749 SdHoareTripleChecker+Invalid, 3394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:02,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5356 Valid, 21749 Invalid, 3394 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3329 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:28:02,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9163 states. [2024-10-11 04:28:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9163 to 7413. [2024-10-11 04:28:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7413 states, 6946 states have (on average 1.6841347538151454) internal successors, (11698), 6965 states have internal predecessors, (11698), 347 states have call successors, (347), 103 states have call predecessors, (347), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-10-11 04:28:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7413 states to 7413 states and 12487 transitions. [2024-10-11 04:28:02,561 INFO L78 Accepts]: Start accepts. Automaton has 7413 states and 12487 transitions. Word has length 152 [2024-10-11 04:28:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:02,562 INFO L471 AbstractCegarLoop]: Abstraction has 7413 states and 12487 transitions. [2024-10-11 04:28:02,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 7413 states and 12487 transitions. [2024-10-11 04:28:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:28:02,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:02,566 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:28:02,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:28:02,566 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:02,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:02,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1780574538, now seen corresponding path program 1 times [2024-10-11 04:28:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:02,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506639353] [2024-10-11 04:28:02,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:02,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:02,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:02,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:02,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:02,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:02,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:02,737 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-11 04:28:02,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506639353] [2024-10-11 04:28:02,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506639353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:02,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:02,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201304648] [2024-10-11 04:28:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:02,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:02,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:02,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:02,740 INFO L87 Difference]: Start difference. First operand 7413 states and 12487 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:05,665 INFO L93 Difference]: Finished difference Result 20880 states and 34589 transitions. [2024-10-11 04:28:05,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:28:05,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:28:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:05,702 INFO L225 Difference]: With dead ends: 20880 [2024-10-11 04:28:05,702 INFO L226 Difference]: Without dead ends: 15605 [2024-10-11 04:28:05,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:28:05,716 INFO L432 NwaCegarLoop]: 4410 mSDtfsCounter, 5337 mSDsluCounter, 17339 mSDsCounter, 0 mSdLazyCounter, 3316 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5355 SdHoareTripleChecker+Valid, 21749 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:05,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5355 Valid, 21749 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3316 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:28:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15605 states. [2024-10-11 04:28:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15605 to 12386. [2024-10-11 04:28:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12386 states, 11487 states have (on average 1.649865064855924) internal successors, (18952), 11522 states have internal predecessors, (18952), 667 states have call successors, (667), 199 states have call predecessors, (667), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-11 04:28:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 20559 transitions. [2024-10-11 04:28:06,217 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 20559 transitions. Word has length 152 [2024-10-11 04:28:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:06,217 INFO L471 AbstractCegarLoop]: Abstraction has 12386 states and 20559 transitions. [2024-10-11 04:28:06,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 20559 transitions. [2024-10-11 04:28:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:28:06,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:06,226 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:28:06,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:28:06,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:06,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash -269834360, now seen corresponding path program 1 times [2024-10-11 04:28:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:06,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091448729] [2024-10-11 04:28:06,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:06,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:06,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:06,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:06,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:06,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:06,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:06,392 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-11 04:28:06,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:06,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091448729] [2024-10-11 04:28:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091448729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:06,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:06,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183671771] [2024-10-11 04:28:06,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:06,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:06,394 INFO L87 Difference]: Start difference. First operand 12386 states and 20559 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:08,288 INFO L93 Difference]: Finished difference Result 26016 states and 43196 transitions. [2024-10-11 04:28:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:28:08,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:28:08,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:08,334 INFO L225 Difference]: With dead ends: 26016 [2024-10-11 04:28:08,334 INFO L226 Difference]: Without dead ends: 15768 [2024-10-11 04:28:08,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:28:08,363 INFO L432 NwaCegarLoop]: 4203 mSDtfsCounter, 4970 mSDsluCounter, 16586 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4989 SdHoareTripleChecker+Valid, 20789 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:08,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4989 Valid, 20789 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:28:08,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15768 states. [2024-10-11 04:28:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15768 to 12386. [2024-10-11 04:28:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12386 states, 11487 states have (on average 1.646992252111082) internal successors, (18919), 11522 states have internal predecessors, (18919), 667 states have call successors, (667), 199 states have call predecessors, (667), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-11 04:28:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 20526 transitions. [2024-10-11 04:28:08,877 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 20526 transitions. Word has length 152 [2024-10-11 04:28:08,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:08,877 INFO L471 AbstractCegarLoop]: Abstraction has 12386 states and 20526 transitions. [2024-10-11 04:28:08,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 20526 transitions. [2024-10-11 04:28:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:28:08,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:08,883 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:28:08,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:28:08,883 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:08,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:08,883 INFO L85 PathProgramCache]: Analyzing trace with hash 218212746, now seen corresponding path program 1 times [2024-10-11 04:28:08,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:08,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720304565] [2024-10-11 04:28:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:08,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:08,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:08,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:09,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:09,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:09,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:09,047 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-11 04:28:09,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:09,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720304565] [2024-10-11 04:28:09,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720304565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:09,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:09,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:09,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191291150] [2024-10-11 04:28:09,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:09,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:09,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:09,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:09,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:09,050 INFO L87 Difference]: Start difference. First operand 12386 states and 20526 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:12,944 INFO L93 Difference]: Finished difference Result 43169 states and 70985 transitions. [2024-10-11 04:28:12,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:28:12,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:28:12,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:13,032 INFO L225 Difference]: With dead ends: 43169 [2024-10-11 04:28:13,032 INFO L226 Difference]: Without dead ends: 32921 [2024-10-11 04:28:13,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:28:13,060 INFO L432 NwaCegarLoop]: 4408 mSDtfsCounter, 5728 mSDsluCounter, 17334 mSDsCounter, 0 mSdLazyCounter, 3268 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5758 SdHoareTripleChecker+Valid, 21742 SdHoareTripleChecker+Invalid, 3336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:13,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5758 Valid, 21742 Invalid, 3336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3268 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 04:28:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32921 states. [2024-10-11 04:28:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32921 to 22332. [2024-10-11 04:28:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22332 states, 20601 states have (on average 1.6233677976797243) internal successors, (33443), 20668 states have internal predecessors, (33443), 1275 states have call successors, (1275), 391 states have call predecessors, (1275), 454 states have return successors, (2066), 1336 states have call predecessors, (2066), 1273 states have call successors, (2066) [2024-10-11 04:28:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22332 states to 22332 states and 36784 transitions. [2024-10-11 04:28:14,489 INFO L78 Accepts]: Start accepts. Automaton has 22332 states and 36784 transitions. Word has length 152 [2024-10-11 04:28:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:14,490 INFO L471 AbstractCegarLoop]: Abstraction has 22332 states and 36784 transitions. [2024-10-11 04:28:14,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 22332 states and 36784 transitions. [2024-10-11 04:28:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:28:14,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:14,500 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:28:14,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:28:14,500 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:14,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:14,501 INFO L85 PathProgramCache]: Analyzing trace with hash -874422456, now seen corresponding path program 1 times [2024-10-11 04:28:14,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:14,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681834075] [2024-10-11 04:28:14,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:14,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:14,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:14,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:14,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:14,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:14,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:14,674 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-11 04:28:14,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:14,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681834075] [2024-10-11 04:28:14,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681834075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:14,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:14,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:14,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830603788] [2024-10-11 04:28:14,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:14,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:14,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:14,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:14,676 INFO L87 Difference]: Start difference. First operand 22332 states and 36784 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:20,012 INFO L93 Difference]: Finished difference Result 82441 states and 135945 transitions. [2024-10-11 04:28:20,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:28:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:28:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:20,197 INFO L225 Difference]: With dead ends: 82441 [2024-10-11 04:28:20,198 INFO L226 Difference]: Without dead ends: 62247 [2024-10-11 04:28:20,256 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-11 04:28:20,257 INFO L432 NwaCegarLoop]: 4407 mSDtfsCounter, 5425 mSDsluCounter, 17331 mSDsCounter, 0 mSdLazyCounter, 3870 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5442 SdHoareTripleChecker+Valid, 21738 SdHoareTripleChecker+Invalid, 3937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:20,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5442 Valid, 21738 Invalid, 3937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3870 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:28:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62247 states. [2024-10-11 04:28:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62247 to 41581. [2024-10-11 04:28:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41581 states, 38218 states have (on average 1.606494322047203) internal successors, (61397), 38349 states have internal predecessors, (61397), 2459 states have call successors, (2459), 775 states have call predecessors, (2459), 902 states have return successors, (4772), 2584 states have call predecessors, (4772), 2457 states have call successors, (4772) [2024-10-11 04:28:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41581 states to 41581 states and 68628 transitions. [2024-10-11 04:28:23,001 INFO L78 Accepts]: Start accepts. Automaton has 41581 states and 68628 transitions. Word has length 152 [2024-10-11 04:28:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:23,001 INFO L471 AbstractCegarLoop]: Abstraction has 41581 states and 68628 transitions. [2024-10-11 04:28:23,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 41581 states and 68628 transitions. [2024-10-11 04:28:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:28:23,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:23,022 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:28:23,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:28:23,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:23,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2138372554, now seen corresponding path program 1 times [2024-10-11 04:28:23,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:23,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565351476] [2024-10-11 04:28:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:23,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:23,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:23,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:23,200 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-11 04:28:23,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:23,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565351476] [2024-10-11 04:28:23,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565351476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:23,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941004508] [2024-10-11 04:28:23,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:23,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:23,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:23,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:23,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:23,202 INFO L87 Difference]: Start difference. First operand 41581 states and 68628 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:31,408 INFO L93 Difference]: Finished difference Result 156502 states and 260123 transitions. [2024-10-11 04:28:31,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:28:31,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2024-10-11 04:28:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:31,783 INFO L225 Difference]: With dead ends: 156502 [2024-10-11 04:28:31,783 INFO L226 Difference]: Without dead ends: 117059 [2024-10-11 04:28:31,895 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-11 04:28:31,896 INFO L432 NwaCegarLoop]: 4408 mSDtfsCounter, 5623 mSDsluCounter, 17334 mSDsCounter, 0 mSdLazyCounter, 3223 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5653 SdHoareTripleChecker+Valid, 21742 SdHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:31,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5653 Valid, 21742 Invalid, 3291 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 3223 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:28:31,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117059 states. [2024-10-11 04:28:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117059 to 80847. [2024-10-11 04:28:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80847 states, 74284 states have (on average 1.5998196112217975) internal successors, (118841), 74543 states have internal predecessors, (118841), 4763 states have call successors, (4763), 1543 states have call predecessors, (4763), 1798 states have return successors, (11578), 5016 states have call predecessors, (11578), 4761 states have call successors, (11578) [2024-10-11 04:28:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80847 states to 80847 states and 135182 transitions. [2024-10-11 04:28:37,502 INFO L78 Accepts]: Start accepts. Automaton has 80847 states and 135182 transitions. Word has length 152 [2024-10-11 04:28:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:37,502 INFO L471 AbstractCegarLoop]: Abstraction has 80847 states and 135182 transitions. [2024-10-11 04:28:37,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 80847 states and 135182 transitions. [2024-10-11 04:28:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 04:28:37,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:37,539 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, 1, 1, 1, 1, 1, 1, 1, 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-11 04:28:37,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:28:37,539 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:37,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash 416369868, now seen corresponding path program 1 times [2024-10-11 04:28:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:37,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875042006] [2024-10-11 04:28:37,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:37,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:37,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:37,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:37,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:37,700 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-11 04:28:37,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:37,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875042006] [2024-10-11 04:28:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875042006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:37,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:37,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:37,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342291359] [2024-10-11 04:28:37,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:37,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:37,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:37,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:37,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:37,703 INFO L87 Difference]: Start difference. First operand 80847 states and 135182 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)