./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '74f9bd5bd4d02445cc8b51e0daba1f22f33c6c5b4db852fb1ac615d474112387'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74f9bd5bd4d02445cc8b51e0daba1f22f33c6c5b4db852fb1ac615d474112387 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:55:10,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:55:10,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:55:10,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:55:10,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:55:10,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:55:10,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:55:10,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:55:10,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:55:10,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:55:10,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:55:10,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:55:10,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:55:10,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:55:10,867 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:55:10,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:55:10,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:55:10,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:55:10,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:55:10,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:55:10,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:55:10,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:55:10,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:55:10,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:55:10,867 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:55:10,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:55:10,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:55:10,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:55:10,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:55:10,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:55:10,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:55:10,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:55:10,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:55:10,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:55:10,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:55:10,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:55:10,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:55:10,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:55:10,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:55:10,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:55:10,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:55:10,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:55:10,870 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 -> 74f9bd5bd4d02445cc8b51e0daba1f22f33c6c5b4db852fb1ac615d474112387 [2024-11-07 00:55:11,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:55:11,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:55:11,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:55:11,073 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:55:11,073 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:55:11,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c [2024-11-07 00:55:12,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:55:12,693 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:55:12,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c [2024-11-07 00:55:12,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5826a4f84/1e7c9b9a9bca41a1a295e7f9bb0c701d/FLAG28bd38b0f [2024-11-07 00:55:13,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5826a4f84/1e7c9b9a9bca41a1a295e7f9bb0c701d [2024-11-07 00:55:13,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:55:13,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:55:13,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:55:13,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:55:13,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:55:13,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:55:13" (1/1) ... [2024-11-07 00:55:13,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5176bb4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:13, skipping insertion in model container [2024-11-07 00:55:13,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:55:13" (1/1) ... [2024-11-07 00:55:13,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:55:14,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c[377069,377082] [2024-11-07 00:55:14,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c[383339,383352] [2024-11-07 00:55:14,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:55:14,469 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:55:15,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c[377069,377082] [2024-11-07 00:55:15,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.11.cil-2.c[383339,383352] [2024-11-07 00:55:15,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:55:15,128 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:55:15,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15 WrapperNode [2024-11-07 00:55:15,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:55:15,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:55:15,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:55:15,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:55:15,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (1/1) ... [2024-11-07 00:55:15,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (1/1) ... [2024-11-07 00:55:15,518 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13173 [2024-11-07 00:55:15,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:55:15,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:55:15,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:55:15,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:55:15,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (1/1) ... [2024-11-07 00:55:15,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (1/1) ... [2024-11-07 00:55:15,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (1/1) ... [2024-11-07 00:55:15,691 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 00:55:15,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (1/1) ... [2024-11-07 00:55:15,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (1/1) ... [2024-11-07 00:55:15,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (1/1) ... [2024-11-07 00:55:15,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (1/1) ... [2024-11-07 00:55:15,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (1/1) ... [2024-11-07 00:55:15,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (1/1) ... [2024-11-07 00:55:15,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:55:15,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:55:15,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:55:15,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:55:15,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (1/1) ... [2024-11-07 00:55:15,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:55:15,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:55:15,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:55:15,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:55:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:55:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:55:15,942 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:55:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:55:15,942 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:55:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:55:15,942 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:55:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:55:15,942 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:55:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:55:15,942 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:55:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:55:15,943 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:55:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:55:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:55:15,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:55:16,034 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:55:16,035 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:55:22,011 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2024-11-07 00:55:22,011 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:55:22,049 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:55:22,049 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-07 00:55:22,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:55:22 BoogieIcfgContainer [2024-11-07 00:55:22,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:55:22,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:55:22,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:55:22,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:55:22,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:55:13" (1/3) ... [2024-11-07 00:55:22,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7751deef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:55:22, skipping insertion in model container [2024-11-07 00:55:22,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:15" (2/3) ... [2024-11-07 00:55:22,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7751deef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:55:22, skipping insertion in model container [2024-11-07 00:55:22,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:55:22" (3/3) ... [2024-11-07 00:55:22,057 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.11.cil-2.c [2024-11-07 00:55:22,067 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:55:22,068 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:55:22,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:55:22,140 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;@7135f41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:55:22,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:55:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 2552 states, 2518 states have (on average 1.8403494837172358) internal successors, (4634), 2521 states have internal predecessors, (4634), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 00:55:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:55:22,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:22,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:55:22,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:22,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1612781040, now seen corresponding path program 1 times [2024-11-07 00:55:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281721812] [2024-11-07 00:55:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:22,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:55:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:22,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:55:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:22,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:55:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:22,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:55:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:22,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281721812] [2024-11-07 00:55:22,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281721812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:22,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:22,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:55:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955844164] [2024-11-07 00:55:22,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:22,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:55:22,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:55:22,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:55:22,665 INFO L87 Difference]: Start difference. First operand has 2552 states, 2518 states have (on average 1.8403494837172358) internal successors, (4634), 2521 states have internal predecessors, (4634), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:24,047 INFO L93 Difference]: Finished difference Result 5223 states and 9571 transitions. [2024-11-07 00:55:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:55:24,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 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 167 [2024-11-07 00:55:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:24,070 INFO L225 Difference]: With dead ends: 5223 [2024-11-07 00:55:24,071 INFO L226 Difference]: Without dead ends: 2616 [2024-11-07 00:55:24,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:55:24,079 INFO L432 NwaCegarLoop]: 4360 mSDtfsCounter, 969 mSDsluCounter, 12463 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 16823 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:24,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 16823 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:55:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2024-11-07 00:55:24,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2485. [2024-11-07 00:55:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2485 states, 2452 states have (on average 1.8242251223491028) internal successors, (4473), 2454 states have internal predecessors, (4473), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 00:55:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 4523 transitions. [2024-11-07 00:55:24,181 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 4523 transitions. Word has length 167 [2024-11-07 00:55:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:24,182 INFO L471 AbstractCegarLoop]: Abstraction has 2485 states and 4523 transitions. [2024-11-07 00:55:24,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 4523 transitions. [2024-11-07 00:55:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:55:24,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:24,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:55:24,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:55:24,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:24,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash 787852370, now seen corresponding path program 1 times [2024-11-07 00:55:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:24,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474339217] [2024-11-07 00:55:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:24,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:24,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:24,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:55:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:24,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:55:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:24,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:55:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:24,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:55:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:24,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:24,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474339217] [2024-11-07 00:55:24,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474339217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:24,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:24,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:55:24,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657951219] [2024-11-07 00:55:24,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:24,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:55:24,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:24,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:55:24,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:55:24,523 INFO L87 Difference]: Start difference. First operand 2485 states and 4523 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:26,974 INFO L93 Difference]: Finished difference Result 3453 states and 6074 transitions. [2024-11-07 00:55:26,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:55:26,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 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 167 [2024-11-07 00:55:26,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:26,987 INFO L225 Difference]: With dead ends: 3453 [2024-11-07 00:55:26,987 INFO L226 Difference]: Without dead ends: 3108 [2024-11-07 00:55:26,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:55:26,989 INFO L432 NwaCegarLoop]: 4310 mSDtfsCounter, 5415 mSDsluCounter, 12898 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5433 SdHoareTripleChecker+Valid, 17208 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:26,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5433 Valid, 17208 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 00:55:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2024-11-07 00:55:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2847. [2024-11-07 00:55:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2787 states have (on average 1.794043774668102) internal successors, (5000), 2790 states have internal predecessors, (5000), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-11-07 00:55:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 5093 transitions. [2024-11-07 00:55:27,054 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 5093 transitions. Word has length 167 [2024-11-07 00:55:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:27,054 INFO L471 AbstractCegarLoop]: Abstraction has 2847 states and 5093 transitions. [2024-11-07 00:55:27,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 5093 transitions. [2024-11-07 00:55:27,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:55:27,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:27,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:55:27,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:55:27,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:27,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:27,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1787438550, now seen corresponding path program 1 times [2024-11-07 00:55:27,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:27,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831472917] [2024-11-07 00:55:27,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:27,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:27,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:27,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:55:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:27,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:55:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:27,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:55:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:55:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:27,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:27,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831472917] [2024-11-07 00:55:27,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831472917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:27,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:27,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:27,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797859700] [2024-11-07 00:55:27,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:27,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:27,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:27,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:27,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:27,288 INFO L87 Difference]: Start difference. First operand 2847 states and 5093 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:29,993 INFO L93 Difference]: Finished difference Result 4325 states and 7463 transitions. [2024-11-07 00:55:29,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:29,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 00:55:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:30,006 INFO L225 Difference]: With dead ends: 4325 [2024-11-07 00:55:30,006 INFO L226 Difference]: Without dead ends: 3618 [2024-11-07 00:55:30,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:30,010 INFO L432 NwaCegarLoop]: 4497 mSDtfsCounter, 5444 mSDsluCounter, 17684 mSDsCounter, 0 mSdLazyCounter, 3327 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5462 SdHoareTripleChecker+Valid, 22181 SdHoareTripleChecker+Invalid, 3386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:30,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5462 Valid, 22181 Invalid, 3386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3327 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 00:55:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3618 states. [2024-11-07 00:55:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3618 to 3184. [2024-11-07 00:55:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3184 states, 3097 states have (on average 1.7684856312560542) internal successors, (5477), 3101 states have internal predecessors, (5477), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-11-07 00:55:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 5612 transitions. [2024-11-07 00:55:30,090 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 5612 transitions. Word has length 167 [2024-11-07 00:55:30,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:30,090 INFO L471 AbstractCegarLoop]: Abstraction has 3184 states and 5612 transitions. [2024-11-07 00:55:30,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 5612 transitions. [2024-11-07 00:55:30,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:55:30,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:30,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:55:30,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:55:30,093 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:30,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:30,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2125726100, now seen corresponding path program 1 times [2024-11-07 00:55:30,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:30,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032373657] [2024-11-07 00:55:30,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:30,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:55:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:30,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:55:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:30,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:55:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:30,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:55:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:30,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:30,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032373657] [2024-11-07 00:55:30,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032373657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:30,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:30,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:30,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87635217] [2024-11-07 00:55:30,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:30,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:30,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:30,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:30,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:30,450 INFO L87 Difference]: Start difference. First operand 3184 states and 5612 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:32,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:32,966 INFO L93 Difference]: Finished difference Result 5611 states and 9494 transitions. [2024-11-07 00:55:32,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:32,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 00:55:32,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:32,981 INFO L225 Difference]: With dead ends: 5611 [2024-11-07 00:55:32,981 INFO L226 Difference]: Without dead ends: 4567 [2024-11-07 00:55:32,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:32,985 INFO L432 NwaCegarLoop]: 4495 mSDtfsCounter, 5442 mSDsluCounter, 17684 mSDsCounter, 0 mSdLazyCounter, 3323 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5460 SdHoareTripleChecker+Valid, 22179 SdHoareTripleChecker+Invalid, 3384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:32,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5460 Valid, 22179 Invalid, 3384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3323 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:55:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4567 states. [2024-11-07 00:55:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4567 to 3859. [2024-11-07 00:55:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3859 states, 3718 states have (on average 1.7299623453469608) internal successors, (6432), 3724 states have internal predecessors, (6432), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-11-07 00:55:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 6655 transitions. [2024-11-07 00:55:33,113 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 6655 transitions. Word has length 167 [2024-11-07 00:55:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:33,113 INFO L471 AbstractCegarLoop]: Abstraction has 3859 states and 6655 transitions. [2024-11-07 00:55:33,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 6655 transitions. [2024-11-07 00:55:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:55:33,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:33,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:55:33,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:55:33,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:33,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1742686698, now seen corresponding path program 1 times [2024-11-07 00:55:33,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:33,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525290474] [2024-11-07 00:55:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:33,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:33,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:33,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:55:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:33,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:55:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:33,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:55:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:33,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:55:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:33,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:33,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525290474] [2024-11-07 00:55:33,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525290474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:33,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:33,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:33,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255170403] [2024-11-07 00:55:33,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:33,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:33,328 INFO L87 Difference]: Start difference. First operand 3859 states and 6655 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:35,868 INFO L93 Difference]: Finished difference Result 8086 states and 13377 transitions. [2024-11-07 00:55:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:35,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 00:55:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:35,886 INFO L225 Difference]: With dead ends: 8086 [2024-11-07 00:55:35,886 INFO L226 Difference]: Without dead ends: 6367 [2024-11-07 00:55:35,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:35,891 INFO L432 NwaCegarLoop]: 4495 mSDtfsCounter, 5438 mSDsluCounter, 17684 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5456 SdHoareTripleChecker+Valid, 22179 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:35,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5456 Valid, 22179 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:55:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6367 states. [2024-11-07 00:55:36,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6367 to 5210. [2024-11-07 00:55:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5210 states, 4961 states have (on average 1.681515823422697) internal successors, (8342), 4971 states have internal predecessors, (8342), 185 states have call successors, (185), 54 states have call predecessors, (185), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-11-07 00:55:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5210 states to 5210 states and 8747 transitions. [2024-11-07 00:55:36,037 INFO L78 Accepts]: Start accepts. Automaton has 5210 states and 8747 transitions. Word has length 167 [2024-11-07 00:55:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:36,037 INFO L471 AbstractCegarLoop]: Abstraction has 5210 states and 8747 transitions. [2024-11-07 00:55:36,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 5210 states and 8747 transitions. [2024-11-07 00:55:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:55:36,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:36,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:55:36,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:55:36,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:36,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2011851092, now seen corresponding path program 1 times [2024-11-07 00:55:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:36,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592543520] [2024-11-07 00:55:36,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:36,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:36,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:55:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:36,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:55:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:36,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:55:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:36,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:55:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:36,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:36,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:36,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592543520] [2024-11-07 00:55:36,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592543520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:36,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:36,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:36,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531615153] [2024-11-07 00:55:36,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:36,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:36,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:36,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:36,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:36,260 INFO L87 Difference]: Start difference. First operand 5210 states and 8747 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:38,934 INFO L93 Difference]: Finished difference Result 13035 states and 21159 transitions. [2024-11-07 00:55:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:38,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 00:55:38,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:38,962 INFO L225 Difference]: With dead ends: 13035 [2024-11-07 00:55:38,962 INFO L226 Difference]: Without dead ends: 9965 [2024-11-07 00:55:38,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:38,970 INFO L432 NwaCegarLoop]: 4495 mSDtfsCounter, 5434 mSDsluCounter, 17684 mSDsCounter, 0 mSdLazyCounter, 3305 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5452 SdHoareTripleChecker+Valid, 22179 SdHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:38,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5452 Valid, 22179 Invalid, 3366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3305 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:55:38,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9965 states. [2024-11-07 00:55:39,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9965 to 7917. [2024-11-07 00:55:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7917 states, 7452 states have (on average 1.6328502415458936) internal successors, (12168), 7470 states have internal predecessors, (12168), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-11-07 00:55:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7917 states to 7917 states and 12955 transitions. [2024-11-07 00:55:39,230 INFO L78 Accepts]: Start accepts. Automaton has 7917 states and 12955 transitions. Word has length 167 [2024-11-07 00:55:39,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:39,230 INFO L471 AbstractCegarLoop]: Abstraction has 7917 states and 12955 transitions. [2024-11-07 00:55:39,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 7917 states and 12955 transitions. [2024-11-07 00:55:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:55:39,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:39,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:55:39,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:55:39,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:39,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:39,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1855870550, now seen corresponding path program 1 times [2024-11-07 00:55:39,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:39,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853138980] [2024-11-07 00:55:39,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:39,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:39,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:39,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:55:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:39,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:55:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:39,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:55:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:55:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:39,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:39,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853138980] [2024-11-07 00:55:39,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853138980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:39,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:39,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:39,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084177240] [2024-11-07 00:55:39,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:39,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:39,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:39,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:39,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:39,443 INFO L87 Difference]: Start difference. First operand 7917 states and 12955 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:42,300 INFO L93 Difference]: Finished difference Result 22932 states and 36781 transitions. [2024-11-07 00:55:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 00:55:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:42,338 INFO L225 Difference]: With dead ends: 22932 [2024-11-07 00:55:42,339 INFO L226 Difference]: Without dead ends: 17155 [2024-11-07 00:55:42,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:42,353 INFO L432 NwaCegarLoop]: 4495 mSDtfsCounter, 5436 mSDsluCounter, 17684 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5454 SdHoareTripleChecker+Valid, 22179 SdHoareTripleChecker+Invalid, 3352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:42,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5454 Valid, 22179 Invalid, 3352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:55:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17155 states. [2024-11-07 00:55:42,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17155 to 13344. [2024-11-07 00:55:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13344 states, 12447 states have (on average 1.593797702257572) internal successors, (19838), 12481 states have internal predecessors, (19838), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-11-07 00:55:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13344 states to 13344 states and 21443 transitions. [2024-11-07 00:55:42,905 INFO L78 Accepts]: Start accepts. Automaton has 13344 states and 21443 transitions. Word has length 167 [2024-11-07 00:55:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:42,906 INFO L471 AbstractCegarLoop]: Abstraction has 13344 states and 21443 transitions. [2024-11-07 00:55:42,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand 13344 states and 21443 transitions. [2024-11-07 00:55:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:55:42,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:42,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:55:42,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:55:42,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:42,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:42,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2028486380, now seen corresponding path program 1 times [2024-11-07 00:55:42,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:42,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941533005] [2024-11-07 00:55:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:42,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:55:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:55:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:55:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:55:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:43,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:43,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941533005] [2024-11-07 00:55:43,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941533005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:43,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:43,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:43,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095737214] [2024-11-07 00:55:43,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:43,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:43,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:43,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:43,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:43,200 INFO L87 Difference]: Start difference. First operand 13344 states and 21443 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:45,062 INFO L93 Difference]: Finished difference Result 28566 states and 45888 transitions. [2024-11-07 00:55:45,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:55:45,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 00:55:45,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:45,104 INFO L225 Difference]: With dead ends: 28566 [2024-11-07 00:55:45,104 INFO L226 Difference]: Without dead ends: 17362 [2024-11-07 00:55:45,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:55:45,128 INFO L432 NwaCegarLoop]: 4248 mSDtfsCounter, 5029 mSDsluCounter, 16747 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5048 SdHoareTripleChecker+Valid, 20995 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:45,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5048 Valid, 20995 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:55:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17362 states. [2024-11-07 00:55:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17362 to 13344. [2024-11-07 00:55:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13344 states, 12447 states have (on average 1.591146460994617) internal successors, (19805), 12481 states have internal predecessors, (19805), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-11-07 00:55:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13344 states to 13344 states and 21410 transitions. [2024-11-07 00:55:45,570 INFO L78 Accepts]: Start accepts. Automaton has 13344 states and 21410 transitions. Word has length 167 [2024-11-07 00:55:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:45,570 INFO L471 AbstractCegarLoop]: Abstraction has 13344 states and 21410 transitions. [2024-11-07 00:55:45,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 13344 states and 21410 transitions. [2024-11-07 00:55:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:55:45,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:45,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:55:45,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:55:45,578 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:45,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:45,578 INFO L85 PathProgramCache]: Analyzing trace with hash 130597714, now seen corresponding path program 1 times [2024-11-07 00:55:45,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:45,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399775463] [2024-11-07 00:55:45,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:45,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:55:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:55:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:55:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:55:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:45,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:45,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399775463] [2024-11-07 00:55:45,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399775463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:45,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:45,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:45,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260762751] [2024-11-07 00:55:45,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:45,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:45,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:45,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:45,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:45,760 INFO L87 Difference]: Start difference. First operand 13344 states and 21410 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:49,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:49,215 INFO L93 Difference]: Finished difference Result 42660 states and 67923 transitions. [2024-11-07 00:55:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:49,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 00:55:49,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:49,299 INFO L225 Difference]: With dead ends: 42660 [2024-11-07 00:55:49,300 INFO L226 Difference]: Without dead ends: 31456 [2024-11-07 00:55:49,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:49,333 INFO L432 NwaCegarLoop]: 4495 mSDtfsCounter, 5425 mSDsluCounter, 17684 mSDsCounter, 0 mSdLazyCounter, 3238 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5443 SdHoareTripleChecker+Valid, 22179 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:49,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5443 Valid, 22179 Invalid, 3299 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3238 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:55:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31456 states. [2024-11-07 00:55:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31456 to 24293. [2024-11-07 00:55:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24293 states, 22532 states have (on average 1.5646635895615124) internal successors, (35255), 22598 states have internal predecessors, (35255), 1305 states have call successors, (1305), 390 states have call predecessors, (1305), 454 states have return successors, (2098), 1368 states have call predecessors, (2098), 1305 states have call successors, (2098) [2024-11-07 00:55:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24293 states to 24293 states and 38658 transitions. [2024-11-07 00:55:50,479 INFO L78 Accepts]: Start accepts. Automaton has 24293 states and 38658 transitions. Word has length 167 [2024-11-07 00:55:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:50,479 INFO L471 AbstractCegarLoop]: Abstraction has 24293 states and 38658 transitions. [2024-11-07 00:55:50,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 24293 states and 38658 transitions. [2024-11-07 00:55:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:55:50,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:50,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:55:50,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:55:50,489 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:50,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:50,490 INFO L85 PathProgramCache]: Analyzing trace with hash 200245588, now seen corresponding path program 1 times [2024-11-07 00:55:50,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:50,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166963389] [2024-11-07 00:55:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:50,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:50,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:50,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:55:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:55:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:50,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:55:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:50,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:55:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:50,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:50,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166963389] [2024-11-07 00:55:50,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166963389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:50,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:50,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:50,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757843621] [2024-11-07 00:55:50,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:50,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:50,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:50,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:50,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:50,671 INFO L87 Difference]: Start difference. First operand 24293 states and 38658 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:55,062 INFO L93 Difference]: Finished difference Result 82251 states and 131209 transitions. [2024-11-07 00:55:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:55,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 00:55:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:55,223 INFO L225 Difference]: With dead ends: 82251 [2024-11-07 00:55:55,223 INFO L226 Difference]: Without dead ends: 60098 [2024-11-07 00:55:55,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:55,275 INFO L432 NwaCegarLoop]: 4495 mSDtfsCounter, 5424 mSDsluCounter, 17684 mSDsCounter, 0 mSdLazyCounter, 3225 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5442 SdHoareTripleChecker+Valid, 22179 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:55,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5442 Valid, 22179 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3225 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:55:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60098 states. [2024-11-07 00:55:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60098 to 46250. [2024-11-07 00:55:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46250 states, 42761 states have (on average 1.549098477584715) internal successors, (66241), 42891 states have internal predecessors, (66241), 2585 states have call successors, (2585), 774 states have call predecessors, (2585), 902 states have return successors, (4900), 2712 states have call predecessors, (4900), 2585 states have call successors, (4900) [2024-11-07 00:55:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46250 states to 46250 states and 73726 transitions. [2024-11-07 00:55:57,132 INFO L78 Accepts]: Start accepts. Automaton has 46250 states and 73726 transitions. Word has length 167 [2024-11-07 00:55:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:57,132 INFO L471 AbstractCegarLoop]: Abstraction has 46250 states and 73726 transitions. [2024-11-07 00:55:57,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 46250 states and 73726 transitions. [2024-11-07 00:55:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:55:57,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:57,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:55:57,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:55:57,152 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:57,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:57,153 INFO L85 PathProgramCache]: Analyzing trace with hash 618134290, now seen corresponding path program 1 times [2024-11-07 00:55:57,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:57,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892477663] [2024-11-07 00:55:57,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:57,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:57,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:57,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:55:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:57,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:55:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:57,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:55:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:57,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:55:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:57,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:57,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892477663] [2024-11-07 00:55:57,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892477663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:57,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:57,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:57,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880169189] [2024-11-07 00:55:57,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:57,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:57,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:57,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:57,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:57,338 INFO L87 Difference]: Start difference. First operand 46250 states and 73726 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:56:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:04,206 INFO L93 Difference]: Finished difference Result 161430 states and 259623 transitions. [2024-11-07 00:56:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:56:04,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 00:56:04,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:04,615 INFO L225 Difference]: With dead ends: 161430 [2024-11-07 00:56:04,616 INFO L226 Difference]: Without dead ends: 117320 [2024-11-07 00:56:04,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:56:04,739 INFO L432 NwaCegarLoop]: 4495 mSDtfsCounter, 5423 mSDsluCounter, 17684 mSDsCounter, 0 mSdLazyCounter, 3212 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5441 SdHoareTripleChecker+Valid, 22179 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:04,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5441 Valid, 22179 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3212 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 00:56:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117320 states. [2024-11-07 00:56:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117320 to 90291. [2024-11-07 00:56:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90291 states, 83346 states have (on average 1.5406018285220646) internal successors, (128403), 83604 states have internal predecessors, (128403), 5145 states have call successors, (5145), 1542 states have call predecessors, (5145), 1798 states have return successors, (11962), 5400 states have call predecessors, (11962), 5145 states have call successors, (11962) [2024-11-07 00:56:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90291 states to 90291 states and 145510 transitions. [2024-11-07 00:56:08,644 INFO L78 Accepts]: Start accepts. Automaton has 90291 states and 145510 transitions. Word has length 167 [2024-11-07 00:56:08,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:08,644 INFO L471 AbstractCegarLoop]: Abstraction has 90291 states and 145510 transitions. [2024-11-07 00:56:08,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:56:08,645 INFO L276 IsEmpty]: Start isEmpty. Operand 90291 states and 145510 transitions. [2024-11-07 00:56:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:56:08,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:08,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:56:08,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:56:08,677 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:08,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:08,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2017087892, now seen corresponding path program 1 times [2024-11-07 00:56:08,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:08,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049405712] [2024-11-07 00:56:08,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:08,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:08,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:08,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:56:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:08,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:56:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:08,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:56:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:08,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:56:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:08,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:08,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049405712] [2024-11-07 00:56:08,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049405712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:08,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:08,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:08,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239109206] [2024-11-07 00:56:08,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:08,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:08,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:08,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:08,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:08,838 INFO L87 Difference]: Start difference. First operand 90291 states and 145510 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:56:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:15,081 INFO L93 Difference]: Finished difference Result 207092 states and 340835 transitions. [2024-11-07 00:56:15,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:56:15,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2024-11-07 00:56:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:15,530 INFO L225 Difference]: With dead ends: 207092 [2024-11-07 00:56:15,530 INFO L226 Difference]: Without dead ends: 118941 [2024-11-07 00:56:15,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:56:15,759 INFO L432 NwaCegarLoop]: 4248 mSDtfsCounter, 5184 mSDsluCounter, 12596 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5203 SdHoareTripleChecker+Valid, 16844 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:15,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5203 Valid, 16844 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:56:15,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118941 states. [2024-11-07 00:56:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118941 to 90291. [2024-11-07 00:56:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90291 states, 83346 states have (on average 1.5375182972188228) internal successors, (128146), 83604 states have internal predecessors, (128146), 5145 states have call successors, (5145), 1542 states have call predecessors, (5145), 1798 states have return successors, (11962), 5400 states have call predecessors, (11962), 5145 states have call successors, (11962) [2024-11-07 00:56:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90291 states to 90291 states and 145253 transitions. [2024-11-07 00:56:19,779 INFO L78 Accepts]: Start accepts. Automaton has 90291 states and 145253 transitions. Word has length 167 [2024-11-07 00:56:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:19,779 INFO L471 AbstractCegarLoop]: Abstraction has 90291 states and 145253 transitions. [2024-11-07 00:56:19,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:56:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 90291 states and 145253 transitions. [2024-11-07 00:56:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 00:56:19,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:19,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:56:19,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:56:19,808 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:19,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:19,809 INFO L85 PathProgramCache]: Analyzing trace with hash 399647442, now seen corresponding path program 1 times [2024-11-07 00:56:19,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:19,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852613345] [2024-11-07 00:56:19,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:19,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:56:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:56:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:56:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:56:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:19,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:19,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852613345] [2024-11-07 00:56:19,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852613345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:19,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:19,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:19,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292116142] [2024-11-07 00:56:19,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:19,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:19,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:19,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:19,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:19,972 INFO L87 Difference]: Start difference. First operand 90291 states and 145253 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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)