./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.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_label40+token_ring.08.cil-1.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', 'd82b800c515c04812d9c150cf365a0cfa0ea150fbe8533e2e65b2216ea091fd6'] 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_label40+token_ring.08.cil-1.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 d82b800c515c04812d9c150cf365a0cfa0ea150fbe8533e2e65b2216ea091fd6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:54:59,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:54:59,960 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:54:59,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:54:59,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:54:59,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:54:59,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:54:59,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:54:59,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:54:59,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:54:59,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:54:59,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:54:59,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:54:59,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:54:59,987 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:54:59,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:54:59,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:54:59,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:54:59,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:54:59,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:54:59,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:54:59,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:54:59,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:54:59,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:54:59,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:54:59,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:54:59,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:54:59,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:54:59,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:54:59,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:54:59,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:54:59,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:54:59,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:54:59,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:54:59,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:54:59,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:54:59,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:54:59,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:54:59,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:54:59,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:54:59,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:54:59,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:54:59,992 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 -> d82b800c515c04812d9c150cf365a0cfa0ea150fbe8533e2e65b2216ea091fd6 [2024-11-07 00:55:00,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:55:00,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:55:00,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:55:00,222 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:55:00,222 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:55:00,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c [2024-11-07 00:55:01,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:55:02,019 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:55:02,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c [2024-11-07 00:55:02,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/979335ab7/9d3eb6a2ff4a48d9b5e80b3b7f126f5c/FLAG6c6378359 [2024-11-07 00:55:02,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/979335ab7/9d3eb6a2ff4a48d9b5e80b3b7f126f5c [2024-11-07 00:55:02,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:55:02,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:55:02,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:55:02,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:55:02,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:55:02,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:55:02" (1/1) ... [2024-11-07 00:55:02,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5543cde5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:02, skipping insertion in model container [2024-11-07 00:55:02,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:55:02" (1/1) ... [2024-11-07 00:55:02,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:55:03,618 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_label40+token_ring.08.cil-1.c[377069,377082] [2024-11-07 00:55:03,668 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_label40+token_ring.08.cil-1.c[383339,383352] [2024-11-07 00:55:03,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:55:03,885 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:55:04,364 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_label40+token_ring.08.cil-1.c[377069,377082] [2024-11-07 00:55:04,369 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_label40+token_ring.08.cil-1.c[383339,383352] [2024-11-07 00:55:04,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:55:04,431 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:55:04,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:04 WrapperNode [2024-11-07 00:55:04,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:55:04,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:55:04,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:55:04,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:55:04,438 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:55:04" (1/1) ... [2024-11-07 00:55:04,519 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:55:04" (1/1) ... [2024-11-07 00:55:04,883 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12993 [2024-11-07 00:55:04,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:55:04,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:55:04,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:55:04,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:55:04,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:04" (1/1) ... [2024-11-07 00:55:04,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:04" (1/1) ... [2024-11-07 00:55:04,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:04" (1/1) ... [2024-11-07 00:55:04,992 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:55:04,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:04" (1/1) ... [2024-11-07 00:55:04,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:04" (1/1) ... [2024-11-07 00:55:05,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:04" (1/1) ... [2024-11-07 00:55:05,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:04" (1/1) ... [2024-11-07 00:55:05,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:04" (1/1) ... [2024-11-07 00:55:05,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:04" (1/1) ... [2024-11-07 00:55:05,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:55:05,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:55:05,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:55:05,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:55:05,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:04" (1/1) ... [2024-11-07 00:55:05,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:55:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:55:05,271 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:55:05,273 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:55:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:55:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:55:05,289 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:55:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:55:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:55:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:55:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:55:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:55:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:55:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:55:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:55:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:55:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:55:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:55:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:55:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:55:05,376 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:55:05,378 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:55:11,839 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2024-11-07 00:55:11,840 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:55:11,899 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:55:11,899 INFO L316 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-07 00:55:11,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:55:11 BoogieIcfgContainer [2024-11-07 00:55:11,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:55:11,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:55:11,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:55:11,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:55:11,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:55:02" (1/3) ... [2024-11-07 00:55:11,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506d45a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:55:11, skipping insertion in model container [2024-11-07 00:55:11,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:04" (2/3) ... [2024-11-07 00:55:11,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506d45a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:55:11, skipping insertion in model container [2024-11-07 00:55:11,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:55:11" (3/3) ... [2024-11-07 00:55:11,915 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.08.cil-1.c [2024-11-07 00:55:11,940 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:55:11,940 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:55:12,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:55:12,055 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;@48814202, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:55:12,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:55:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 2474 states, 2443 states have (on average 1.845272206303725) internal successors, (4508), 2446 states have internal predecessors, (4508), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 00:55:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:55:12,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:12,077 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] [2024-11-07 00:55:12,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:12,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash -372695446, now seen corresponding path program 1 times [2024-11-07 00:55:12,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:12,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076356182] [2024-11-07 00:55:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:12,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:12,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:12,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:55:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:12,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:55:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:12,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:55:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:12,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:55:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:12,564 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:55:12,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:12,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076356182] [2024-11-07 00:55:12,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076356182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:12,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:12,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:55:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655355419] [2024-11-07 00:55:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:12,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:55:12,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:12,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:55:12,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:55:12,607 INFO L87 Difference]: Start difference. First operand has 2474 states, 2443 states have (on average 1.845272206303725) internal successors, (4508), 2446 states have internal predecessors, (4508), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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:55:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:13,754 INFO L93 Difference]: Finished difference Result 5040 states and 9262 transitions. [2024-11-07 00:55:13,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:55:13,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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 134 [2024-11-07 00:55:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:13,773 INFO L225 Difference]: With dead ends: 5040 [2024-11-07 00:55:13,774 INFO L226 Difference]: Without dead ends: 2505 [2024-11-07 00:55:13,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:55:13,782 INFO L432 NwaCegarLoop]: 4291 mSDtfsCounter, 747 mSDsluCounter, 12379 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 16670 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:13,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 16670 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:55:13,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-07 00:55:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2407. [2024-11-07 00:55:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 2377 states have (on average 1.831299957930164) internal successors, (4353), 2379 states have internal predecessors, (4353), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 00:55:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 4397 transitions. [2024-11-07 00:55:13,882 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 4397 transitions. Word has length 134 [2024-11-07 00:55:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:13,883 INFO L471 AbstractCegarLoop]: Abstraction has 2407 states and 4397 transitions. [2024-11-07 00:55:13,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 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:55:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 4397 transitions. [2024-11-07 00:55:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:55:13,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:13,886 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] [2024-11-07 00:55:13,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:55:13,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:13,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash 333901160, now seen corresponding path program 1 times [2024-11-07 00:55:13,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:13,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942447037] [2024-11-07 00:55:13,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:13,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:13,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:55:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:14,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:55:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:14,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:55:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:14,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:55:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:14,142 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:55:14,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:14,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942447037] [2024-11-07 00:55:14,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942447037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:14,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:14,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:55:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526385637] [2024-11-07 00:55:14,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:14,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:55:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:14,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:55:14,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:55:14,144 INFO L87 Difference]: Start difference. First operand 2407 states and 4397 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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:55:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:15,779 INFO L93 Difference]: Finished difference Result 3153 states and 5582 transitions. [2024-11-07 00:55:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:55:15,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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 134 [2024-11-07 00:55:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:15,789 INFO L225 Difference]: With dead ends: 3153 [2024-11-07 00:55:15,790 INFO L226 Difference]: Without dead ends: 2883 [2024-11-07 00:55:15,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:55:15,791 INFO L432 NwaCegarLoop]: 4200 mSDtfsCounter, 5067 mSDsluCounter, 12602 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5082 SdHoareTripleChecker+Valid, 16802 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:15,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5082 Valid, 16802 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 00:55:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2024-11-07 00:55:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2688. [2024-11-07 00:55:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2688 states, 2634 states have (on average 1.8048595292331056) internal successors, (4754), 2637 states have internal predecessors, (4754), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-11-07 00:55:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 4835 transitions. [2024-11-07 00:55:15,845 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 4835 transitions. Word has length 134 [2024-11-07 00:55:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:15,845 INFO L471 AbstractCegarLoop]: Abstraction has 2688 states and 4835 transitions. [2024-11-07 00:55:15,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 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:55:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 4835 transitions. [2024-11-07 00:55:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:55:15,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:15,847 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] [2024-11-07 00:55:15,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:55:15,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:15,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1372602388, now seen corresponding path program 1 times [2024-11-07 00:55:15,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:15,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276156365] [2024-11-07 00:55:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:15,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:15,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:55:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:16,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:55:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:16,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:55:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:16,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:55:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:16,024 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:55:16,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:16,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276156365] [2024-11-07 00:55:16,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276156365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:16,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:16,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:16,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142179519] [2024-11-07 00:55:16,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:16,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:16,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:16,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:16,026 INFO L87 Difference]: Start difference. First operand 2688 states and 4835 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:18,298 INFO L93 Difference]: Finished difference Result 3824 states and 6638 transitions. [2024-11-07 00:55:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:18,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 00:55:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:18,309 INFO L225 Difference]: With dead ends: 3824 [2024-11-07 00:55:18,309 INFO L226 Difference]: Without dead ends: 3273 [2024-11-07 00:55:18,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:18,311 INFO L432 NwaCegarLoop]: 4383 mSDtfsCounter, 5086 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5101 SdHoareTripleChecker+Valid, 21656 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:18,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5101 Valid, 21656 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 00:55:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2024-11-07 00:55:18,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 2950. [2024-11-07 00:55:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2872 states have (on average 1.7816852367688023) internal successors, (5117), 2876 states have internal predecessors, (5117), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-11-07 00:55:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 5234 transitions. [2024-11-07 00:55:18,369 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 5234 transitions. Word has length 134 [2024-11-07 00:55:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:18,370 INFO L471 AbstractCegarLoop]: Abstraction has 2950 states and 5234 transitions. [2024-11-07 00:55:18,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 5234 transitions. [2024-11-07 00:55:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:55:18,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:18,373 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] [2024-11-07 00:55:18,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:55:18,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:18,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash 629283882, now seen corresponding path program 1 times [2024-11-07 00:55:18,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:18,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046841587] [2024-11-07 00:55:18,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:18,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:18,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:55:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:18,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:55:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:18,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:55:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:55:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:18,658 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:55:18,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:18,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046841587] [2024-11-07 00:55:18,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046841587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:18,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:18,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:18,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809861384] [2024-11-07 00:55:18,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:18,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:18,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:18,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:18,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:18,661 INFO L87 Difference]: Start difference. First operand 2950 states and 5234 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:20,837 INFO L93 Difference]: Finished difference Result 4813 states and 8183 transitions. [2024-11-07 00:55:20,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:20,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 00:55:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:20,857 INFO L225 Difference]: With dead ends: 4813 [2024-11-07 00:55:20,858 INFO L226 Difference]: Without dead ends: 4000 [2024-11-07 00:55:20,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:20,864 INFO L432 NwaCegarLoop]: 4210 mSDtfsCounter, 5166 mSDsluCounter, 16783 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 20993 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:20,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 20993 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 00:55:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2024-11-07 00:55:20,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3475. [2024-11-07 00:55:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 3349 states have (on average 1.74499850701702) internal successors, (5844), 3355 states have internal predecessors, (5844), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-11-07 00:55:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 6037 transitions. [2024-11-07 00:55:20,979 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 6037 transitions. Word has length 134 [2024-11-07 00:55:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:20,980 INFO L471 AbstractCegarLoop]: Abstraction has 3475 states and 6037 transitions. [2024-11-07 00:55:20,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 6037 transitions. [2024-11-07 00:55:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:55:20,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:20,982 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] [2024-11-07 00:55:20,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:55:20,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:20,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1938538452, now seen corresponding path program 1 times [2024-11-07 00:55:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247884461] [2024-11-07 00:55:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:21,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:21,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:55:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:21,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:55:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:21,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:55:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:21,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:55:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:21,273 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:55:21,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247884461] [2024-11-07 00:55:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247884461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:21,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119534375] [2024-11-07 00:55:21,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:21,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:21,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:21,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:21,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:21,275 INFO L87 Difference]: Start difference. First operand 3475 states and 6037 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:23,552 INFO L93 Difference]: Finished difference Result 6718 states and 11142 transitions. [2024-11-07 00:55:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:23,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 00:55:23,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:23,567 INFO L225 Difference]: With dead ends: 6718 [2024-11-07 00:55:23,567 INFO L226 Difference]: Without dead ends: 5380 [2024-11-07 00:55:23,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:23,571 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5084 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5099 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:23,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5099 Valid, 21654 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 00:55:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2024-11-07 00:55:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 4526. [2024-11-07 00:55:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4526 states, 4304 states have (on average 1.695631970260223) internal successors, (7298), 4314 states have internal predecessors, (7298), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-11-07 00:55:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4526 states to 4526 states and 7649 transitions. [2024-11-07 00:55:23,693 INFO L78 Accepts]: Start accepts. Automaton has 4526 states and 7649 transitions. Word has length 134 [2024-11-07 00:55:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:23,693 INFO L471 AbstractCegarLoop]: Abstraction has 4526 states and 7649 transitions. [2024-11-07 00:55:23,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4526 states and 7649 transitions. [2024-11-07 00:55:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:55:23,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:23,697 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] [2024-11-07 00:55:23,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:55:23,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:23,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1467182102, now seen corresponding path program 1 times [2024-11-07 00:55:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:23,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582865203] [2024-11-07 00:55:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:23,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:23,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:55:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:23,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:55:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:55:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:23,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:55:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:23,952 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:55:23,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:23,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582865203] [2024-11-07 00:55:23,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582865203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:23,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:23,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:23,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590249947] [2024-11-07 00:55:23,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:23,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:23,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:23,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:23,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:23,954 INFO L87 Difference]: Start difference. First operand 4526 states and 7649 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:26,253 INFO L93 Difference]: Finished difference Result 10520 states and 17064 transitions. [2024-11-07 00:55:26,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:26,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 00:55:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:26,277 INFO L225 Difference]: With dead ends: 10520 [2024-11-07 00:55:26,277 INFO L226 Difference]: Without dead ends: 8131 [2024-11-07 00:55:26,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:26,286 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5080 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5095 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:26,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5095 Valid, 21654 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 00:55:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8131 states. [2024-11-07 00:55:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8131 to 6642. [2024-11-07 00:55:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6642 states, 6228 states have (on average 1.642581888246628) internal successors, (10230), 6246 states have internal predecessors, (10230), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-11-07 00:55:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6642 states to 6642 states and 10915 transitions. [2024-11-07 00:55:26,547 INFO L78 Accepts]: Start accepts. Automaton has 6642 states and 10915 transitions. Word has length 134 [2024-11-07 00:55:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:26,547 INFO L471 AbstractCegarLoop]: Abstraction has 6642 states and 10915 transitions. [2024-11-07 00:55:26,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 6642 states and 10915 transitions. [2024-11-07 00:55:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:55:26,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:26,553 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] [2024-11-07 00:55:26,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:55:26,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:26,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash 696434472, now seen corresponding path program 1 times [2024-11-07 00:55:26,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:26,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324492269] [2024-11-07 00:55:26,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:26,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:26,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:26,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:55:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:55:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:26,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:55:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:26,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:55:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:26,706 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:55:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324492269] [2024-11-07 00:55:26,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324492269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:26,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:26,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:26,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188206379] [2024-11-07 00:55:26,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:26,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:26,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:26,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:26,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:26,709 INFO L87 Difference]: Start difference. First operand 6642 states and 10915 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:29,083 INFO L93 Difference]: Finished difference Result 18142 states and 29000 transitions. [2024-11-07 00:55:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:29,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 00:55:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:29,132 INFO L225 Difference]: With dead ends: 18142 [2024-11-07 00:55:29,133 INFO L226 Difference]: Without dead ends: 13637 [2024-11-07 00:55:29,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:29,179 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5079 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5094 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:29,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5094 Valid, 21654 Invalid, 2534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 00:55:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13637 states. [2024-11-07 00:55:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13637 to 10887. [2024-11-07 00:55:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10887 states, 10089 states have (on average 1.5969868173258004) internal successors, (16112), 10123 states have internal predecessors, (16112), 566 states have call successors, (566), 198 states have call predecessors, (566), 230 states have return successors, (841), 597 states have call predecessors, (841), 566 states have call successors, (841) [2024-11-07 00:55:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 17519 transitions. [2024-11-07 00:55:29,551 INFO L78 Accepts]: Start accepts. Automaton has 10887 states and 17519 transitions. Word has length 134 [2024-11-07 00:55:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:29,551 INFO L471 AbstractCegarLoop]: Abstraction has 10887 states and 17519 transitions. [2024-11-07 00:55:29,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 10887 states and 17519 transitions. [2024-11-07 00:55:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:55:29,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:29,560 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] [2024-11-07 00:55:29,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:55:29,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:29,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash -342150102, now seen corresponding path program 1 times [2024-11-07 00:55:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:29,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166742553] [2024-11-07 00:55:29,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:29,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:29,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:55:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:29,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:55:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:29,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:55:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:29,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:55:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:29,770 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:55:29,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:29,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166742553] [2024-11-07 00:55:29,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166742553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:29,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:29,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:29,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865766373] [2024-11-07 00:55:29,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:29,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:29,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:29,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:29,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:29,772 INFO L87 Difference]: Start difference. First operand 10887 states and 17519 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:31,499 INFO L93 Difference]: Finished difference Result 22528 states and 36089 transitions. [2024-11-07 00:55:31,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:55:31,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 00:55:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:31,533 INFO L225 Difference]: With dead ends: 22528 [2024-11-07 00:55:31,533 INFO L226 Difference]: Without dead ends: 13778 [2024-11-07 00:55:31,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:55:31,549 INFO L432 NwaCegarLoop]: 4185 mSDtfsCounter, 4780 mSDsluCounter, 16543 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4796 SdHoareTripleChecker+Valid, 20728 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:31,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4796 Valid, 20728 Invalid, 1315 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:55:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2024-11-07 00:55:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 10887. [2024-11-07 00:55:31,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10887 states, 10089 states have (on average 1.5937159282386757) internal successors, (16079), 10123 states have internal predecessors, (16079), 566 states have call successors, (566), 198 states have call predecessors, (566), 230 states have return successors, (841), 597 states have call predecessors, (841), 566 states have call successors, (841) [2024-11-07 00:55:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 17486 transitions. [2024-11-07 00:55:31,971 INFO L78 Accepts]: Start accepts. Automaton has 10887 states and 17486 transitions. Word has length 134 [2024-11-07 00:55:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:31,971 INFO L471 AbstractCegarLoop]: Abstraction has 10887 states and 17486 transitions. [2024-11-07 00:55:31,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 10887 states and 17486 transitions. [2024-11-07 00:55:31,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:55:31,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:31,978 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] [2024-11-07 00:55:31,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:55:31,978 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:31,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1979651816, now seen corresponding path program 1 times [2024-11-07 00:55:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:31,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360536592] [2024-11-07 00:55:31,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:32,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:55:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:32,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:55:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:32,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:55:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:32,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:55:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:32,136 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:55:32,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:32,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360536592] [2024-11-07 00:55:32,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360536592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:32,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:32,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:32,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514376541] [2024-11-07 00:55:32,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:32,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:32,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:32,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:32,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:32,137 INFO L87 Difference]: Start difference. First operand 10887 states and 17486 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:34,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:34,743 INFO L93 Difference]: Finished difference Result 33351 states and 52830 transitions. [2024-11-07 00:55:34,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:34,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 00:55:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:34,797 INFO L225 Difference]: With dead ends: 33351 [2024-11-07 00:55:34,798 INFO L226 Difference]: Without dead ends: 24601 [2024-11-07 00:55:34,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:34,819 INFO L432 NwaCegarLoop]: 4381 mSDtfsCounter, 5071 mSDsluCounter, 17273 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5086 SdHoareTripleChecker+Valid, 21654 SdHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:34,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5086 Valid, 21654 Invalid, 2496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 00:55:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24601 states. [2024-11-07 00:55:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24601 to 19441. [2024-11-07 00:55:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19441 states, 17875 states have (on average 1.5603356643356643) internal successors, (27891), 17941 states have internal predecessors, (27891), 1110 states have call successors, (1110), 390 states have call predecessors, (1110), 454 states have return successors, (1903), 1173 states have call predecessors, (1903), 1110 states have call successors, (1903) [2024-11-07 00:55:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19441 states to 19441 states and 30904 transitions. [2024-11-07 00:55:36,168 INFO L78 Accepts]: Start accepts. Automaton has 19441 states and 30904 transitions. Word has length 134 [2024-11-07 00:55:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:36,168 INFO L471 AbstractCegarLoop]: Abstraction has 19441 states and 30904 transitions. [2024-11-07 00:55:36,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 19441 states and 30904 transitions. [2024-11-07 00:55:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:55:36,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:36,178 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] [2024-11-07 00:55:36,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:55:36,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:36,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash -162208662, now seen corresponding path program 1 times [2024-11-07 00:55:36,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:36,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884610791] [2024-11-07 00:55:36,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:36,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:36,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:36,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:55:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:36,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:55:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:36,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:55:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:36,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:55:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:36,333 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:55:36,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:36,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884610791] [2024-11-07 00:55:36,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884610791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:36,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:36,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:36,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497198808] [2024-11-07 00:55:36,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:36,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:36,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:36,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:36,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:36,335 INFO L87 Difference]: Start difference. First operand 19441 states and 30904 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:40,175 INFO L93 Difference]: Finished difference Result 71583 states and 113144 transitions. [2024-11-07 00:55:40,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:55:40,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 00:55:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:40,398 INFO L225 Difference]: With dead ends: 71583 [2024-11-07 00:55:40,398 INFO L226 Difference]: Without dead ends: 54279 [2024-11-07 00:55:40,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:55:40,486 INFO L432 NwaCegarLoop]: 4379 mSDtfsCounter, 5400 mSDsluCounter, 17265 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5424 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:40,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5424 Valid, 21644 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 00:55:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54279 states. [2024-11-07 00:55:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54279 to 36418. [2024-11-07 00:55:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36418 states, 33380 states have (on average 1.5421509886159377) internal successors, (51477), 33510 states have internal predecessors, (51477), 2134 states have call successors, (2134), 774 states have call predecessors, (2134), 902 states have return successors, (4449), 2261 states have call predecessors, (4449), 2134 states have call successors, (4449) [2024-11-07 00:55:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36418 states to 36418 states and 58060 transitions. [2024-11-07 00:55:42,968 INFO L78 Accepts]: Start accepts. Automaton has 36418 states and 58060 transitions. Word has length 134 [2024-11-07 00:55:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:42,969 INFO L471 AbstractCegarLoop]: Abstraction has 36418 states and 58060 transitions. [2024-11-07 00:55:42,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 36418 states and 58060 transitions. [2024-11-07 00:55:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:55:43,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:43,002 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] [2024-11-07 00:55:43,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:55:43,004 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:43,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:43,006 INFO L85 PathProgramCache]: Analyzing trace with hash -785490264, now seen corresponding path program 1 times [2024-11-07 00:55:43,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:43,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511837676] [2024-11-07 00:55:43,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:43,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:55:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:55:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:55:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:55:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,271 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:55:43,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:43,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511837676] [2024-11-07 00:55:43,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511837676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:43,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:43,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:43,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695044867] [2024-11-07 00:55:43,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:43,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:43,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:43,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:43,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:43,273 INFO L87 Difference]: Start difference. First operand 36418 states and 58060 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:49,647 INFO L93 Difference]: Finished difference Result 138190 states and 220638 transitions. [2024-11-07 00:55:49,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:55:49,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 00:55:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:49,942 INFO L225 Difference]: With dead ends: 138190 [2024-11-07 00:55:49,942 INFO L226 Difference]: Without dead ends: 103909 [2024-11-07 00:55:50,034 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:55:50,035 INFO L432 NwaCegarLoop]: 4236 mSDtfsCounter, 5209 mSDsluCounter, 16803 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 21039 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:50,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 21039 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 00:55:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103909 states. [2024-11-07 00:55:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103909 to 69667. [2024-11-07 00:55:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69667 states, 63749 states have (on average 1.532369135202121) internal successors, (97687), 64007 states have internal predecessors, (97687), 4118 states have call successors, (4118), 1542 states have call predecessors, (4118), 1798 states have return successors, (10935), 4373 states have call predecessors, (10935), 4118 states have call successors, (10935) [2024-11-07 00:55:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69667 states to 69667 states and 112740 transitions. [2024-11-07 00:55:54,029 INFO L78 Accepts]: Start accepts. Automaton has 69667 states and 112740 transitions. Word has length 134 [2024-11-07 00:55:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:54,029 INFO L471 AbstractCegarLoop]: Abstraction has 69667 states and 112740 transitions. [2024-11-07 00:55:54,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:55:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 69667 states and 112740 transitions. [2024-11-07 00:55:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:55:54,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:54,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:55:54,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:55:54,059 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:54,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:54,059 INFO L85 PathProgramCache]: Analyzing trace with hash -667048790, now seen corresponding path program 1 times [2024-11-07 00:55:54,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:54,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220162525] [2024-11-07 00:55:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:54,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:54,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:54,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:55:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:54,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:55:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:54,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:55:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:54,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:55:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:54,192 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:55:54,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:54,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220162525] [2024-11-07 00:55:54,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220162525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:54,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:54,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:54,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148714319] [2024-11-07 00:55:54,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:54,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:54,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:54,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:54,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:54,194 INFO L87 Difference]: Start difference. First operand 69667 states and 112740 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:56:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:03,833 INFO L93 Difference]: Finished difference Result 267117 states and 434484 transitions. [2024-11-07 00:56:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:56:03,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2024-11-07 00:56:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:04,608 INFO L225 Difference]: With dead ends: 267117 [2024-11-07 00:56:04,609 INFO L226 Difference]: Without dead ends: 199587 [2024-11-07 00:56:04,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:56:04,860 INFO L432 NwaCegarLoop]: 4379 mSDtfsCounter, 5326 mSDsluCounter, 17265 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5350 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 2448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:04,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5350 Valid, 21644 Invalid, 2448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2390 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 00:56:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199587 states. [2024-11-07 00:56:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199587 to 136676. [2024-11-07 00:56:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136676 states, 125126 states have (on average 1.5285152566213258) internal successors, (191257), 125640 states have internal predecessors, (191257), 7958 states have call successors, (7958), 3078 states have call predecessors, (7958), 3590 states have return successors, (28153), 8469 states have call predecessors, (28153), 7958 states have call successors, (28153) [2024-11-07 00:56:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136676 states to 136676 states and 227368 transitions. [2024-11-07 00:56:12,565 INFO L78 Accepts]: Start accepts. Automaton has 136676 states and 227368 transitions. Word has length 134 [2024-11-07 00:56:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:12,566 INFO L471 AbstractCegarLoop]: Abstraction has 136676 states and 227368 transitions. [2024-11-07 00:56:12,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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:56:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 136676 states and 227368 transitions. [2024-11-07 00:56:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:56:12,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:12,650 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] [2024-11-07 00:56:12,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:56:12,650 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:12,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:12,650 INFO L85 PathProgramCache]: Analyzing trace with hash 722245224, now seen corresponding path program 1 times [2024-11-07 00:56:12,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:12,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687012891] [2024-11-07 00:56:12,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:12,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:12,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 00:56:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:12,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 00:56:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 00:56:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:12,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 00:56:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:12,821 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:56:12,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:12,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687012891] [2024-11-07 00:56:12,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687012891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:12,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:12,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953778648] [2024-11-07 00:56:12,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:12,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:12,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:12,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:12,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:12,823 INFO L87 Difference]: Start difference. First operand 136676 states and 227368 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 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)