./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem13_label40.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '5822f6dcecb89719be961a38493299a8716c4a47f733fff54adb51e7e48a109b'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label40.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5822f6dcecb89719be961a38493299a8716c4a47f733fff54adb51e7e48a109b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:49:52,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:49:52,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:49:52,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:49:52,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:49:52,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:49:52,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:49:52,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:49:52,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:49:52,211 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:49:52,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:49:52,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:49:52,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:49:52,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:49:52,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:49:52,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:49:52,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:49:52,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:49:52,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:49:52,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:49:52,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:49:52,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:49:52,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:49:52,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:49:52,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:49:52,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:49:52,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:49:52,217 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 5822f6dcecb89719be961a38493299a8716c4a47f733fff54adb51e7e48a109b [2024-11-06 19:49:52,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:49:52,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:49:52,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:49:52,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:49:52,449 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:49:52,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label40.c [2024-11-06 19:49:53,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:49:53,996 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:49:53,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c [2024-11-06 19:49:54,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb4e28b5b/3018621c4ba343c19672b0b23090655b/FLAGb91ea5f0f [2024-11-06 19:49:54,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb4e28b5b/3018621c4ba343c19672b0b23090655b [2024-11-06 19:49:54,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:49:54,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:49:54,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:49:54,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:49:54,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:49:54,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:54" (1/1) ... [2024-11-06 19:49:54,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@687b4e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:54, skipping insertion in model container [2024-11-06 19:49:54,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:54" (1/1) ... [2024-11-06 19:49:54,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:49:54,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c[4201,4214] [2024-11-06 19:49:54,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:49:54,849 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:49:54,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c[4201,4214] [2024-11-06 19:49:55,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:49:55,182 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:49:55,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55 WrapperNode [2024-11-06 19:49:55,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:49:55,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:49:55,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:49:55,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:49:55,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (1/1) ... [2024-11-06 19:49:55,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (1/1) ... [2024-11-06 19:49:55,919 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-06 19:49:55,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:49:55,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:49:55,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:49:55,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:49:55,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (1/1) ... [2024-11-06 19:49:55,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (1/1) ... [2024-11-06 19:49:56,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (1/1) ... [2024-11-06 19:49:56,248 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-11-06 19:49:56,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (1/1) ... [2024-11-06 19:49:56,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (1/1) ... [2024-11-06 19:49:56,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (1/1) ... [2024-11-06 19:49:56,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (1/1) ... [2024-11-06 19:49:56,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (1/1) ... [2024-11-06 19:49:56,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (1/1) ... [2024-11-06 19:49:56,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:49:56,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:49:56,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:49:56,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:49:56,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (1/1) ... [2024-11-06 19:49:56,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:49:56,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:49:56,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 19:49:56,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 19:49:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:49:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:49:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:49:56,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:49:56,673 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:49:56,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:50:01,003 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-06 19:50:01,004 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:50:01,024 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:50:01,024 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:50:01,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:50:01 BoogieIcfgContainer [2024-11-06 19:50:01,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:50:01,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:50:01,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:50:01,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:50:01,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:49:54" (1/3) ... [2024-11-06 19:50:01,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36420e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:50:01, skipping insertion in model container [2024-11-06 19:50:01,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:55" (2/3) ... [2024-11-06 19:50:01,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36420e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:50:01, skipping insertion in model container [2024-11-06 19:50:01,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:50:01" (3/3) ... [2024-11-06 19:50:01,031 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label40.c [2024-11-06 19:50:01,040 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:50:01,040 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:50:01,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:50:01,098 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;@17d95218, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:50:01,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:50:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-06 19:50:01,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:01,114 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] [2024-11-06 19:50:01,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:01,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash -716875070, now seen corresponding path program 1 times [2024-11-06 19:50:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:01,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720320585] [2024-11-06 19:50:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:01,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:50:01,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:01,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720320585] [2024-11-06 19:50:01,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720320585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:01,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:01,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:50:01,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576947773] [2024-11-06 19:50:01,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:01,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:01,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:01,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:01,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:01,408 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:04,671 INFO L93 Difference]: Finished difference Result 3147 states and 5806 transitions. [2024-11-06 19:50:04,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:04,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-06 19:50:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:04,687 INFO L225 Difference]: With dead ends: 3147 [2024-11-06 19:50:04,688 INFO L226 Difference]: Without dead ends: 1964 [2024-11-06 19:50:04,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:04,736 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 1151 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:04,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 992 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-06 19:50:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-11-06 19:50:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2024-11-06 19:50:04,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2024-11-06 19:50:04,878 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 28 [2024-11-06 19:50:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:04,879 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2024-11-06 19:50:04,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2024-11-06 19:50:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-06 19:50:04,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:04,884 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:50:04,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:50:04,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:04,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:04,886 INFO L85 PathProgramCache]: Analyzing trace with hash 215513083, now seen corresponding path program 1 times [2024-11-06 19:50:04,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:04,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250844468] [2024-11-06 19:50:04,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:04,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:50:05,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250844468] [2024-11-06 19:50:05,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250844468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:05,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:05,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:50:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698314547] [2024-11-06 19:50:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:05,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:05,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:05,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:05,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:05,206 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:08,704 INFO L93 Difference]: Finished difference Result 5542 states and 9222 transitions. [2024-11-06 19:50:08,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:08,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-06 19:50:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:08,714 INFO L225 Difference]: With dead ends: 5542 [2024-11-06 19:50:08,714 INFO L226 Difference]: Without dead ends: 3593 [2024-11-06 19:50:08,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:08,716 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 924 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:08,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1009 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-06 19:50:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2024-11-06 19:50:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3581. [2024-11-06 19:50:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2024-11-06 19:50:08,757 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 99 [2024-11-06 19:50:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:08,758 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2024-11-06 19:50:08,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2024-11-06 19:50:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-06 19:50:08,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:08,759 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:50:08,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:50:08,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:08,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1129801848, now seen corresponding path program 1 times [2024-11-06 19:50:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:08,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505044662] [2024-11-06 19:50:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:08,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:50:08,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:08,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505044662] [2024-11-06 19:50:08,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505044662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:08,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:08,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:50:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132063115] [2024-11-06 19:50:08,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:08,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:08,888 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:11,989 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2024-11-06 19:50:11,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:11,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-06 19:50:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:12,009 INFO L225 Difference]: With dead ends: 10352 [2024-11-06 19:50:12,009 INFO L226 Difference]: Without dead ends: 6773 [2024-11-06 19:50:12,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:12,013 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 786 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:12,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1171 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:50:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2024-11-06 19:50:12,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2024-11-06 19:50:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6749 states, 6748 states have (on average 1.3255779490219324) internal successors, (8945), 6748 states have internal predecessors, (8945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 8945 transitions. [2024-11-06 19:50:12,101 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 8945 transitions. Word has length 113 [2024-11-06 19:50:12,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:12,102 INFO L471 AbstractCegarLoop]: Abstraction has 6749 states and 8945 transitions. [2024-11-06 19:50:12,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 8945 transitions. [2024-11-06 19:50:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-06 19:50:12,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:12,106 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:50:12,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:50:12,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:12,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1928986802, now seen corresponding path program 1 times [2024-11-06 19:50:12,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:12,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952640314] [2024-11-06 19:50:12,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:12,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:50:12,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:12,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952640314] [2024-11-06 19:50:12,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952640314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:12,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:50:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157904977] [2024-11-06 19:50:12,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:12,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:12,309 INFO L87 Difference]: Start difference. First operand 6749 states and 8945 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:15,172 INFO L93 Difference]: Finished difference Result 19804 states and 26226 transitions. [2024-11-06 19:50:15,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:15,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2024-11-06 19:50:15,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:15,207 INFO L225 Difference]: With dead ends: 19804 [2024-11-06 19:50:15,207 INFO L226 Difference]: Without dead ends: 13057 [2024-11-06 19:50:15,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:15,218 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 865 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:15,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1035 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:50:15,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13057 states. [2024-11-06 19:50:15,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13057 to 13052. [2024-11-06 19:50:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13052 states, 13051 states have (on average 1.2182208259903455) internal successors, (15899), 13051 states have internal predecessors, (15899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13052 states to 13052 states and 15899 transitions. [2024-11-06 19:50:15,372 INFO L78 Accepts]: Start accepts. Automaton has 13052 states and 15899 transitions. Word has length 142 [2024-11-06 19:50:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:15,373 INFO L471 AbstractCegarLoop]: Abstraction has 13052 states and 15899 transitions. [2024-11-06 19:50:15,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 13052 states and 15899 transitions. [2024-11-06 19:50:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-06 19:50:15,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:15,374 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:50:15,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:50:15,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:15,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:15,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1888751763, now seen corresponding path program 1 times [2024-11-06 19:50:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:15,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334442681] [2024-11-06 19:50:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:15,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:50:15,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334442681] [2024-11-06 19:50:15,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334442681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:15,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:15,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:50:15,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087560685] [2024-11-06 19:50:15,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:15,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:50:15,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:15,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:50:15,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:50:15,569 INFO L87 Difference]: Start difference. First operand 13052 states and 15899 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:22,900 INFO L93 Difference]: Finished difference Result 47613 states and 58541 transitions. [2024-11-06 19:50:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:50:22,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2024-11-06 19:50:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:22,957 INFO L225 Difference]: With dead ends: 47613 [2024-11-06 19:50:22,957 INFO L226 Difference]: Without dead ends: 34563 [2024-11-06 19:50:22,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:50:22,969 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 1651 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 7510 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 8112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 7510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:22,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 1300 Invalid, 8112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 7510 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-06 19:50:22,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34563 states. [2024-11-06 19:50:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34563 to 34360. [2024-11-06 19:50:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34360 states, 34359 states have (on average 1.1786431502663057) internal successors, (40497), 34359 states have internal predecessors, (40497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34360 states to 34360 states and 40497 transitions. [2024-11-06 19:50:23,481 INFO L78 Accepts]: Start accepts. Automaton has 34360 states and 40497 transitions. Word has length 153 [2024-11-06 19:50:23,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:23,481 INFO L471 AbstractCegarLoop]: Abstraction has 34360 states and 40497 transitions. [2024-11-06 19:50:23,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 34360 states and 40497 transitions. [2024-11-06 19:50:23,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-06 19:50:23,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:23,484 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:50:23,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:50:23,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:23,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash 245627492, now seen corresponding path program 1 times [2024-11-06 19:50:23,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:23,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201451562] [2024-11-06 19:50:23,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 19:50:23,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:23,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201451562] [2024-11-06 19:50:23,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201451562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:23,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:23,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:50:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248431630] [2024-11-06 19:50:23,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:23,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:23,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:23,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:23,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:23,749 INFO L87 Difference]: Start difference. First operand 34360 states and 40497 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:26,336 INFO L93 Difference]: Finished difference Result 69505 states and 81794 transitions. [2024-11-06 19:50:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:26,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2024-11-06 19:50:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:26,378 INFO L225 Difference]: With dead ends: 69505 [2024-11-06 19:50:26,379 INFO L226 Difference]: Without dead ends: 35147 [2024-11-06 19:50:26,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:26,401 INFO L432 NwaCegarLoop]: 1083 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:26,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1212 Invalid, 2529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:50:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35147 states. [2024-11-06 19:50:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35147 to 35147. [2024-11-06 19:50:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35147 states, 35146 states have (on average 1.1747851818130086) internal successors, (41289), 35146 states have internal predecessors, (41289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35147 states to 35147 states and 41289 transitions. [2024-11-06 19:50:26,781 INFO L78 Accepts]: Start accepts. Automaton has 35147 states and 41289 transitions. Word has length 218 [2024-11-06 19:50:26,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:26,781 INFO L471 AbstractCegarLoop]: Abstraction has 35147 states and 41289 transitions. [2024-11-06 19:50:26,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 35147 states and 41289 transitions. [2024-11-06 19:50:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-06 19:50:26,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:26,786 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:50:26,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:50:26,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:26,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:26,787 INFO L85 PathProgramCache]: Analyzing trace with hash 518295855, now seen corresponding path program 1 times [2024-11-06 19:50:26,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:26,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923567715] [2024-11-06 19:50:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:26,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:50:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:26,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923567715] [2024-11-06 19:50:26,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923567715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:26,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:26,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:50:26,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140260179] [2024-11-06 19:50:26,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:26,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:50:26,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:26,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:50:26,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:50:26,992 INFO L87 Difference]: Start difference. First operand 35147 states and 41289 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:33,268 INFO L93 Difference]: Finished difference Result 94992 states and 112854 transitions. [2024-11-06 19:50:33,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:50:33,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-06 19:50:33,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:33,324 INFO L225 Difference]: With dead ends: 94992 [2024-11-06 19:50:33,324 INFO L226 Difference]: Without dead ends: 60634 [2024-11-06 19:50:33,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:50:33,340 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 1724 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 6854 mSolverCounterSat, 1090 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 7944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1090 IncrementalHoareTripleChecker+Valid, 6854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:33,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 884 Invalid, 7944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1090 Valid, 6854 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-06 19:50:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60634 states. [2024-11-06 19:50:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60634 to 60455. [2024-11-06 19:50:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60455 states, 60454 states have (on average 1.1679624177060244) internal successors, (70608), 60454 states have internal predecessors, (70608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60455 states to 60455 states and 70608 transitions. [2024-11-06 19:50:33,877 INFO L78 Accepts]: Start accepts. Automaton has 60455 states and 70608 transitions. Word has length 225 [2024-11-06 19:50:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:33,877 INFO L471 AbstractCegarLoop]: Abstraction has 60455 states and 70608 transitions. [2024-11-06 19:50:33,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 60455 states and 70608 transitions. [2024-11-06 19:50:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-06 19:50:33,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:33,879 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:50:33,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:50:33,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:33,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1054166602, now seen corresponding path program 1 times [2024-11-06 19:50:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:33,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701241434] [2024-11-06 19:50:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:33,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:50:34,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701241434] [2024-11-06 19:50:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701241434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:34,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:34,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:50:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655725618] [2024-11-06 19:50:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:34,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:34,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:34,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:34,304 INFO L87 Difference]: Start difference. First operand 60455 states and 70608 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:38,351 INFO L93 Difference]: Finished difference Result 146103 states and 173484 transitions. [2024-11-06 19:50:38,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:38,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2024-11-06 19:50:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:38,446 INFO L225 Difference]: With dead ends: 146103 [2024-11-06 19:50:38,446 INFO L226 Difference]: Without dead ends: 86437 [2024-11-06 19:50:38,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:38,494 INFO L432 NwaCegarLoop]: 964 mSDtfsCounter, 811 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:38,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1083 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-06 19:50:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86437 states. [2024-11-06 19:50:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86437 to 84851. [2024-11-06 19:50:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84851 states, 84850 states have (on average 1.1580907483794933) internal successors, (98264), 84850 states have internal predecessors, (98264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84851 states to 84851 states and 98264 transitions. [2024-11-06 19:50:39,458 INFO L78 Accepts]: Start accepts. Automaton has 84851 states and 98264 transitions. Word has length 235 [2024-11-06 19:50:39,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:39,458 INFO L471 AbstractCegarLoop]: Abstraction has 84851 states and 98264 transitions. [2024-11-06 19:50:39,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 84851 states and 98264 transitions. [2024-11-06 19:50:39,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-06 19:50:39,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:39,460 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:50:39,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:50:39,460 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:39,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash 945283299, now seen corresponding path program 1 times [2024-11-06 19:50:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:39,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125677115] [2024-11-06 19:50:39,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:39,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:50:39,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:39,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125677115] [2024-11-06 19:50:39,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125677115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:39,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:39,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:50:39,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121976086] [2024-11-06 19:50:39,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:39,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:39,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:39,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:39,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:39,552 INFO L87 Difference]: Start difference. First operand 84851 states and 98264 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:42,815 INFO L93 Difference]: Finished difference Result 166365 states and 192910 transitions. [2024-11-06 19:50:42,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:42,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2024-11-06 19:50:42,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:42,909 INFO L225 Difference]: With dead ends: 166365 [2024-11-06 19:50:42,909 INFO L226 Difference]: Without dead ends: 82303 [2024-11-06 19:50:42,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:42,949 INFO L432 NwaCegarLoop]: 1512 mSDtfsCounter, 1036 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:42,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1648 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:50:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82303 states. [2024-11-06 19:50:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82303 to 75995. [2024-11-06 19:50:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75995 states, 75994 states have (on average 1.1166802642313867) internal successors, (84861), 75994 states have internal predecessors, (84861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75995 states to 75995 states and 84861 transitions. [2024-11-06 19:50:43,791 INFO L78 Accepts]: Start accepts. Automaton has 75995 states and 84861 transitions. Word has length 242 [2024-11-06 19:50:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:43,791 INFO L471 AbstractCegarLoop]: Abstraction has 75995 states and 84861 transitions. [2024-11-06 19:50:43,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 75995 states and 84861 transitions. [2024-11-06 19:50:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-06 19:50:43,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:43,794 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:50:43,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:50:43,795 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:43,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:43,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1755959963, now seen corresponding path program 1 times [2024-11-06 19:50:43,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:43,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761186158] [2024-11-06 19:50:43,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:43,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-06 19:50:44,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:44,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761186158] [2024-11-06 19:50:44,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761186158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:44,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:44,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:50:44,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732163150] [2024-11-06 19:50:44,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:44,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:44,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:44,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:44,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:44,038 INFO L87 Difference]: Start difference. First operand 75995 states and 84861 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:47,125 INFO L93 Difference]: Finished difference Result 153566 states and 171314 transitions. [2024-11-06 19:50:47,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:47,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 314 [2024-11-06 19:50:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:47,357 INFO L225 Difference]: With dead ends: 153566 [2024-11-06 19:50:47,357 INFO L226 Difference]: Without dead ends: 78360 [2024-11-06 19:50:47,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:47,382 INFO L432 NwaCegarLoop]: 1391 mSDtfsCounter, 939 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:47,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1477 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:50:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78360 states. [2024-11-06 19:50:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78360 to 75988. [2024-11-06 19:50:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75988 states, 75987 states have (on average 1.0957400607998737) internal successors, (83262), 75987 states have internal predecessors, (83262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75988 states to 75988 states and 83262 transitions. [2024-11-06 19:50:48,052 INFO L78 Accepts]: Start accepts. Automaton has 75988 states and 83262 transitions. Word has length 314 [2024-11-06 19:50:48,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:48,052 INFO L471 AbstractCegarLoop]: Abstraction has 75988 states and 83262 transitions. [2024-11-06 19:50:48,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand 75988 states and 83262 transitions. [2024-11-06 19:50:48,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-06 19:50:48,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:48,054 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:50:48,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:50:48,055 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:48,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:48,055 INFO L85 PathProgramCache]: Analyzing trace with hash -444136852, now seen corresponding path program 1 times [2024-11-06 19:50:48,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:48,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871527167] [2024-11-06 19:50:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:48,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-06 19:50:48,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:48,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871527167] [2024-11-06 19:50:48,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871527167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:48,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:48,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:50:48,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889414320] [2024-11-06 19:50:48,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:48,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:48,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:48,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:48,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:48,250 INFO L87 Difference]: Start difference. First operand 75988 states and 83262 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:51,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:51,285 INFO L93 Difference]: Finished difference Result 173236 states and 190620 transitions. [2024-11-06 19:50:51,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:51,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2024-11-06 19:50:51,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:51,382 INFO L225 Difference]: With dead ends: 173236 [2024-11-06 19:50:51,382 INFO L226 Difference]: Without dead ends: 98037 [2024-11-06 19:50:51,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:51,406 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 894 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:51,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 846 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:50:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98037 states. [2024-11-06 19:50:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98037 to 96447. [2024-11-06 19:50:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96447 states, 96446 states have (on average 1.0905791842067063) internal successors, (105182), 96446 states have internal predecessors, (105182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96447 states to 96447 states and 105182 transitions. [2024-11-06 19:50:52,287 INFO L78 Accepts]: Start accepts. Automaton has 96447 states and 105182 transitions. Word has length 324 [2024-11-06 19:50:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:52,287 INFO L471 AbstractCegarLoop]: Abstraction has 96447 states and 105182 transitions. [2024-11-06 19:50:52,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 96447 states and 105182 transitions. [2024-11-06 19:50:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-06 19:50:52,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:52,290 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:50:52,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:50:52,290 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:52,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:52,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1192441845, now seen corresponding path program 1 times [2024-11-06 19:50:52,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:52,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004945010] [2024-11-06 19:50:52,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:52,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-06 19:50:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004945010] [2024-11-06 19:50:52,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004945010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:52,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:52,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:50:52,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133576214] [2024-11-06 19:50:52,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:52,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:52,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:52,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:52,481 INFO L87 Difference]: Start difference. First operand 96447 states and 105182 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:55,841 INFO L93 Difference]: Finished difference Result 209437 states and 227970 transitions. [2024-11-06 19:50:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:55,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 341 [2024-11-06 19:50:55,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:55,950 INFO L225 Difference]: With dead ends: 209437 [2024-11-06 19:50:55,951 INFO L226 Difference]: Without dead ends: 113779 [2024-11-06 19:50:55,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:55,983 INFO L432 NwaCegarLoop]: 1023 mSDtfsCounter, 724 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:55,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1197 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2684 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:50:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113779 states. [2024-11-06 19:50:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113779 to 112982. [2024-11-06 19:50:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112982 states, 112981 states have (on average 1.081836769014259) internal successors, (122227), 112981 states have internal predecessors, (122227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112982 states to 112982 states and 122227 transitions. [2024-11-06 19:50:57,064 INFO L78 Accepts]: Start accepts. Automaton has 112982 states and 122227 transitions. Word has length 341 [2024-11-06 19:50:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:57,064 INFO L471 AbstractCegarLoop]: Abstraction has 112982 states and 122227 transitions. [2024-11-06 19:50:57,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 112982 states and 122227 transitions. [2024-11-06 19:50:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-06 19:50:57,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:57,070 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:50:57,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:50:57,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:57,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:57,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1539895112, now seen corresponding path program 1 times [2024-11-06 19:50:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:57,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963549975] [2024-11-06 19:50:57,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:57,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:50:57,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:57,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963549975] [2024-11-06 19:50:57,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963549975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:57,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:57,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:50:57,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611709209] [2024-11-06 19:50:57,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:57,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:50:57,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:57,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:50:57,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:50:57,533 INFO L87 Difference]: Start difference. First operand 112982 states and 122227 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:03,022 INFO L93 Difference]: Finished difference Result 274832 states and 300813 transitions. [2024-11-06 19:51:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:51:03,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2024-11-06 19:51:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:03,178 INFO L225 Difference]: With dead ends: 274832 [2024-11-06 19:51:03,178 INFO L226 Difference]: Without dead ends: 179174 [2024-11-06 19:51:03,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:51:03,205 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 1638 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 5280 mSolverCounterSat, 810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 6090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 810 IncrementalHoareTripleChecker+Valid, 5280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:03,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 947 Invalid, 6090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [810 Valid, 5280 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-06 19:51:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179174 states. [2024-11-06 19:51:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179174 to 178336. [2024-11-06 19:51:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178336 states, 178335 states have (on average 1.0821655872375024) internal successors, (192988), 178335 states have internal predecessors, (192988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178336 states to 178336 states and 192988 transitions. [2024-11-06 19:51:04,724 INFO L78 Accepts]: Start accepts. Automaton has 178336 states and 192988 transitions. Word has length 355 [2024-11-06 19:51:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:04,726 INFO L471 AbstractCegarLoop]: Abstraction has 178336 states and 192988 transitions. [2024-11-06 19:51:04,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 178336 states and 192988 transitions. [2024-11-06 19:51:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-11-06 19:51:04,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:04,739 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:04,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:51:04,739 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:04,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2088568846, now seen corresponding path program 1 times [2024-11-06 19:51:04,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:04,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369274013] [2024-11-06 19:51:04,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:04,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-06 19:51:05,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:05,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369274013] [2024-11-06 19:51:05,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369274013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:05,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:05,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:51:05,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736947156] [2024-11-06 19:51:05,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:05,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:05,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:05,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:05,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:05,230 INFO L87 Difference]: Start difference. First operand 178336 states and 192988 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:09,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:09,126 INFO L93 Difference]: Finished difference Result 359058 states and 388375 transitions. [2024-11-06 19:51:09,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:09,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 357 [2024-11-06 19:51:09,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:09,397 INFO L225 Difference]: With dead ends: 359058 [2024-11-06 19:51:09,398 INFO L226 Difference]: Without dead ends: 180724 [2024-11-06 19:51:09,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:09,472 INFO L432 NwaCegarLoop]: 1273 mSDtfsCounter, 1087 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:09,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 1323 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-06 19:51:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180724 states. [2024-11-06 19:51:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180724 to 175184. [2024-11-06 19:51:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175184 states, 175183 states have (on average 1.077952769389724) internal successors, (188839), 175183 states have internal predecessors, (188839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175184 states to 175184 states and 188839 transitions. [2024-11-06 19:51:11,491 INFO L78 Accepts]: Start accepts. Automaton has 175184 states and 188839 transitions. Word has length 357 [2024-11-06 19:51:11,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:11,492 INFO L471 AbstractCegarLoop]: Abstraction has 175184 states and 188839 transitions. [2024-11-06 19:51:11,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 175184 states and 188839 transitions. [2024-11-06 19:51:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-06 19:51:11,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:11,495 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:11,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:51:11,495 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:11,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash 221236577, now seen corresponding path program 1 times [2024-11-06 19:51:11,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:11,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117075047] [2024-11-06 19:51:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:11,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 252 proven. 113 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 19:51:12,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:12,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117075047] [2024-11-06 19:51:12,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117075047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:51:12,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396641610] [2024-11-06 19:51:12,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:12,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:51:12,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:51:12,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:51:12,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 19:51:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:12,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:51:12,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:51:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-06 19:51:13,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:51:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396641610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:13,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:51:13,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-06 19:51:13,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796779588] [2024-11-06 19:51:13,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:13,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:13,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:13,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:13,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:51:13,043 INFO L87 Difference]: Start difference. First operand 175184 states and 188839 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:16,394 INFO L93 Difference]: Finished difference Result 347216 states and 374217 transitions. [2024-11-06 19:51:16,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:16,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 370 [2024-11-06 19:51:16,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:16,908 INFO L225 Difference]: With dead ends: 347216 [2024-11-06 19:51:16,908 INFO L226 Difference]: Without dead ends: 172821 [2024-11-06 19:51:16,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:51:16,974 INFO L432 NwaCegarLoop]: 1337 mSDtfsCounter, 1094 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 2900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:16,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 1416 Invalid, 2900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2459 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:51:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172821 states. [2024-11-06 19:51:18,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172821 to 171241. [2024-11-06 19:51:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171241 states, 171240 states have (on average 1.0590983415089932) internal successors, (181360), 171240 states have internal predecessors, (181360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171241 states to 171241 states and 181360 transitions. [2024-11-06 19:51:18,994 INFO L78 Accepts]: Start accepts. Automaton has 171241 states and 181360 transitions. Word has length 370 [2024-11-06 19:51:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:18,994 INFO L471 AbstractCegarLoop]: Abstraction has 171241 states and 181360 transitions. [2024-11-06 19:51:18,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 171241 states and 181360 transitions. [2024-11-06 19:51:18,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2024-11-06 19:51:18,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:18,997 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:19,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:51:19,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-06 19:51:19,202 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:19,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:19,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1276482095, now seen corresponding path program 1 times [2024-11-06 19:51:19,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:19,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717528163] [2024-11-06 19:51:19,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:19,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2024-11-06 19:51:19,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:19,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717528163] [2024-11-06 19:51:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717528163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:19,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:51:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732996439] [2024-11-06 19:51:19,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:19,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:51:19,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:19,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:51:19,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:51:19,609 INFO L87 Difference]: Start difference. First operand 171241 states and 181360 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)