./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.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/combinations/Problem05_label42+token_ring.10.cil-2.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', '02030f9c3db6d0a219b6d0b652f5c8999a9fbcf506b26b943850b37227141b78'] 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/combinations/Problem05_label42+token_ring.10.cil-2.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 02030f9c3db6d0a219b6d0b652f5c8999a9fbcf506b26b943850b37227141b78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:57:48,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:57:48,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:57:48,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:57:48,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:57:48,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:57:48,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:57:48,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:57:48,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:57:48,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:57:48,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:57:48,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:57:48,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:57:48,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:57:48,249 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:57:48,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:57:48,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:57:48,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:57:48,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:57:48,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:57:48,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:57:48,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:57:48,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:57:48,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:57:48,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:57:48,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:57:48,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:57:48,250 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:57:48,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:57:48,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:57:48,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:57:48,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:57:48,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:57:48,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:57:48,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:57:48,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:57:48,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:57:48,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:57:48,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:57:48,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:57:48,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:57:48,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:57:48,252 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 -> 02030f9c3db6d0a219b6d0b652f5c8999a9fbcf506b26b943850b37227141b78 [2024-11-07 00:57:48,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:57:48,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:57:48,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:57:48,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:57:48,531 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:57:48,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c [2024-11-07 00:57:49,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:57:50,231 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:57:50,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c [2024-11-07 00:57:50,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbd66dd7c/acc45a06bc134001a7263398f1326e06/FLAGc3f976876 [2024-11-07 00:57:50,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbd66dd7c/acc45a06bc134001a7263398f1326e06 [2024-11-07 00:57:50,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:57:50,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:57:50,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:57:50,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:57:50,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:57:50,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:50" (1/1) ... [2024-11-07 00:57:50,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e255a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:50, skipping insertion in model container [2024-11-07 00:57:50,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:50" (1/1) ... [2024-11-07 00:57:50,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:57:51,516 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/combinations/Problem05_label42+token_ring.10.cil-2.c[378560,378573] [2024-11-07 00:57:51,562 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/combinations/Problem05_label42+token_ring.10.cil-2.c[383339,383352] [2024-11-07 00:57:51,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:57:51,684 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:57:52,150 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/combinations/Problem05_label42+token_ring.10.cil-2.c[378560,378573] [2024-11-07 00:57:52,153 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/combinations/Problem05_label42+token_ring.10.cil-2.c[383339,383352] [2024-11-07 00:57:52,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:57:52,207 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:57:52,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52 WrapperNode [2024-11-07 00:57:52,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:57:52,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:57:52,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:57:52,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:57:52,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (1/1) ... [2024-11-07 00:57:52,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (1/1) ... [2024-11-07 00:57:52,652 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13113 [2024-11-07 00:57:52,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:57:52,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:57:52,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:57:52,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:57:52,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (1/1) ... [2024-11-07 00:57:52,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (1/1) ... [2024-11-07 00:57:52,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (1/1) ... [2024-11-07 00:57:52,761 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-07 00:57:52,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (1/1) ... [2024-11-07 00:57:52,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (1/1) ... [2024-11-07 00:57:52,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (1/1) ... [2024-11-07 00:57:52,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (1/1) ... [2024-11-07 00:57:52,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (1/1) ... [2024-11-07 00:57:52,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (1/1) ... [2024-11-07 00:57:53,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:57:53,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:57:53,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:57:53,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:57:53,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (1/1) ... [2024-11-07 00:57:53,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:57:53,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:57:53,036 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-07 00:57:53,038 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-07 00:57:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:57:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:57:53,055 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:57:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:57:53,055 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:57:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:57:53,056 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:57:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:57:53,056 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:57:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:57:53,056 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:57:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:57:53,056 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:57:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:57:53,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:57:53,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:57:53,166 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:57:53,168 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:57:59,225 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2024-11-07 00:57:59,225 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:57:59,278 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:57:59,281 INFO L316 CfgBuilder]: Removed 14 assume(true) statements. [2024-11-07 00:57:59,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:59 BoogieIcfgContainer [2024-11-07 00:57:59,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:57:59,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:57:59,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:57:59,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:57:59,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:57:50" (1/3) ... [2024-11-07 00:57:59,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2ad1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:57:59, skipping insertion in model container [2024-11-07 00:57:59,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:52" (2/3) ... [2024-11-07 00:57:59,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2ad1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:57:59, skipping insertion in model container [2024-11-07 00:57:59,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:59" (3/3) ... [2024-11-07 00:57:59,289 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.10.cil-2.c [2024-11-07 00:57:59,299 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:57:59,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:57:59,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:57:59,391 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;@3d38b1b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:57:59,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:57:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 2526 states, 2493 states have (on average 1.8419574809466506) internal successors, (4592), 2496 states have internal predecessors, (4592), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 00:57:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:57:59,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:59,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:59,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:59,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:59,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2034921809, now seen corresponding path program 1 times [2024-11-07 00:57:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:59,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224435042] [2024-11-07 00:57:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:59,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:59,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:59,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:57:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:59,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:57:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:59,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 00:57:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:59,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:57:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:59,895 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-07 00:57:59,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224435042] [2024-11-07 00:57:59,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224435042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:59,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:59,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:57:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314799404] [2024-11-07 00:57:59,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:59,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:57:59,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:59,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:57:59,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:57:59,928 INFO L87 Difference]: Start difference. First operand has 2526 states, 2493 states have (on average 1.8419574809466506) internal successors, (4592), 2496 states have internal predecessors, (4592), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:01,227 INFO L93 Difference]: Finished difference Result 5162 states and 9468 transitions. [2024-11-07 00:58:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:58:01,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-07 00:58:01,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:01,258 INFO L225 Difference]: With dead ends: 5162 [2024-11-07 00:58:01,262 INFO L226 Difference]: Without dead ends: 2579 [2024-11-07 00:58:01,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:58:01,278 INFO L432 NwaCegarLoop]: 4337 mSDtfsCounter, 899 mSDsluCounter, 12435 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 16772 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:01,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 16772 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:58:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2024-11-07 00:58:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2459. [2024-11-07 00:58:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2427 states have (on average 1.826534816646065) internal successors, (4433), 2429 states have internal predecessors, (4433), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 00:58:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 4481 transitions. [2024-11-07 00:58:01,454 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 4481 transitions. Word has length 156 [2024-11-07 00:58:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:01,455 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 4481 transitions. [2024-11-07 00:58:01,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 4481 transitions. [2024-11-07 00:58:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:58:01,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:01,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:01,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:58:01,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:01,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1833490989, now seen corresponding path program 1 times [2024-11-07 00:58:01,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:01,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044219136] [2024-11-07 00:58:01,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:01,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:58:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:01,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:58:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 00:58:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:01,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:58:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:01,810 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-07 00:58:01,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:01,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044219136] [2024-11-07 00:58:01,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044219136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:01,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:01,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:01,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447613611] [2024-11-07 00:58:01,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:01,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:01,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:01,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:01,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:01,812 INFO L87 Difference]: Start difference. First operand 2459 states and 4481 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:04,969 INFO L93 Difference]: Finished difference Result 3374 states and 5955 transitions. [2024-11-07 00:58:04,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:04,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-07 00:58:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:04,994 INFO L225 Difference]: With dead ends: 3374 [2024-11-07 00:58:04,998 INFO L226 Difference]: Without dead ends: 3054 [2024-11-07 00:58:05,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:05,006 INFO L432 NwaCegarLoop]: 4460 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3167 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22009 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:05,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22009 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 3167 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 00:58:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2024-11-07 00:58:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2797. [2024-11-07 00:58:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 2736 states have (on average 1.7978801169590644) internal successors, (4919), 2740 states have internal predecessors, (4919), 45 states have call successors, (45), 12 states have call predecessors, (45), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2024-11-07 00:58:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 5016 transitions. [2024-11-07 00:58:05,102 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 5016 transitions. Word has length 156 [2024-11-07 00:58:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:05,102 INFO L471 AbstractCegarLoop]: Abstraction has 2797 states and 5016 transitions. [2024-11-07 00:58:05,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 5016 transitions. [2024-11-07 00:58:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:58:05,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:05,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:05,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:58:05,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:05,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:05,105 INFO L85 PathProgramCache]: Analyzing trace with hash 216050539, now seen corresponding path program 1 times [2024-11-07 00:58:05,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:05,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463055115] [2024-11-07 00:58:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:05,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:05,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:05,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:58:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:05,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:58:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:05,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 00:58:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:05,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:58:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:05,298 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-07 00:58:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463055115] [2024-11-07 00:58:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463055115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:05,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:05,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992341942] [2024-11-07 00:58:05,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:05,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:05,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:05,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:05,300 INFO L87 Difference]: Start difference. First operand 2797 states and 5016 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:07,804 INFO L93 Difference]: Finished difference Result 4542 states and 7800 transitions. [2024-11-07 00:58:07,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:07,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-07 00:58:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:07,828 INFO L225 Difference]: With dead ends: 4542 [2024-11-07 00:58:07,831 INFO L226 Difference]: Without dead ends: 3886 [2024-11-07 00:58:07,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:07,839 INFO L432 NwaCegarLoop]: 4406 mSDtfsCounter, 5285 mSDsluCounter, 17474 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5302 SdHoareTripleChecker+Valid, 21880 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:07,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5302 Valid, 21880 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2868 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 00:58:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2024-11-07 00:58:07,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3421. [2024-11-07 00:58:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 3308 states have (on average 1.7533252720677146) internal successors, (5800), 3314 states have internal predecessors, (5800), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-11-07 00:58:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 5983 transitions. [2024-11-07 00:58:07,963 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 5983 transitions. Word has length 156 [2024-11-07 00:58:07,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:07,964 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 5983 transitions. [2024-11-07 00:58:07,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 5983 transitions. [2024-11-07 00:58:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:58:07,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:07,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:07,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:58:07,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:07,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash 579517037, now seen corresponding path program 1 times [2024-11-07 00:58:07,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:07,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080994892] [2024-11-07 00:58:07,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:07,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:08,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:58:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:08,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:58:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:08,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 00:58:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:08,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:58:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:08,159 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-07 00:58:08,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:08,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080994892] [2024-11-07 00:58:08,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080994892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:08,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:08,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:08,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112174086] [2024-11-07 00:58:08,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:08,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:08,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:08,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:08,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:08,161 INFO L87 Difference]: Start difference. First operand 3421 states and 5983 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:10,865 INFO L93 Difference]: Finished difference Result 6828 states and 11399 transitions. [2024-11-07 00:58:10,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:10,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-07 00:58:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:10,881 INFO L225 Difference]: With dead ends: 6828 [2024-11-07 00:58:10,881 INFO L226 Difference]: Without dead ends: 5548 [2024-11-07 00:58:10,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:10,885 INFO L432 NwaCegarLoop]: 4458 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3162 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22007 SdHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:10,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22007 Invalid, 3226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3162 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:58:10,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2024-11-07 00:58:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 4671. [2024-11-07 00:58:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4671 states, 4454 states have (on average 1.698248765154917) internal successors, (7564), 4464 states have internal predecessors, (7564), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-11-07 00:58:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 7925 transitions. [2024-11-07 00:58:10,989 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 7925 transitions. Word has length 156 [2024-11-07 00:58:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:10,989 INFO L471 AbstractCegarLoop]: Abstraction has 4671 states and 7925 transitions. [2024-11-07 00:58:10,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 7925 transitions. [2024-11-07 00:58:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:58:10,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:10,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:10,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:58:10,992 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:10,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash 868336427, now seen corresponding path program 1 times [2024-11-07 00:58:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:10,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623970153] [2024-11-07 00:58:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:10,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:58:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:58:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 00:58:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:58:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,161 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-07 00:58:11,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:11,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623970153] [2024-11-07 00:58:11,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623970153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:11,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:11,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:11,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178886934] [2024-11-07 00:58:11,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:11,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:11,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:11,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:11,163 INFO L87 Difference]: Start difference. First operand 4671 states and 7925 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:13,946 INFO L93 Difference]: Finished difference Result 11398 states and 18611 transitions. [2024-11-07 00:58:13,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:13,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-07 00:58:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:13,982 INFO L225 Difference]: With dead ends: 11398 [2024-11-07 00:58:13,982 INFO L226 Difference]: Without dead ends: 8868 [2024-11-07 00:58:13,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:13,991 INFO L432 NwaCegarLoop]: 4456 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3143 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22005 SdHoareTripleChecker+Invalid, 3207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:13,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22005 Invalid, 3207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3143 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 00:58:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8868 states. [2024-11-07 00:58:14,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8868 to 7177. [2024-11-07 00:58:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 6752 states have (on average 1.643957345971564) internal successors, (11100), 6770 states have internal predecessors, (11100), 311 states have call successors, (311), 96 states have call predecessors, (311), 112 states have return successors, (424), 326 states have call predecessors, (424), 311 states have call successors, (424) [2024-11-07 00:58:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 11835 transitions. [2024-11-07 00:58:14,202 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 11835 transitions. Word has length 156 [2024-11-07 00:58:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:14,203 INFO L471 AbstractCegarLoop]: Abstraction has 7177 states and 11835 transitions. [2024-11-07 00:58:14,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:14,203 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 11835 transitions. [2024-11-07 00:58:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:58:14,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:14,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:14,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:58:14,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:14,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:14,208 INFO L85 PathProgramCache]: Analyzing trace with hash 323463853, now seen corresponding path program 1 times [2024-11-07 00:58:14,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197459021] [2024-11-07 00:58:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:14,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:14,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:58:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:14,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:58:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:14,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 00:58:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:14,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:58:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:14,423 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-07 00:58:14,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:14,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197459021] [2024-11-07 00:58:14,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197459021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:14,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:14,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:14,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758476786] [2024-11-07 00:58:14,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:14,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:14,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:14,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:14,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:14,424 INFO L87 Difference]: Start difference. First operand 7177 states and 11835 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:17,227 INFO L93 Difference]: Finished difference Result 20536 states and 33091 transitions. [2024-11-07 00:58:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:17,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-07 00:58:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:17,279 INFO L225 Difference]: With dead ends: 20536 [2024-11-07 00:58:17,279 INFO L226 Difference]: Without dead ends: 15500 [2024-11-07 00:58:17,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:17,297 INFO L432 NwaCegarLoop]: 4459 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3149 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22008 SdHoareTripleChecker+Invalid, 3213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:17,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22008 Invalid, 3213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3149 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:58:17,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15500 states. [2024-11-07 00:58:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15500 to 12203. [2024-11-07 00:58:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12203 states, 11362 states have (on average 1.6011265622249604) internal successors, (18192), 11396 states have internal predecessors, (18192), 615 states have call successors, (615), 192 states have call predecessors, (615), 224 states have return successors, (922), 646 states have call predecessors, (922), 615 states have call successors, (922) [2024-11-07 00:58:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12203 states to 12203 states and 19729 transitions. [2024-11-07 00:58:17,791 INFO L78 Accepts]: Start accepts. Automaton has 12203 states and 19729 transitions. Word has length 156 [2024-11-07 00:58:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:17,792 INFO L471 AbstractCegarLoop]: Abstraction has 12203 states and 19729 transitions. [2024-11-07 00:58:17,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 12203 states and 19729 transitions. [2024-11-07 00:58:17,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:58:17,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:17,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:17,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:58:17,808 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:17,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash 998623979, now seen corresponding path program 1 times [2024-11-07 00:58:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237053323] [2024-11-07 00:58:17,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:17,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:58:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:58:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 00:58:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:17,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:58:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:17,994 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-07 00:58:17,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:17,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237053323] [2024-11-07 00:58:17,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237053323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:17,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:17,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:17,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068903926] [2024-11-07 00:58:17,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:17,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:17,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:17,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:17,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:17,996 INFO L87 Difference]: Start difference. First operand 12203 states and 19729 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:21,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:21,289 INFO L93 Difference]: Finished difference Result 38810 states and 62239 transitions. [2024-11-07 00:58:21,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:21,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-07 00:58:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:21,383 INFO L225 Difference]: With dead ends: 38810 [2024-11-07 00:58:21,384 INFO L226 Difference]: Without dead ends: 28748 [2024-11-07 00:58:21,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:21,422 INFO L432 NwaCegarLoop]: 4458 mSDtfsCounter, 5244 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3135 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 22007 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:21,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 22007 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3135 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:58:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28748 states. [2024-11-07 00:58:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28748 to 22285. [2024-11-07 00:58:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22285 states, 20612 states have (on average 1.5728701727149232) internal successors, (32420), 20678 states have internal predecessors, (32420), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 448 states have return successors, (2080), 1286 states have call predecessors, (2080), 1223 states have call successors, (2080) [2024-11-07 00:58:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22285 states to 22285 states and 35723 transitions. [2024-11-07 00:58:22,241 INFO L78 Accepts]: Start accepts. Automaton has 22285 states and 35723 transitions. Word has length 156 [2024-11-07 00:58:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:22,242 INFO L471 AbstractCegarLoop]: Abstraction has 22285 states and 35723 transitions. [2024-11-07 00:58:22,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 22285 states and 35723 transitions. [2024-11-07 00:58:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:58:22,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:22,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:22,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:58:22,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:22,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash 50572013, now seen corresponding path program 1 times [2024-11-07 00:58:22,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:22,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370934944] [2024-11-07 00:58:22,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:22,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:22,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:22,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:58:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:22,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:58:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:22,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 00:58:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:22,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:58:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:22,516 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-07 00:58:22,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:22,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370934944] [2024-11-07 00:58:22,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370934944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:22,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:22,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:22,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096614960] [2024-11-07 00:58:22,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:22,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:22,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:22,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:22,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:22,518 INFO L87 Difference]: Start difference. First operand 22285 states and 35723 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:24,843 INFO L93 Difference]: Finished difference Result 49349 states and 79788 transitions. [2024-11-07 00:58:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:58:24,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-07 00:58:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:24,928 INFO L225 Difference]: With dead ends: 49349 [2024-11-07 00:58:24,929 INFO L226 Difference]: Without dead ends: 29203 [2024-11-07 00:58:24,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:58:24,976 INFO L432 NwaCegarLoop]: 4227 mSDtfsCounter, 5082 mSDsluCounter, 12542 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5100 SdHoareTripleChecker+Valid, 16769 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:24,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5100 Valid, 16769 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:58:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29203 states. [2024-11-07 00:58:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29203 to 22285. [2024-11-07 00:58:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22285 states, 20612 states have (on average 1.5697166699010285) internal successors, (32355), 20678 states have internal predecessors, (32355), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 448 states have return successors, (2080), 1286 states have call predecessors, (2080), 1223 states have call successors, (2080) [2024-11-07 00:58:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22285 states to 22285 states and 35658 transitions. [2024-11-07 00:58:25,769 INFO L78 Accepts]: Start accepts. Automaton has 22285 states and 35658 transitions. Word has length 156 [2024-11-07 00:58:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:25,769 INFO L471 AbstractCegarLoop]: Abstraction has 22285 states and 35658 transitions. [2024-11-07 00:58:25,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 22285 states and 35658 transitions. [2024-11-07 00:58:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:58:25,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:25,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:25,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:58:25,778 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:25,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash -534199637, now seen corresponding path program 1 times [2024-11-07 00:58:25,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:25,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347334854] [2024-11-07 00:58:25,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:25,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:25,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:58:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:58:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:25,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 00:58:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:25,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:58:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:25,956 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-07 00:58:25,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:25,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347334854] [2024-11-07 00:58:25,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347334854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:25,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:25,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:25,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165180082] [2024-11-07 00:58:25,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:25,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:25,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:25,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:25,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:25,958 INFO L87 Difference]: Start difference. First operand 22285 states and 35658 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:30,208 INFO L93 Difference]: Finished difference Result 75229 states and 120559 transitions. [2024-11-07 00:58:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:30,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-07 00:58:30,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:30,342 INFO L225 Difference]: With dead ends: 75229 [2024-11-07 00:58:30,342 INFO L226 Difference]: Without dead ends: 55085 [2024-11-07 00:58:30,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:30,386 INFO L432 NwaCegarLoop]: 4457 mSDtfsCounter, 5276 mSDsluCounter, 17549 mSDsCounter, 0 mSdLazyCounter, 3010 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5293 SdHoareTripleChecker+Valid, 22006 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:30,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5293 Valid, 22006 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3010 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:58:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55085 states. [2024-11-07 00:58:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55085 to 42638. [2024-11-07 00:58:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42638 states, 39301 states have (on average 1.5528866949950384) internal successors, (61030), 39431 states have internal predecessors, (61030), 2439 states have call successors, (2439), 768 states have call predecessors, (2439), 896 states have return successors, (4882), 2566 states have call predecessors, (4882), 2439 states have call successors, (4882) [2024-11-07 00:58:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42638 states to 42638 states and 68351 transitions. [2024-11-07 00:58:31,907 INFO L78 Accepts]: Start accepts. Automaton has 42638 states and 68351 transitions. Word has length 156 [2024-11-07 00:58:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:31,907 INFO L471 AbstractCegarLoop]: Abstraction has 42638 states and 68351 transitions. [2024-11-07 00:58:31,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 42638 states and 68351 transitions. [2024-11-07 00:58:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:58:31,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:31,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:31,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:58:31,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:31,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:31,924 INFO L85 PathProgramCache]: Analyzing trace with hash -963857943, now seen corresponding path program 1 times [2024-11-07 00:58:31,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:31,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125923655] [2024-11-07 00:58:31,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:31,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:32,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:58:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:32,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:58:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:32,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 00:58:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:32,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:58:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:32,092 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-07 00:58:32,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:32,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125923655] [2024-11-07 00:58:32,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125923655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:32,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:32,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:32,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456287405] [2024-11-07 00:58:32,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:32,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:32,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:32,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:32,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:32,093 INFO L87 Difference]: Start difference. First operand 42638 states and 68351 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:37,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:37,921 INFO L93 Difference]: Finished difference Result 148320 states and 239808 transitions. [2024-11-07 00:58:37,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:37,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-07 00:58:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:38,203 INFO L225 Difference]: With dead ends: 148320 [2024-11-07 00:58:38,203 INFO L226 Difference]: Without dead ends: 107823 [2024-11-07 00:58:38,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:38,292 INFO L432 NwaCegarLoop]: 4407 mSDtfsCounter, 5302 mSDsluCounter, 17474 mSDsCounter, 0 mSdLazyCounter, 2768 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5319 SdHoareTripleChecker+Valid, 21881 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:38,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5319 Valid, 21881 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2768 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:58:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107823 states. [2024-11-07 00:58:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107823 to 83472. [2024-11-07 00:58:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83472 states, 76807 states have (on average 1.5437655422031846) internal successors, (118572), 77065 states have internal predecessors, (118572), 4871 states have call successors, (4871), 1536 states have call predecessors, (4871), 1792 states have return successors, (11944), 5126 states have call predecessors, (11944), 4871 states have call successors, (11944) [2024-11-07 00:58:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83472 states to 83472 states and 135387 transitions. [2024-11-07 00:58:41,667 INFO L78 Accepts]: Start accepts. Automaton has 83472 states and 135387 transitions. Word has length 156 [2024-11-07 00:58:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:41,667 INFO L471 AbstractCegarLoop]: Abstraction has 83472 states and 135387 transitions. [2024-11-07 00:58:41,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 83472 states and 135387 transitions. [2024-11-07 00:58:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 00:58:41,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:41,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:41,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:58:41,697 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:41,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:41,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1670454549, now seen corresponding path program 1 times [2024-11-07 00:58:41,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:41,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518309963] [2024-11-07 00:58:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:41,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:41,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:41,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 00:58:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:41,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 00:58:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 00:58:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:41,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 00:58:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:41,860 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-07 00:58:41,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:41,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518309963] [2024-11-07 00:58:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518309963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:41,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:41,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:41,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703691648] [2024-11-07 00:58:41,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:41,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:41,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:41,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:41,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:41,862 INFO L87 Difference]: Start difference. First operand 83472 states and 135387 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:52,295 INFO L93 Difference]: Finished difference Result 332646 states and 542316 transitions. [2024-11-07 00:58:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:58:52,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 156 [2024-11-07 00:58:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:53,304 INFO L225 Difference]: With dead ends: 332646 [2024-11-07 00:58:53,305 INFO L226 Difference]: Without dead ends: 251315 [2024-11-07 00:58:53,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:58:53,535 INFO L432 NwaCegarLoop]: 4455 mSDtfsCounter, 5686 mSDsluCounter, 17541 mSDsCounter, 0 mSdLazyCounter, 2977 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5714 SdHoareTripleChecker+Valid, 21996 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:53,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5714 Valid, 21996 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2977 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:58:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251315 states.