./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_label43+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f02c38ef7caa0913e815c21ae4fcfcf6b07193a4f02fe1bf68067d0ca7ac604d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:57:30,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:57:30,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:57:30,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:57:30,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:57:30,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:57:30,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:57:30,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:57:30,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:57:30,515 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:57:30,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:57:30,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:57:30,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:57:30,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:57:30,517 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:57:30,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:57:30,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:57:30,517 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:57:30,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:57:30,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:57:30,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:57:30,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:57:30,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:57:30,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:57:30,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:57:30,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:57:30,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:57:30,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:57:30,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:57:30,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:57:30,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:57:30,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:57:30,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:57:30,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:57:30,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:57:30,524 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:57:30,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:57:30,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:57:30,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:57:30,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:57:30,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:57:30,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:57:30,525 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f02c38ef7caa0913e815c21ae4fcfcf6b07193a4f02fe1bf68067d0ca7ac604d [2024-10-12 20:57:30,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:57:30,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:57:30,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:57:30,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:57:30,741 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:57:30,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-2.c [2024-10-12 20:57:32,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:57:32,646 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:57:32,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-2.c [2024-10-12 20:57:32,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0deb8fe/feeb365acfb54729bc3056f65ff25199/FLAG8865aae35 [2024-10-12 20:57:32,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0deb8fe/feeb365acfb54729bc3056f65ff25199 [2024-10-12 20:57:32,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:57:32,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:57:32,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:57:32,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:57:32,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:57:32,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:57:32" (1/1) ... [2024-10-12 20:57:32,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127a2936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:32, skipping insertion in model container [2024-10-12 20:57:32,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:57:32" (1/1) ... [2024-10-12 20:57:32,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:57:34,624 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_label43+token_ring.11.cil-2.c[381679,381692] [2024-10-12 20:57:34,645 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_label43+token_ring.11.cil-2.c[383339,383352] [2024-10-12 20:57:34,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:57:34,857 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:57:35,423 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_label43+token_ring.11.cil-2.c[381679,381692] [2024-10-12 20:57:35,427 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_label43+token_ring.11.cil-2.c[383339,383352] [2024-10-12 20:57:35,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:57:35,494 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:57:35,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35 WrapperNode [2024-10-12 20:57:35,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:57:35,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:57:35,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:57:35,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:57:35,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (1/1) ... [2024-10-12 20:57:35,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (1/1) ... [2024-10-12 20:57:35,835 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13173 [2024-10-12 20:57:35,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:57:35,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:57:35,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:57:35,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:57:35,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (1/1) ... [2024-10-12 20:57:35,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (1/1) ... [2024-10-12 20:57:35,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (1/1) ... [2024-10-12 20:57:36,067 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-12 20:57:36,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (1/1) ... [2024-10-12 20:57:36,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (1/1) ... [2024-10-12 20:57:36,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (1/1) ... [2024-10-12 20:57:36,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (1/1) ... [2024-10-12 20:57:36,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (1/1) ... [2024-10-12 20:57:36,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (1/1) ... [2024-10-12 20:57:36,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:57:36,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:57:36,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:57:36,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:57:36,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (1/1) ... [2024-10-12 20:57:36,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:57:36,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:57:36,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:57:36,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:57:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:57:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:57:36,471 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:57:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:57:36,471 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:57:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:57:36,471 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:57:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:57:36,472 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:57:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:57:36,472 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:57:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:57:36,472 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:57:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:57:36,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:57:36,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:57:36,579 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:57:36,580 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:57:42,777 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2024-10-12 20:57:42,778 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:57:42,878 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:57:42,879 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-12 20:57:42,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:57:42 BoogieIcfgContainer [2024-10-12 20:57:42,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:57:42,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:57:42,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:57:42,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:57:42,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:57:32" (1/3) ... [2024-10-12 20:57:42,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55558211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:57:42, skipping insertion in model container [2024-10-12 20:57:42,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:57:35" (2/3) ... [2024-10-12 20:57:42,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55558211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:57:42, skipping insertion in model container [2024-10-12 20:57:42,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:57:42" (3/3) ... [2024-10-12 20:57:42,888 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.11.cil-2.c [2024-10-12 20:57:42,900 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:57:42,900 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:57:42,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:57:42,989 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;@26149f6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:57:42,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:57:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 2448 states, 2414 states have (on average 1.876553438276719) internal successors, (4530), 2417 states have internal predecessors, (4530), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-12 20:57:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:57:43,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:43,041 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] [2024-10-12 20:57:43,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:43,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:43,046 INFO L85 PathProgramCache]: Analyzing trace with hash -259596153, now seen corresponding path program 1 times [2024-10-12 20:57:43,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:43,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629588613] [2024-10-12 20:57:43,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:43,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:57:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:57:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:57:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:57:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:43,635 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-12 20:57:43,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:43,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629588613] [2024-10-12 20:57:43,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629588613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:43,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:43,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:57:43,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701367447] [2024-10-12 20:57:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:43,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:57:43,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:57:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:57:43,671 INFO L87 Difference]: Start difference. First operand has 2448 states, 2414 states have (on average 1.876553438276719) internal successors, (4530), 2417 states have internal predecessors, (4530), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:45,239 INFO L93 Difference]: Finished difference Result 5006 states and 9354 transitions. [2024-10-12 20:57:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:57:45,241 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:57:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:45,267 INFO L225 Difference]: With dead ends: 5006 [2024-10-12 20:57:45,267 INFO L226 Difference]: Without dead ends: 2564 [2024-10-12 20:57:45,281 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-12 20:57:45,288 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 902 mSDsluCounter, 12182 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 16420 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:45,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 16420 Invalid, 1046 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:57:45,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-10-12 20:57:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2444. [2024-10-12 20:57:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2411 states have (on average 1.838241393612609) internal successors, (4432), 2413 states have internal predecessors, (4432), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-12 20:57:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 4482 transitions. [2024-10-12 20:57:45,548 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 4482 transitions. Word has length 151 [2024-10-12 20:57:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:45,549 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 4482 transitions. [2024-10-12 20:57:45,549 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 4482 transitions. [2024-10-12 20:57:45,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:57:45,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:45,555 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] [2024-10-12 20:57:45,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:57:45,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:45,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:45,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1876287049, now seen corresponding path program 1 times [2024-10-12 20:57:45,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:45,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366295184] [2024-10-12 20:57:45,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:45,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:45,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:57:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:45,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:57:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:45,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:57:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:45,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:57:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:45,865 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-12 20:57:45,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366295184] [2024-10-12 20:57:45,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366295184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:45,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:45,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:57:45,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898909596] [2024-10-12 20:57:45,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:45,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:57:45,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:57:45,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:57:45,872 INFO L87 Difference]: Start difference. First operand 2444 states and 4482 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:48,315 INFO L93 Difference]: Finished difference Result 3313 states and 5934 transitions. [2024-10-12 20:57:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:57:48,316 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:57:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:48,325 INFO L225 Difference]: With dead ends: 3313 [2024-10-12 20:57:48,326 INFO L226 Difference]: Without dead ends: 3007 [2024-10-12 20:57:48,327 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-12 20:57:48,328 INFO L432 NwaCegarLoop]: 4252 mSDtfsCounter, 5325 mSDsluCounter, 12699 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5343 SdHoareTripleChecker+Valid, 16951 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:48,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5343 Valid, 16951 Invalid, 2279 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 20:57:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-12 20:57:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2768. [2024-10-12 20:57:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2708 states have (on average 1.8172082717872968) internal successors, (4921), 2711 states have internal predecessors, (4921), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-10-12 20:57:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 5014 transitions. [2024-10-12 20:57:48,385 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 5014 transitions. Word has length 151 [2024-10-12 20:57:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:48,385 INFO L471 AbstractCegarLoop]: Abstraction has 2768 states and 5014 transitions. [2024-10-12 20:57:48,385 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 5014 transitions. [2024-10-12 20:57:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:57:48,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:48,387 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] [2024-10-12 20:57:48,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:57:48,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:48,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:48,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1755061197, now seen corresponding path program 1 times [2024-10-12 20:57:48,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:48,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714358621] [2024-10-12 20:57:48,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:48,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:57:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:57:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:57:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:57:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:48,625 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-12 20:57:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714358621] [2024-10-12 20:57:48,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714358621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:48,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:48,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:48,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40231031] [2024-10-12 20:57:48,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:48,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:48,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:48,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:48,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:48,628 INFO L87 Difference]: Start difference. First operand 2768 states and 5014 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:51,863 INFO L93 Difference]: Finished difference Result 4098 states and 7236 transitions. [2024-10-12 20:57:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:57:51,864 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:57:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:51,876 INFO L225 Difference]: With dead ends: 4098 [2024-10-12 20:57:51,876 INFO L226 Difference]: Without dead ends: 3468 [2024-10-12 20:57:51,879 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-12 20:57:51,880 INFO L432 NwaCegarLoop]: 4390 mSDtfsCounter, 5356 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3461 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5374 SdHoareTripleChecker+Valid, 21646 SdHoareTripleChecker+Invalid, 3520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:51,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5374 Valid, 21646 Invalid, 3520 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 3461 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 20:57:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2024-10-12 20:57:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3067. [2024-10-12 20:57:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 2980 states have (on average 1.7986577181208054) internal successors, (5360), 2984 states have internal predecessors, (5360), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-12 20:57:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 5495 transitions. [2024-10-12 20:57:51,951 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 5495 transitions. Word has length 151 [2024-10-12 20:57:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:51,951 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 5495 transitions. [2024-10-12 20:57:51,951 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 5495 transitions. [2024-10-12 20:57:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:57:51,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:51,953 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] [2024-10-12 20:57:51,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:57:51,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:51,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1864745973, now seen corresponding path program 1 times [2024-10-12 20:57:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:51,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471508059] [2024-10-12 20:57:51,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:52,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:57:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:52,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:57:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:52,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:57:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:52,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:57:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:52,193 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-12 20:57:52,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:52,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471508059] [2024-10-12 20:57:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471508059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:52,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:52,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:52,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716728604] [2024-10-12 20:57:52,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:52,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:52,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:52,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:52,196 INFO L87 Difference]: Start difference. First operand 3067 states and 5495 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:55,599 INFO L93 Difference]: Finished difference Result 5248 states and 9131 transitions. [2024-10-12 20:57:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:57:55,600 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:57:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:55,619 INFO L225 Difference]: With dead ends: 5248 [2024-10-12 20:57:55,619 INFO L226 Difference]: Without dead ends: 4319 [2024-10-12 20:57:55,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:57:55,627 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5354 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3457 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5372 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:55,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5372 Valid, 21644 Invalid, 3518 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3457 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 20:57:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2024-10-12 20:57:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 3666. [2024-10-12 20:57:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7699290780141843) internal successors, (6239), 3531 states have internal predecessors, (6239), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-12 20:57:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6462 transitions. [2024-10-12 20:57:55,823 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6462 transitions. Word has length 151 [2024-10-12 20:57:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:55,823 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6462 transitions. [2024-10-12 20:57:55,824 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6462 transitions. [2024-10-12 20:57:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:57:55,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:55,827 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] [2024-10-12 20:57:55,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:57:55,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:55,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1482169357, now seen corresponding path program 1 times [2024-10-12 20:57:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:55,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661737588] [2024-10-12 20:57:55,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:55,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:57:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:57:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:57:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:57:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:56,116 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-12 20:57:56,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:56,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661737588] [2024-10-12 20:57:56,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661737588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:56,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:56,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:56,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260700475] [2024-10-12 20:57:56,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:56,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:56,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:56,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:56,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:56,123 INFO L87 Difference]: Start difference. First operand 3666 states and 6462 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:58,031 INFO L93 Difference]: Finished difference Result 5837 states and 10091 transitions. [2024-10-12 20:57:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:57:58,032 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:57:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:58,068 INFO L225 Difference]: With dead ends: 5837 [2024-10-12 20:57:58,068 INFO L226 Difference]: Without dead ends: 4309 [2024-10-12 20:57:58,080 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-12 20:57:58,081 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 4957 mSDsluCounter, 16550 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4976 SdHoareTripleChecker+Valid, 20742 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:58,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4976 Valid, 20742 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:57:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2024-10-12 20:57:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 3666. [2024-10-12 20:57:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7685106382978724) internal successors, (6234), 3531 states have internal predecessors, (6234), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-12 20:57:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6457 transitions. [2024-10-12 20:57:58,216 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6457 transitions. Word has length 151 [2024-10-12 20:57:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:58,216 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6457 transitions. [2024-10-12 20:57:58,216 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6457 transitions. [2024-10-12 20:57:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:57:58,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:58,222 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] [2024-10-12 20:57:58,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:57:58,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:58,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash 897397707, now seen corresponding path program 1 times [2024-10-12 20:57:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:58,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997241213] [2024-10-12 20:57:58,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:58,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:58,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:58,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:57:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:58,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:57:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:58,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:57:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:58,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:57:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:58,450 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-12 20:57:58,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:58,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997241213] [2024-10-12 20:57:58,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997241213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:58,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:58,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:58,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449262085] [2024-10-12 20:57:58,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:58,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:58,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:58,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:58,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:58,452 INFO L87 Difference]: Start difference. First operand 3666 states and 6457 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:00,091 INFO L93 Difference]: Finished difference Result 5831 states and 10065 transitions. [2024-10-12 20:58:00,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:58:00,091 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:58:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:00,106 INFO L225 Difference]: With dead ends: 5831 [2024-10-12 20:58:00,107 INFO L226 Difference]: Without dead ends: 4303 [2024-10-12 20:58:00,111 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-12 20:58:00,112 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5096 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5115 SdHoareTripleChecker+Valid, 16633 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:00,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5115 Valid, 16633 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:58:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2024-10-12 20:58:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 3666. [2024-10-12 20:58:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7670921985815602) internal successors, (6229), 3531 states have internal predecessors, (6229), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-12 20:58:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6452 transitions. [2024-10-12 20:58:00,231 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6452 transitions. Word has length 151 [2024-10-12 20:58:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:00,231 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6452 transitions. [2024-10-12 20:58:00,232 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:00,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6452 transitions. [2024-10-12 20:58:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:58:00,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:00,234 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] [2024-10-12 20:58:00,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:58:00,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:00,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash 462892109, now seen corresponding path program 1 times [2024-10-12 20:58:00,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:00,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141152159] [2024-10-12 20:58:00,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:00,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:00,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:00,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:58:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:00,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:58:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:00,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:58:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:00,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:58:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:00,450 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-12 20:58:00,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:00,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141152159] [2024-10-12 20:58:00,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141152159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:00,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:00,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:00,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204984980] [2024-10-12 20:58:00,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:00,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:00,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:00,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:00,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:00,451 INFO L87 Difference]: Start difference. First operand 3666 states and 6452 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:01,775 INFO L93 Difference]: Finished difference Result 5824 states and 10037 transitions. [2024-10-12 20:58:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:58:01,776 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:58:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:01,796 INFO L225 Difference]: With dead ends: 5824 [2024-10-12 20:58:01,800 INFO L226 Difference]: Without dead ends: 4296 [2024-10-12 20:58:01,807 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-12 20:58:01,808 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5100 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5119 SdHoareTripleChecker+Valid, 16633 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:01,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5119 Valid, 16633 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 20:58:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2024-10-12 20:58:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3666. [2024-10-12 20:58:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7656737588652482) internal successors, (6224), 3531 states have internal predecessors, (6224), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-12 20:58:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6447 transitions. [2024-10-12 20:58:01,927 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6447 transitions. Word has length 151 [2024-10-12 20:58:01,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:01,927 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6447 transitions. [2024-10-12 20:58:01,928 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6447 transitions. [2024-10-12 20:58:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:58:01,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:01,931 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] [2024-10-12 20:58:01,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:58:01,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:01,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:01,932 INFO L85 PathProgramCache]: Analyzing trace with hash 33233803, now seen corresponding path program 1 times [2024-10-12 20:58:01,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:01,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412325666] [2024-10-12 20:58:01,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:01,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:02,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:02,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:58:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:02,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:58:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:02,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:58:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:02,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:58:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:02,202 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-12 20:58:02,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:02,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412325666] [2024-10-12 20:58:02,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412325666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:02,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:02,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:02,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80514759] [2024-10-12 20:58:02,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:02,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:02,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:02,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:02,204 INFO L87 Difference]: Start difference. First operand 3666 states and 6447 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:03,717 INFO L93 Difference]: Finished difference Result 5812 states and 9999 transitions. [2024-10-12 20:58:03,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:58:03,718 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:58:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:03,745 INFO L225 Difference]: With dead ends: 5812 [2024-10-12 20:58:03,745 INFO L226 Difference]: Without dead ends: 4284 [2024-10-12 20:58:03,753 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-12 20:58:03,757 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5096 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5115 SdHoareTripleChecker+Valid, 16633 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:03,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5115 Valid, 16633 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:58:03,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2024-10-12 20:58:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 3666. [2024-10-12 20:58:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.764255319148936) internal successors, (6219), 3531 states have internal predecessors, (6219), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-12 20:58:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6442 transitions. [2024-10-12 20:58:03,893 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6442 transitions. Word has length 151 [2024-10-12 20:58:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:03,895 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6442 transitions. [2024-10-12 20:58:03,895 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:03,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6442 transitions. [2024-10-12 20:58:03,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:58:03,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:03,898 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] [2024-10-12 20:58:03,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:58:03,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:03,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash 980271689, now seen corresponding path program 1 times [2024-10-12 20:58:03,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654546351] [2024-10-12 20:58:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:04,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:58:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:04,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:58:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:04,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:58:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:04,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:58:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:04,131 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-12 20:58:04,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:04,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654546351] [2024-10-12 20:58:04,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654546351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:04,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:04,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:04,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068359747] [2024-10-12 20:58:04,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:04,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:04,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:04,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:04,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:04,134 INFO L87 Difference]: Start difference. First operand 3666 states and 6442 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:07,145 INFO L93 Difference]: Finished difference Result 7418 states and 12588 transitions. [2024-10-12 20:58:07,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:58:07,148 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:58:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:07,162 INFO L225 Difference]: With dead ends: 7418 [2024-10-12 20:58:07,162 INFO L226 Difference]: Without dead ends: 5890 [2024-10-12 20:58:07,168 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-12 20:58:07,168 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5325 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3327 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5343 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:07,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5343 Valid, 21644 Invalid, 3388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3327 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 20:58:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5890 states. [2024-10-12 20:58:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5890 to 4887. [2024-10-12 20:58:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4638 states have (on average 1.7231565329883571) internal successors, (7992), 4648 states have internal predecessors, (7992), 185 states have call successors, (185), 54 states have call predecessors, (185), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-10-12 20:58:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 8397 transitions. [2024-10-12 20:58:07,352 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 8397 transitions. Word has length 151 [2024-10-12 20:58:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:07,352 INFO L471 AbstractCegarLoop]: Abstraction has 4887 states and 8397 transitions. [2024-10-12 20:58:07,353 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 8397 transitions. [2024-10-12 20:58:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:58:07,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:07,355 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] [2024-10-12 20:58:07,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:58:07,355 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:07,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1842105291, now seen corresponding path program 1 times [2024-10-12 20:58:07,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:07,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312211573] [2024-10-12 20:58:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:07,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:07,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:58:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:07,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:58:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:07,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:58:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:07,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:58:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:07,561 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-12 20:58:07,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:07,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312211573] [2024-10-12 20:58:07,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312211573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:07,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:07,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:07,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378483949] [2024-10-12 20:58:07,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:07,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:07,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:07,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:07,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:07,563 INFO L87 Difference]: Start difference. First operand 4887 states and 8397 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:10,851 INFO L93 Difference]: Finished difference Result 11823 states and 19739 transitions. [2024-10-12 20:58:10,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:58:10,852 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:58:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:10,872 INFO L225 Difference]: With dead ends: 11823 [2024-10-12 20:58:10,872 INFO L226 Difference]: Without dead ends: 9074 [2024-10-12 20:58:10,880 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-12 20:58:10,881 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5324 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5342 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:10,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5342 Valid, 21644 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 20:58:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9074 states. [2024-10-12 20:58:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9074 to 7326. [2024-10-12 20:58:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7326 states, 6861 states have (on average 1.6802215420492639) internal successors, (11528), 6879 states have internal predecessors, (11528), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-10-12 20:58:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 12315 transitions. [2024-10-12 20:58:11,216 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 12315 transitions. Word has length 151 [2024-10-12 20:58:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:11,216 INFO L471 AbstractCegarLoop]: Abstraction has 7326 states and 12315 transitions. [2024-10-12 20:58:11,216 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 12315 transitions. [2024-10-12 20:58:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:58:11,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:11,220 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] [2024-10-12 20:58:11,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:58:11,220 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:11,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:11,220 INFO L85 PathProgramCache]: Analyzing trace with hash -208303607, now seen corresponding path program 1 times [2024-10-12 20:58:11,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:11,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358806749] [2024-10-12 20:58:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:11,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:11,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:11,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:58:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:11,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:58:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:58:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:11,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:58:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:11,386 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-12 20:58:11,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:11,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358806749] [2024-10-12 20:58:11,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358806749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:11,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:11,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138813081] [2024-10-12 20:58:11,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:11,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:11,388 INFO L87 Difference]: Start difference. First operand 7326 states and 12315 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:14,751 INFO L93 Difference]: Finished difference Result 20624 states and 34083 transitions. [2024-10-12 20:58:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:58:14,751 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:58:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:14,795 INFO L225 Difference]: With dead ends: 20624 [2024-10-12 20:58:14,795 INFO L226 Difference]: Without dead ends: 15436 [2024-10-12 20:58:14,811 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-12 20:58:14,812 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5323 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3301 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5341 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:14,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5341 Valid, 21644 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3301 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 20:58:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15436 states. [2024-10-12 20:58:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15436 to 12219. [2024-10-12 20:58:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12219 states, 11322 states have (on average 1.6447624094682918) internal successors, (18622), 11356 states have internal predecessors, (18622), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-12 20:58:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12219 states to 12219 states and 20227 transitions. [2024-10-12 20:58:15,399 INFO L78 Accepts]: Start accepts. Automaton has 12219 states and 20227 transitions. Word has length 151 [2024-10-12 20:58:15,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:15,399 INFO L471 AbstractCegarLoop]: Abstraction has 12219 states and 20227 transitions. [2024-10-12 20:58:15,400 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 12219 states and 20227 transitions. [2024-10-12 20:58:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:58:15,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:15,407 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] [2024-10-12 20:58:15,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:58:15,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:15,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:15,408 INFO L85 PathProgramCache]: Analyzing trace with hash 279743499, now seen corresponding path program 1 times [2024-10-12 20:58:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:15,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746803584] [2024-10-12 20:58:15,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:15,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:15,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:58:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:15,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:58:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:15,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:58:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:15,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:58:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:15,608 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-12 20:58:15,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:15,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746803584] [2024-10-12 20:58:15,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746803584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:15,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:15,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:15,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804077369] [2024-10-12 20:58:15,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:15,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:15,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:15,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:15,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:15,610 INFO L87 Difference]: Start difference. First operand 12219 states and 20227 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:17,906 INFO L93 Difference]: Finished difference Result 25682 states and 42532 transitions. [2024-10-12 20:58:17,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:58:17,906 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:58:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:17,946 INFO L225 Difference]: With dead ends: 25682 [2024-10-12 20:58:17,946 INFO L226 Difference]: Without dead ends: 15601 [2024-10-12 20:58:17,976 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-12 20:58:17,977 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 4956 mSDsluCounter, 16550 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4975 SdHoareTripleChecker+Valid, 20742 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:17,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4975 Valid, 20742 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:58:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15601 states. [2024-10-12 20:58:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15601 to 12219. [2024-10-12 20:58:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12219 states, 11322 states have (on average 1.641847730083024) internal successors, (18589), 11356 states have internal predecessors, (18589), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-12 20:58:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12219 states to 12219 states and 20194 transitions. [2024-10-12 20:58:18,670 INFO L78 Accepts]: Start accepts. Automaton has 12219 states and 20194 transitions. Word has length 151 [2024-10-12 20:58:18,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:18,671 INFO L471 AbstractCegarLoop]: Abstraction has 12219 states and 20194 transitions. [2024-10-12 20:58:18,671 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:18,671 INFO L276 IsEmpty]: Start isEmpty. Operand 12219 states and 20194 transitions. [2024-10-12 20:58:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:58:18,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:18,676 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] [2024-10-12 20:58:18,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:58:18,677 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:18,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:18,677 INFO L85 PathProgramCache]: Analyzing trace with hash -812891703, now seen corresponding path program 1 times [2024-10-12 20:58:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:18,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118791013] [2024-10-12 20:58:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:18,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:18,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:18,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:58:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:18,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:58:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:58:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:18,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:58:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:18,841 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-12 20:58:18,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:18,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118791013] [2024-10-12 20:58:18,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118791013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:18,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:18,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:18,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650441588] [2024-10-12 20:58:18,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:18,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:18,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:18,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:18,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:18,844 INFO L87 Difference]: Start difference. First operand 12219 states and 20194 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:23,161 INFO L93 Difference]: Finished difference Result 42673 states and 69999 transitions. [2024-10-12 20:58:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:58:23,164 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:58:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:23,360 INFO L225 Difference]: With dead ends: 42673 [2024-10-12 20:58:23,360 INFO L226 Difference]: Without dead ends: 32592 [2024-10-12 20:58:23,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:58:23,427 INFO L432 NwaCegarLoop]: 4386 mSDtfsCounter, 5714 mSDsluCounter, 17251 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5744 SdHoareTripleChecker+Valid, 21637 SdHoareTripleChecker+Invalid, 3317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:23,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5744 Valid, 21637 Invalid, 3317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3253 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 20:58:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32592 states. [2024-10-12 20:58:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32592 to 22005. [2024-10-12 20:58:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22005 states, 20276 states have (on average 1.617330834484119) internal successors, (32793), 20342 states have internal predecessors, (32793), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 454 states have return successors, (2066), 1336 states have call predecessors, (2066), 1273 states have call successors, (2066) [2024-10-12 20:58:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22005 states to 22005 states and 36132 transitions. [2024-10-12 20:58:25,108 INFO L78 Accepts]: Start accepts. Automaton has 22005 states and 36132 transitions. Word has length 151 [2024-10-12 20:58:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:25,108 INFO L471 AbstractCegarLoop]: Abstraction has 22005 states and 36132 transitions. [2024-10-12 20:58:25,109 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 22005 states and 36132 transitions. [2024-10-12 20:58:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:58:25,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:25,118 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] [2024-10-12 20:58:25,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:58:25,119 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:25,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:25,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2095063989, now seen corresponding path program 1 times [2024-10-12 20:58:25,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:25,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353810295] [2024-10-12 20:58:25,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:25,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:25,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:25,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:58:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:58:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:25,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:58:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:25,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:58:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:25,323 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-12 20:58:25,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353810295] [2024-10-12 20:58:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353810295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:25,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:25,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:25,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308119918] [2024-10-12 20:58:25,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:25,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:25,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:25,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:25,325 INFO L87 Difference]: Start difference. First operand 22005 states and 36132 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:31,294 INFO L93 Difference]: Finished difference Result 81465 states and 133999 transitions. [2024-10-12 20:58:31,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:58:31,295 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:58:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:31,473 INFO L225 Difference]: With dead ends: 81465 [2024-10-12 20:58:31,473 INFO L226 Difference]: Without dead ends: 61598 [2024-10-12 20:58:31,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:58:31,527 INFO L432 NwaCegarLoop]: 4385 mSDtfsCounter, 5411 mSDsluCounter, 17248 mSDsCounter, 0 mSdLazyCounter, 3855 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5428 SdHoareTripleChecker+Valid, 21633 SdHoareTripleChecker+Invalid, 3918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:31,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5428 Valid, 21633 Invalid, 3918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3855 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 20:58:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61598 states. [2024-10-12 20:58:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61598 to 41254. [2024-10-12 20:58:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41254 states, 37893 states have (on average 1.603119309635025) internal successors, (60747), 38023 states have internal predecessors, (60747), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 902 states have return successors, (4772), 2584 states have call predecessors, (4772), 2457 states have call successors, (4772) [2024-10-12 20:58:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41254 states to 41254 states and 67976 transitions. [2024-10-12 20:58:34,468 INFO L78 Accepts]: Start accepts. Automaton has 41254 states and 67976 transitions. Word has length 151 [2024-10-12 20:58:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:34,469 INFO L471 AbstractCegarLoop]: Abstraction has 41254 states and 67976 transitions. [2024-10-12 20:58:34,469 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 41254 states and 67976 transitions. [2024-10-12 20:58:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:58:34,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:34,485 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] [2024-10-12 20:58:34,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:58:34,485 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:34,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash 357427593, now seen corresponding path program 1 times [2024-10-12 20:58:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535273736] [2024-10-12 20:58:34,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:34,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:34,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:34,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:58:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:34,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:58:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:34,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:58:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:34,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:58:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:34,721 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-12 20:58:34,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:34,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535273736] [2024-10-12 20:58:34,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535273736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:34,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:34,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:34,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624947691] [2024-10-12 20:58:34,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:34,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:34,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:34,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:34,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:34,723 INFO L87 Difference]: Start difference. First operand 41254 states and 67976 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:58:43,725 INFO L93 Difference]: Finished difference Result 155526 states and 258177 transitions. [2024-10-12 20:58:43,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:58:43,726 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 151 [2024-10-12 20:58:43,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:58:44,365 INFO L225 Difference]: With dead ends: 155526 [2024-10-12 20:58:44,365 INFO L226 Difference]: Without dead ends: 116410 [2024-10-12 20:58:44,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:58:44,490 INFO L432 NwaCegarLoop]: 4386 mSDtfsCounter, 5609 mSDsluCounter, 17251 mSDsCounter, 0 mSdLazyCounter, 3208 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5639 SdHoareTripleChecker+Valid, 21637 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:58:44,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5639 Valid, 21637 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3208 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 20:58:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116410 states. [2024-10-12 20:58:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116410 to 80200. [2024-10-12 20:58:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80200 states, 73639 states have (on average 1.5963144529393392) internal successors, (117551), 73897 states have internal predecessors, (117551), 4761 states have call successors, (4761), 1542 states have call predecessors, (4761), 1798 states have return successors, (11578), 5016 states have call predecessors, (11578), 4761 states have call successors, (11578) [2024-10-12 20:58:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80200 states to 80200 states and 133890 transitions. [2024-10-12 20:58:51,167 INFO L78 Accepts]: Start accepts. Automaton has 80200 states and 133890 transitions. Word has length 151 [2024-10-12 20:58:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:58:51,167 INFO L471 AbstractCegarLoop]: Abstraction has 80200 states and 133890 transitions. [2024-10-12 20:58:51,167 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:58:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 80200 states and 133890 transitions. [2024-10-12 20:58:51,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:58:51,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:58:51,239 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] [2024-10-12 20:58:51,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:58:51,240 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:58:51,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:58:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash 24784455, now seen corresponding path program 1 times [2024-10-12 20:58:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:58:51,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173635372] [2024-10-12 20:58:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:58:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:58:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:51,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:58:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:51,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 20:58:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 20:58:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 20:58:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:51,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-12 20:58:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:58:51,473 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-12 20:58:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:58:51,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173635372] [2024-10-12 20:58:51,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173635372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:58:51,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:58:51,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:58:51,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043822191] [2024-10-12 20:58:51,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:58:51,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:58:51,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:58:51,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:58:51,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:58:51,476 INFO L87 Difference]: Start difference. First operand 80200 states and 133890 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)