./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.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_label47+token_ring.05.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', 'eb02e23cacfa9dfcb6b910fbdb7f96346be741b0dc92ba35a0c3f2fde349f0cf'] 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_label47+token_ring.05.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 eb02e23cacfa9dfcb6b910fbdb7f96346be741b0dc92ba35a0c3f2fde349f0cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:07:10,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:07:11,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:07:11,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:07:11,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:07:11,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:07:11,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:07:11,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:07:11,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:07:11,041 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:07:11,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:07:11,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:07:11,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:07:11,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:07:11,042 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:07:11,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:07:11,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:07:11,043 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:07:11,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:07:11,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:07:11,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:07:11,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:07:11,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:07:11,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:07:11,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:07:11,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:07:11,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:07:11,043 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:07:11,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:07:11,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:07:11,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:07:11,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:07:11,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:07:11,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:07:11,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:07:11,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:07:11,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:07:11,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:07:11,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:07:11,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:07:11,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:07:11,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:07:11,045 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 -> eb02e23cacfa9dfcb6b910fbdb7f96346be741b0dc92ba35a0c3f2fde349f0cf [2024-11-07 01:07:11,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:07:11,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:07:11,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:07:11,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:07:11,279 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:07:11,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c [2024-11-07 01:07:12,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:07:12,804 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:07:12,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.05.cil-1.c [2024-11-07 01:07:12,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70bed7d6d/3fc50fe9a0a943de9b5e5b55329e7500/FLAGa81de2c95 [2024-11-07 01:07:12,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70bed7d6d/3fc50fe9a0a943de9b5e5b55329e7500 [2024-11-07 01:07:12,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:07:12,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:07:12,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:07:12,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:07:12,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:07:12,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:12" (1/1) ... [2024-11-07 01:07:12,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c88f03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:12, skipping insertion in model container [2024-11-07 01:07:12,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:07:12" (1/1) ... [2024-11-07 01:07:13,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:07:13,922 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_label47+token_ring.05.cil-1.c[377612,377625] [2024-11-07 01:07:13,947 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_label47+token_ring.05.cil-1.c[383339,383352] [2024-11-07 01:07:14,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:07:14,078 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:07:14,535 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_label47+token_ring.05.cil-1.c[377612,377625] [2024-11-07 01:07:14,539 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_label47+token_ring.05.cil-1.c[383339,383352] [2024-11-07 01:07:14,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:07:14,615 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:07:14,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14 WrapperNode [2024-11-07 01:07:14,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:07:14,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:07:14,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:07:14,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:07:14,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (1/1) ... [2024-11-07 01:07:14,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (1/1) ... [2024-11-07 01:07:15,030 INFO L138 Inliner]: procedures = 54, calls = 56, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 12813 [2024-11-07 01:07:15,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:07:15,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:07:15,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:07:15,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:07:15,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (1/1) ... [2024-11-07 01:07:15,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (1/1) ... [2024-11-07 01:07:15,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (1/1) ... [2024-11-07 01:07:15,146 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 01:07:15,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (1/1) ... [2024-11-07 01:07:15,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (1/1) ... [2024-11-07 01:07:15,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (1/1) ... [2024-11-07 01:07:15,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (1/1) ... [2024-11-07 01:07:15,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (1/1) ... [2024-11-07 01:07:15,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (1/1) ... [2024-11-07 01:07:15,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:07:15,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:07:15,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:07:15,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:07:15,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (1/1) ... [2024-11-07 01:07:15,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:07:15,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:07:15,543 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 01:07:15,546 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 01:07:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:07:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:07:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:07:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:07:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:07:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:07:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:07:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:07:15,562 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:07:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:07:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:07:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:07:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:07:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:07:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:07:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:07:15,659 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:07:15,661 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:07:21,445 INFO L? ?]: Removed 1713 outVars from TransFormulas that were not future-live. [2024-11-07 01:07:21,449 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:07:21,511 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:07:21,511 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-07 01:07:21,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:21 BoogieIcfgContainer [2024-11-07 01:07:21,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:07:21,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:07:21,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:07:21,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:07:21,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:07:12" (1/3) ... [2024-11-07 01:07:21,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761f18c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:21, skipping insertion in model container [2024-11-07 01:07:21,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:07:14" (2/3) ... [2024-11-07 01:07:21,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761f18c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:07:21, skipping insertion in model container [2024-11-07 01:07:21,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:07:21" (3/3) ... [2024-11-07 01:07:21,533 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.05.cil-1.c [2024-11-07 01:07:21,554 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:07:21,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:07:21,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:07:21,651 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;@315209ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:07:21,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:07:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 2396 states, 2368 states have (on average 1.8505067567567568) internal successors, (4382), 2371 states have internal predecessors, (4382), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 01:07:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:07:21,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:21,675 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] [2024-11-07 01:07:21,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:21,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1103952823, now seen corresponding path program 1 times [2024-11-07 01:07:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:21,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332818156] [2024-11-07 01:07:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:21,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:07:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:21,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:07:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:21,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:07:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:22,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:07:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:22,018 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 01:07:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:22,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332818156] [2024-11-07 01:07:22,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332818156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:22,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:22,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:07:22,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991939315] [2024-11-07 01:07:22,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:22,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:07:22,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:22,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:07:22,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:07:22,044 INFO L87 Difference]: Start difference. First operand has 2396 states, 2368 states have (on average 1.8505067567567568) internal successors, (4382), 2371 states have internal predecessors, (4382), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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 01:07:22,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:22,793 INFO L93 Difference]: Finished difference Result 4849 states and 8937 transitions. [2024-11-07 01:07:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:07:22,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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 101 [2024-11-07 01:07:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:22,815 INFO L225 Difference]: With dead ends: 4849 [2024-11-07 01:07:22,815 INFO L226 Difference]: Without dead ends: 2394 [2024-11-07 01:07:22,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:07:22,828 INFO L432 NwaCegarLoop]: 4222 mSDtfsCounter, 517 mSDsluCounter, 12295 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 16517 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:22,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 16517 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:07:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2024-11-07 01:07:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2329. [2024-11-07 01:07:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2302 states have (on average 1.8388357949609035) internal successors, (4233), 2304 states have internal predecessors, (4233), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 01:07:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 4271 transitions. [2024-11-07 01:07:22,959 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 4271 transitions. Word has length 101 [2024-11-07 01:07:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:22,960 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 4271 transitions. [2024-11-07 01:07:22,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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 01:07:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 4271 transitions. [2024-11-07 01:07:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:07:22,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:22,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:07:22,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:07:22,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:22,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash -773110407, now seen corresponding path program 1 times [2024-11-07 01:07:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:22,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846225756] [2024-11-07 01:07:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:23,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:07:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:23,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:07:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:23,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:07:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:23,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:07:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:23,175 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 01:07:23,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:23,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846225756] [2024-11-07 01:07:23,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846225756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:23,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:23,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:07:23,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442012403] [2024-11-07 01:07:23,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:23,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:07:23,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:23,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:07:23,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:07:23,178 INFO L87 Difference]: Start difference. First operand 2329 states and 4271 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 01:07:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:24,207 INFO L93 Difference]: Finished difference Result 2853 states and 5090 transitions. [2024-11-07 01:07:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:07:24,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 101 [2024-11-07 01:07:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:24,224 INFO L225 Difference]: With dead ends: 2853 [2024-11-07 01:07:24,224 INFO L226 Difference]: Without dead ends: 2658 [2024-11-07 01:07:24,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:07:24,226 INFO L432 NwaCegarLoop]: 4137 mSDtfsCounter, 4719 mSDsluCounter, 12401 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 16538 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:24,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4731 Valid, 16538 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:07:24,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-11-07 01:07:24,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2529. [2024-11-07 01:07:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2481 states have (on average 1.8170092704554615) internal successors, (4508), 2484 states have internal predecessors, (4508), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2024-11-07 01:07:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 4577 transitions. [2024-11-07 01:07:24,293 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 4577 transitions. Word has length 101 [2024-11-07 01:07:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:24,293 INFO L471 AbstractCegarLoop]: Abstraction has 2529 states and 4577 transitions. [2024-11-07 01:07:24,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 01:07:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 4577 transitions. [2024-11-07 01:07:24,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:07:24,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:24,300 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] [2024-11-07 01:07:24,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:07:24,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:24,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:24,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1804972285, now seen corresponding path program 1 times [2024-11-07 01:07:24,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:24,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725685938] [2024-11-07 01:07:24,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:24,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:24,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:07:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:24,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:07:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:24,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:07:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:24,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:07:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:24,480 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 01:07:24,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:24,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725685938] [2024-11-07 01:07:24,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725685938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:24,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:24,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:24,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485825004] [2024-11-07 01:07:24,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:24,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:24,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:24,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:24,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:24,483 INFO L87 Difference]: Start difference. First operand 2529 states and 4577 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:25,917 INFO L93 Difference]: Finished difference Result 3323 states and 5813 transitions. [2024-11-07 01:07:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:25,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:07:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:25,931 INFO L225 Difference]: With dead ends: 3323 [2024-11-07 01:07:25,931 INFO L226 Difference]: Without dead ends: 2928 [2024-11-07 01:07:25,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:25,934 INFO L432 NwaCegarLoop]: 4269 mSDtfsCounter, 4734 mSDsluCounter, 16862 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4746 SdHoareTripleChecker+Valid, 21131 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:25,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4746 Valid, 21131 Invalid, 1789 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:07:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2024-11-07 01:07:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2716. [2024-11-07 01:07:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2647 states have (on average 1.797128825085002) internal successors, (4757), 2651 states have internal predecessors, (4757), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-11-07 01:07:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 4856 transitions. [2024-11-07 01:07:25,993 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 4856 transitions. Word has length 101 [2024-11-07 01:07:25,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:25,994 INFO L471 AbstractCegarLoop]: Abstraction has 2716 states and 4856 transitions. [2024-11-07 01:07:25,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 4856 transitions. [2024-11-07 01:07:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:07:25,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:25,996 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] [2024-11-07 01:07:25,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:07:25,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:25,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:25,997 INFO L85 PathProgramCache]: Analyzing trace with hash -74158661, now seen corresponding path program 1 times [2024-11-07 01:07:25,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:25,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29938368] [2024-11-07 01:07:25,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:25,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:26,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:26,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:07:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:26,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:07:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:26,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:07:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:07:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:26,151 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 01:07:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:26,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29938368] [2024-11-07 01:07:26,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29938368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:26,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:26,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:26,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66466354] [2024-11-07 01:07:26,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:26,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:26,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:26,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:26,153 INFO L87 Difference]: Start difference. First operand 2716 states and 4856 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:27,283 INFO L93 Difference]: Finished difference Result 4014 states and 6872 transitions. [2024-11-07 01:07:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:27,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:07:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:27,297 INFO L225 Difference]: With dead ends: 4014 [2024-11-07 01:07:27,297 INFO L226 Difference]: Without dead ends: 3432 [2024-11-07 01:07:27,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:27,301 INFO L432 NwaCegarLoop]: 4267 mSDtfsCounter, 4728 mSDsluCounter, 16862 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4740 SdHoareTripleChecker+Valid, 21129 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:27,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4740 Valid, 21129 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:07:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2024-11-07 01:07:27,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3094. [2024-11-07 01:07:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 2983 states have (on average 1.763995977204157) internal successors, (5262), 2989 states have internal predecessors, (5262), 75 states have call successors, (75), 30 states have call predecessors, (75), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-11-07 01:07:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 5425 transitions. [2024-11-07 01:07:27,452 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 5425 transitions. Word has length 101 [2024-11-07 01:07:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:27,452 INFO L471 AbstractCegarLoop]: Abstraction has 3094 states and 5425 transitions. [2024-11-07 01:07:27,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 5425 transitions. [2024-11-07 01:07:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:07:27,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:27,457 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] [2024-11-07 01:07:27,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:07:27,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:27,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1492599289, now seen corresponding path program 1 times [2024-11-07 01:07:27,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:27,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929694981] [2024-11-07 01:07:27,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:27,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:27,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:27,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:07:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:27,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:07:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:27,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:07:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:27,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:07:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:27,751 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 01:07:27,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929694981] [2024-11-07 01:07:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929694981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:27,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:27,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:27,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298358846] [2024-11-07 01:07:27,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:27,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:27,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:27,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:27,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:27,755 INFO L87 Difference]: Start difference. First operand 3094 states and 5425 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:28,917 INFO L93 Difference]: Finished difference Result 5354 states and 8917 transitions. [2024-11-07 01:07:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:28,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:07:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:28,932 INFO L225 Difference]: With dead ends: 5354 [2024-11-07 01:07:28,932 INFO L226 Difference]: Without dead ends: 4394 [2024-11-07 01:07:28,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:28,936 INFO L432 NwaCegarLoop]: 4267 mSDtfsCounter, 4727 mSDsluCounter, 16862 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4739 SdHoareTripleChecker+Valid, 21129 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:28,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4739 Valid, 21129 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:07:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4394 states. [2024-11-07 01:07:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4394 to 3851. [2024-11-07 01:07:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3656 states have (on average 1.7155361050328228) internal successors, (6272), 3666 states have internal predecessors, (6272), 131 states have call successors, (131), 54 states have call predecessors, (131), 62 states have return successors, (166), 138 states have call predecessors, (166), 131 states have call successors, (166) [2024-11-07 01:07:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 6569 transitions. [2024-11-07 01:07:29,061 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 6569 transitions. Word has length 101 [2024-11-07 01:07:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:29,061 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 6569 transitions. [2024-11-07 01:07:29,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 6569 transitions. [2024-11-07 01:07:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:07:29,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:29,063 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] [2024-11-07 01:07:29,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:07:29,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:29,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash 434761211, now seen corresponding path program 1 times [2024-11-07 01:07:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:29,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752645910] [2024-11-07 01:07:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:29,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:07:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:07:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:29,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:07:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:29,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:07:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:29,181 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 01:07:29,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:29,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752645910] [2024-11-07 01:07:29,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752645910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:29,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:29,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:29,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913954392] [2024-11-07 01:07:29,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:29,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:29,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:29,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:29,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:29,182 INFO L87 Difference]: Start difference. First operand 3851 states and 6569 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:30,406 INFO L93 Difference]: Finished difference Result 8033 states and 13023 transitions. [2024-11-07 01:07:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:07:30,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:07:30,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:30,423 INFO L225 Difference]: With dead ends: 8033 [2024-11-07 01:07:30,423 INFO L226 Difference]: Without dead ends: 6316 [2024-11-07 01:07:30,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:07:30,428 INFO L432 NwaCegarLoop]: 4267 mSDtfsCounter, 4726 mSDsluCounter, 16862 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4738 SdHoareTripleChecker+Valid, 21129 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:30,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4738 Valid, 21129 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:07:30,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6316 states. [2024-11-07 01:07:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6316 to 5372. [2024-11-07 01:07:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5372 states, 5009 states have (on average 1.657416650029946) internal successors, (8302), 5027 states have internal predecessors, (8302), 243 states have call successors, (243), 102 states have call predecessors, (243), 118 states have return successors, (340), 258 states have call predecessors, (340), 243 states have call successors, (340) [2024-11-07 01:07:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 8885 transitions. [2024-11-07 01:07:30,589 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 8885 transitions. Word has length 101 [2024-11-07 01:07:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:30,590 INFO L471 AbstractCegarLoop]: Abstraction has 5372 states and 8885 transitions. [2024-11-07 01:07:30,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 8885 transitions. [2024-11-07 01:07:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:07:30,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:30,593 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] [2024-11-07 01:07:30,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:07:30,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:30,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:30,593 INFO L85 PathProgramCache]: Analyzing trace with hash -707741255, now seen corresponding path program 1 times [2024-11-07 01:07:30,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:30,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406283973] [2024-11-07 01:07:30,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:30,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:30,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:30,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:07:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:30,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:07:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:30,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:07:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:30,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:07:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:30,712 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 01:07:30,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:30,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406283973] [2024-11-07 01:07:30,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406283973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:30,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:30,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:30,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536265401] [2024-11-07 01:07:30,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:30,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:30,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:30,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:30,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:30,714 INFO L87 Difference]: Start difference. First operand 5372 states and 8885 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:32,124 INFO L93 Difference]: Finished difference Result 14656 states and 23187 transitions. [2024-11-07 01:07:32,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:07:32,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:07:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:32,158 INFO L225 Difference]: With dead ends: 14656 [2024-11-07 01:07:32,159 INFO L226 Difference]: Without dead ends: 11418 [2024-11-07 01:07:32,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:07:32,167 INFO L432 NwaCegarLoop]: 4149 mSDtfsCounter, 4988 mSDsluCounter, 16518 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5006 SdHoareTripleChecker+Valid, 20667 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:32,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5006 Valid, 20667 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:07:32,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11418 states. [2024-11-07 01:07:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11418 to 8381. [2024-11-07 01:07:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8381 states, 7698 states have (on average 1.6045726162639646) internal successors, (12352), 7732 states have internal predecessors, (12352), 451 states have call successors, (451), 198 states have call predecessors, (451), 230 states have return successors, (726), 482 states have call predecessors, (726), 451 states have call successors, (726) [2024-11-07 01:07:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8381 states to 8381 states and 13529 transitions. [2024-11-07 01:07:32,473 INFO L78 Accepts]: Start accepts. Automaton has 8381 states and 13529 transitions. Word has length 101 [2024-11-07 01:07:32,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:32,474 INFO L471 AbstractCegarLoop]: Abstraction has 8381 states and 13529 transitions. [2024-11-07 01:07:32,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 8381 states and 13529 transitions. [2024-11-07 01:07:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:07:32,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:32,479 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] [2024-11-07 01:07:32,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:07:32,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:32,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:32,480 INFO L85 PathProgramCache]: Analyzing trace with hash -467501509, now seen corresponding path program 1 times [2024-11-07 01:07:32,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:32,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553270682] [2024-11-07 01:07:32,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:32,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:32,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:32,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:07:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:32,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:07:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:32,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:07:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:32,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:07:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:32,582 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 01:07:32,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:32,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553270682] [2024-11-07 01:07:32,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553270682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:32,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:32,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:32,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664568366] [2024-11-07 01:07:32,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:32,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:32,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:32,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:32,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:32,584 INFO L87 Difference]: Start difference. First operand 8381 states and 13529 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:34,332 INFO L93 Difference]: Finished difference Result 26111 states and 41017 transitions. [2024-11-07 01:07:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:07:34,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:07:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:34,417 INFO L225 Difference]: With dead ends: 26111 [2024-11-07 01:07:34,418 INFO L226 Difference]: Without dead ends: 19864 [2024-11-07 01:07:34,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:07:34,431 INFO L432 NwaCegarLoop]: 4264 mSDtfsCounter, 4766 mSDsluCounter, 16851 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4777 SdHoareTripleChecker+Valid, 21115 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:34,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 21115 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:07:34,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19864 states. [2024-11-07 01:07:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19864 to 14222. [2024-11-07 01:07:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14222 states, 12915 states have (on average 1.564847077042199) internal successors, (20210), 12981 states have internal predecessors, (20210), 851 states have call successors, (851), 390 states have call predecessors, (851), 454 states have return successors, (1644), 914 states have call predecessors, (1644), 851 states have call successors, (1644) [2024-11-07 01:07:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14222 states to 14222 states and 22705 transitions. [2024-11-07 01:07:35,199 INFO L78 Accepts]: Start accepts. Automaton has 14222 states and 22705 transitions. Word has length 101 [2024-11-07 01:07:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:35,199 INFO L471 AbstractCegarLoop]: Abstraction has 14222 states and 22705 transitions. [2024-11-07 01:07:35,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand 14222 states and 22705 transitions. [2024-11-07 01:07:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:07:35,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:35,216 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] [2024-11-07 01:07:35,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:07:35,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:35,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:35,220 INFO L85 PathProgramCache]: Analyzing trace with hash 371532153, now seen corresponding path program 1 times [2024-11-07 01:07:35,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:35,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672875884] [2024-11-07 01:07:35,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:35,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:35,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:35,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:07:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:07:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:35,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:07:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:35,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:07:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:35,347 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 01:07:35,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:35,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672875884] [2024-11-07 01:07:35,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672875884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:35,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:35,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:35,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085387109] [2024-11-07 01:07:35,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:35,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:35,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:35,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:35,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:35,349 INFO L87 Difference]: Start difference. First operand 14222 states and 22705 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:37,617 INFO L93 Difference]: Finished difference Result 47950 states and 75583 transitions. [2024-11-07 01:07:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:07:37,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:07:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:37,717 INFO L225 Difference]: With dead ends: 47950 [2024-11-07 01:07:37,717 INFO L226 Difference]: Without dead ends: 35862 [2024-11-07 01:07:37,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:07:37,751 INFO L432 NwaCegarLoop]: 4265 mSDtfsCounter, 4858 mSDsluCounter, 16854 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4876 SdHoareTripleChecker+Valid, 21119 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:37,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4876 Valid, 21119 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:07:37,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35862 states. [2024-11-07 01:07:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35862 to 26031. [2024-11-07 01:07:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26031 states, 23508 states have (on average 1.5404117747149906) internal successors, (36212), 23638 states have internal predecessors, (36212), 1619 states have call successors, (1619), 774 states have call predecessors, (1619), 902 states have return successors, (3934), 1746 states have call predecessors, (3934), 1619 states have call successors, (3934) [2024-11-07 01:07:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26031 states to 26031 states and 41765 transitions. [2024-11-07 01:07:39,205 INFO L78 Accepts]: Start accepts. Automaton has 26031 states and 41765 transitions. Word has length 101 [2024-11-07 01:07:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:39,205 INFO L471 AbstractCegarLoop]: Abstraction has 26031 states and 41765 transitions. [2024-11-07 01:07:39,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 26031 states and 41765 transitions. [2024-11-07 01:07:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:07:39,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:39,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:07:39,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:07:39,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:39,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash 398597755, now seen corresponding path program 1 times [2024-11-07 01:07:39,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:39,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122173109] [2024-11-07 01:07:39,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:39,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:39,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:39,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:07:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:39,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:07:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:39,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:07:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:39,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:07:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:39,325 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 01:07:39,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:39,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122173109] [2024-11-07 01:07:39,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122173109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:39,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:39,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:39,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836414543] [2024-11-07 01:07:39,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:39,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:39,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:39,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:39,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:39,327 INFO L87 Difference]: Start difference. First operand 26031 states and 41765 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:43,045 INFO L93 Difference]: Finished difference Result 90861 states and 145477 transitions. [2024-11-07 01:07:43,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:07:43,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:07:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:43,312 INFO L225 Difference]: With dead ends: 90861 [2024-11-07 01:07:43,312 INFO L226 Difference]: Without dead ends: 66964 [2024-11-07 01:07:43,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:07:43,489 INFO L432 NwaCegarLoop]: 4265 mSDtfsCounter, 4824 mSDsluCounter, 16854 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4842 SdHoareTripleChecker+Valid, 21119 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:43,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4842 Valid, 21119 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:07:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66964 states. [2024-11-07 01:07:45,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66964 to 49584. [2024-11-07 01:07:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49584 states, 44693 states have (on average 1.5277112746962611) internal successors, (68278), 44951 states have internal predecessors, (68278), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 1798 states have return successors, (9908), 3346 states have call predecessors, (9908), 3091 states have call successors, (9908) [2024-11-07 01:07:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49584 states to 49584 states and 81277 transitions. [2024-11-07 01:07:45,514 INFO L78 Accepts]: Start accepts. Automaton has 49584 states and 81277 transitions. Word has length 101 [2024-11-07 01:07:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:45,515 INFO L471 AbstractCegarLoop]: Abstraction has 49584 states and 81277 transitions. [2024-11-07 01:07:45,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 49584 states and 81277 transitions. [2024-11-07 01:07:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:07:45,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:45,543 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] [2024-11-07 01:07:45,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:07:45,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:45,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1678739143, now seen corresponding path program 1 times [2024-11-07 01:07:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:45,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506299433] [2024-11-07 01:07:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:45,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:45,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:45,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:07:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:45,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:07:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:45,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:07:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:45,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:07:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:07:45,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:45,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506299433] [2024-11-07 01:07:45,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506299433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:45,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:45,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:07:45,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034002791] [2024-11-07 01:07:45,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:45,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:07:45,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:45,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:07:45,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:07:45,675 INFO L87 Difference]: Start difference. First operand 49584 states and 81277 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:49,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:49,507 INFO L93 Difference]: Finished difference Result 108888 states and 182936 transitions. [2024-11-07 01:07:49,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:07:49,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-11-07 01:07:49,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:49,727 INFO L225 Difference]: With dead ends: 108888 [2024-11-07 01:07:49,727 INFO L226 Difference]: Without dead ends: 61438 [2024-11-07 01:07:49,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:07:49,827 INFO L432 NwaCegarLoop]: 4122 mSDtfsCounter, 4533 mSDsluCounter, 16337 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4546 SdHoareTripleChecker+Valid, 20459 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:49,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4546 Valid, 20459 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:07:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61438 states. [2024-11-07 01:07:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61438 to 49584. [2024-11-07 01:07:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49584 states, 44693 states have (on average 1.5219609334795159) internal successors, (68021), 44951 states have internal predecessors, (68021), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 1798 states have return successors, (9908), 3346 states have call predecessors, (9908), 3091 states have call successors, (9908) [2024-11-07 01:07:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49584 states to 49584 states and 81020 transitions. [2024-11-07 01:07:52,173 INFO L78 Accepts]: Start accepts. Automaton has 49584 states and 81020 transitions. Word has length 101 [2024-11-07 01:07:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:07:52,173 INFO L471 AbstractCegarLoop]: Abstraction has 49584 states and 81020 transitions. [2024-11-07 01:07:52,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 01:07:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 49584 states and 81020 transitions. [2024-11-07 01:07:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:07:52,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:07:52,200 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] [2024-11-07 01:07:52,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:07:52,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:07:52,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:07:52,200 INFO L85 PathProgramCache]: Analyzing trace with hash -791516297, now seen corresponding path program 1 times [2024-11-07 01:07:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:07:52,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136850461] [2024-11-07 01:07:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:07:52,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:07:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:07:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:07:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:52,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:07:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:52,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:07:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:52,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:07:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:07:52,287 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 01:07:52,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:07:52,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136850461] [2024-11-07 01:07:52,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136850461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:07:52,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:07:52,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:07:52,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706983760] [2024-11-07 01:07:52,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:07:52,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:07:52,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:07:52,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:07:52,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:07:52,289 INFO L87 Difference]: Start difference. First operand 49584 states and 81020 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 01:07:57,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:07:57,386 INFO L93 Difference]: Finished difference Result 137775 states and 222018 transitions. [2024-11-07 01:07:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:07:57,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 101 [2024-11-07 01:07:57,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:07:57,660 INFO L225 Difference]: With dead ends: 137775 [2024-11-07 01:07:57,660 INFO L226 Difference]: Without dead ends: 90326 [2024-11-07 01:07:57,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:07:57,778 INFO L432 NwaCegarLoop]: 4309 mSDtfsCounter, 4947 mSDsluCounter, 12534 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4978 SdHoareTripleChecker+Valid, 16843 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:07:57,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4978 Valid, 16843 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:07:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90326 states. [2024-11-07 01:08:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90326 to 73121. [2024-11-07 01:08:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73121 states, 65713 states have (on average 1.5070381811818057) internal successors, (99032), 66228 states have internal predecessors, (99032), 4706 states have call successors, (4706), 2316 states have call predecessors, (4706), 2700 states have return successors, (13711), 4832 states have call predecessors, (13711), 4706 states have call successors, (13711) [2024-11-07 01:08:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73121 states to 73121 states and 117449 transitions. [2024-11-07 01:08:01,425 INFO L78 Accepts]: Start accepts. Automaton has 73121 states and 117449 transitions. Word has length 101 [2024-11-07 01:08:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:08:01,425 INFO L471 AbstractCegarLoop]: Abstraction has 73121 states and 117449 transitions. [2024-11-07 01:08:01,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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 01:08:01,425 INFO L276 IsEmpty]: Start isEmpty. Operand 73121 states and 117449 transitions. [2024-11-07 01:08:01,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 01:08:01,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:08:01,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:08:01,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:08:01,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:08:01,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:08:01,577 INFO L85 PathProgramCache]: Analyzing trace with hash 222823872, now seen corresponding path program 1 times [2024-11-07 01:08:01,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:08:01,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120220726] [2024-11-07 01:08:01,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:08:01,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:08:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:08:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:08:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:08:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:01,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:08:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:01,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:08:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:01,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 01:08:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:01,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:08:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:01,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 01:08:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:01,745 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 01:08:01,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:08:01,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120220726] [2024-11-07 01:08:01,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120220726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:08:01,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405449965] [2024-11-07 01:08:01,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:08:01,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:08:01,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:08:01,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:08:01,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 01:08:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:01,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:08:01,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:08:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 01:08:01,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:08:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405449965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:08:01,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:08:01,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 01:08:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881806205] [2024-11-07 01:08:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:08:01,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:08:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:08:01,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:08:01,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:08:01,991 INFO L87 Difference]: Start difference. First operand 73121 states and 117449 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:08:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:08:06,765 INFO L93 Difference]: Finished difference Result 213738 states and 344389 transitions. [2024-11-07 01:08:06,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:08:06,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 165 [2024-11-07 01:08:06,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:08:07,308 INFO L225 Difference]: With dead ends: 213738 [2024-11-07 01:08:07,308 INFO L226 Difference]: Without dead ends: 142752 [2024-11-07 01:08:07,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:08:07,659 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 4198 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4198 SdHoareTripleChecker+Valid, 4547 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:08:07,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4198 Valid, 4547 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:08:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142752 states. [2024-11-07 01:08:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142752 to 141978. [2024-11-07 01:08:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141978 states, 127362 states have (on average 1.4996545280381903) internal successors, (190999), 128390 states have internal predecessors, (190999), 9214 states have call successors, (9214), 4632 states have call predecessors, (9214), 5400 states have return successors, (26969), 9211 states have call predecessors, (26969), 9214 states have call successors, (26969) [2024-11-07 01:08:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141978 states to 141978 states and 227182 transitions. [2024-11-07 01:08:13,428 INFO L78 Accepts]: Start accepts. Automaton has 141978 states and 227182 transitions. Word has length 165 [2024-11-07 01:08:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:08:13,429 INFO L471 AbstractCegarLoop]: Abstraction has 141978 states and 227182 transitions. [2024-11-07 01:08:13,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:08:13,429 INFO L276 IsEmpty]: Start isEmpty. Operand 141978 states and 227182 transitions. [2024-11-07 01:08:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 01:08:13,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:08:13,614 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:08:13,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 01:08:13,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 01:08:13,815 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:08:13,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:08:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash -837788448, now seen corresponding path program 1 times [2024-11-07 01:08:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:08:13,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287443390] [2024-11-07 01:08:13,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:08:13,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:08:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:14,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:08:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:14,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:08:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:14,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:08:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:14,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:08:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:14,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:08:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:14,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 01:08:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:14,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:08:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:14,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 01:08:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 01:08:14,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:08:14,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287443390] [2024-11-07 01:08:14,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287443390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:08:14,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166954868] [2024-11-07 01:08:14,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:08:14,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:08:14,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:08:14,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:08:14,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 01:08:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:08:14,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:08:14,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:08:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 01:08:14,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:08:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166954868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:08:14,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:08:14,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 01:08:14,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305621045] [2024-11-07 01:08:14,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:08:14,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:08:14,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:08:14,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:08:14,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:08:14,384 INFO L87 Difference]: Start difference. First operand 141978 states and 227182 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)