./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'e7f05adfe3188223e40d6d03e9bb9b8e606803720f2852bb7411adc46181c52f'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e7f05adfe3188223e40d6d03e9bb9b8e606803720f2852bb7411adc46181c52f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:58:12,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:58:12,499 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:58:12,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:58:12,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:58:12,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:58:12,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:58:12,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:58:12,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:58:12,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:58:12,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:58:12,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:58:12,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:58:12,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:58:12,539 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:58:12,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:58:12,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:58:12,539 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:58:12,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:58:12,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:58:12,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:58:12,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:58:12,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:58:12,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:58:12,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:58:12,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:58:12,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:58:12,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:58:12,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:58:12,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:58:12,541 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 -> e7f05adfe3188223e40d6d03e9bb9b8e606803720f2852bb7411adc46181c52f [2024-11-07 00:58:12,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:58:12,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:58:12,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:58:12,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:58:12,846 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:58:12,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c [2024-11-07 00:58:14,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:58:14,669 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:58:14,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c [2024-11-07 00:58:14,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5891b3f1f/7b218a368c4e4f4c8e0288155da4b7c4/FLAGb5cdf87c7 [2024-11-07 00:58:14,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5891b3f1f/7b218a368c4e4f4c8e0288155da4b7c4 [2024-11-07 00:58:14,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:58:14,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:58:14,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:58:14,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:58:14,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:58:14,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:58:14" (1/1) ... [2024-11-07 00:58:14,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be0beb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:14, skipping insertion in model container [2024-11-07 00:58:14,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:58:14" (1/1) ... [2024-11-07 00:58:14,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:58:16,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c[378560,378573] [2024-11-07 00:58:16,167 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c[383339,383352] [2024-11-07 00:58:16,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:58:16,450 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:58:17,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c[378560,378573] [2024-11-07 00:58:17,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.12.cil-1.c[383339,383352] [2024-11-07 00:58:17,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:58:17,267 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:58:17,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:17 WrapperNode [2024-11-07 00:58:17,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:58:17,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:58:17,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:58:17,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:58:17,276 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:58:17" (1/1) ... [2024-11-07 00:58:17,332 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:58:17" (1/1) ... [2024-11-07 00:58:17,774 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13239 [2024-11-07 00:58:17,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:58:17,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:58:17,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:58:17,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:58:17,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:17" (1/1) ... [2024-11-07 00:58:17,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:17" (1/1) ... [2024-11-07 00:58:17,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:17" (1/1) ... [2024-11-07 00:58:17,981 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:58:17,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:17" (1/1) ... [2024-11-07 00:58:17,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:17" (1/1) ... [2024-11-07 00:58:18,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:17" (1/1) ... [2024-11-07 00:58:18,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:17" (1/1) ... [2024-11-07 00:58:18,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:17" (1/1) ... [2024-11-07 00:58:18,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:17" (1/1) ... [2024-11-07 00:58:18,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:58:18,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:58:18,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:58:18,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:58:18,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:17" (1/1) ... [2024-11-07 00:58:18,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:58:18,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:58:18,470 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:58:18,473 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:58:18,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:58:18,497 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:58:18,497 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:58:18,497 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:58:18,497 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:58:18,497 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:58:18,498 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:58:18,498 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-07 00:58:18,498 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-07 00:58:18,498 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:58:18,498 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:58:18,498 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:58:18,498 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:58:18,498 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:58:18,498 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:58:18,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:58:18,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:58:18,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:58:18,662 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:58:18,664 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:58:26,869 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2024-11-07 00:58:26,870 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:58:26,941 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:58:26,944 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-07 00:58:26,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:58:26 BoogieIcfgContainer [2024-11-07 00:58:26,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:58:26,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:58:26,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:58:26,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:58:26,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:58:14" (1/3) ... [2024-11-07 00:58:26,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dafabf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:58:26, skipping insertion in model container [2024-11-07 00:58:26,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:17" (2/3) ... [2024-11-07 00:58:26,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dafabf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:58:26, skipping insertion in model container [2024-11-07 00:58:26,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:58:26" (3/3) ... [2024-11-07 00:58:26,957 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.12.cil-1.c [2024-11-07 00:58:26,972 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:58:26,973 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:58:27,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:58:27,091 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;@118b4bcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:58:27,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:58:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 2586 states, 2548 states have (on average 1.8390894819466248) internal successors, (4686), 2553 states have internal predecessors, (4686), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 00:58:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 00:58:27,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:27,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:27,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:27,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:27,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1115616810, now seen corresponding path program 1 times [2024-11-07 00:58:27,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343058996] [2024-11-07 00:58:27,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:27,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:27,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:27,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:58:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:27,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:58:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:58:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:27,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:58:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:27,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:27,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343058996] [2024-11-07 00:58:27,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343058996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:27,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:27,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:58:27,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089470700] [2024-11-07 00:58:27,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:27,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:58:27,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:28,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:58:28,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:58:28,047 INFO L87 Difference]: Start difference. First operand has 2586 states, 2548 states have (on average 1.8390894819466248) internal successors, (4686), 2553 states have internal predecessors, (4686), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:30,080 INFO L93 Difference]: Finished difference Result 5307 states and 9718 transitions. [2024-11-07 00:58:30,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:58:30,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2024-11-07 00:58:30,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:30,110 INFO L225 Difference]: With dead ends: 5307 [2024-11-07 00:58:30,110 INFO L226 Difference]: Without dead ends: 2660 [2024-11-07 00:58:30,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:58:30,124 INFO L432 NwaCegarLoop]: 4394 mSDtfsCounter, 1065 mSDsluCounter, 12509 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 16903 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:30,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 16903 Invalid, 1097 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 00:58:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2024-11-07 00:58:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2518. [2024-11-07 00:58:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2482 states have (on average 1.82232070910556) internal successors, (4523), 2485 states have internal predecessors, (4523), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 00:58:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 4577 transitions. [2024-11-07 00:58:30,263 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 4577 transitions. Word has length 179 [2024-11-07 00:58:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:30,263 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 4577 transitions. [2024-11-07 00:58:30,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 4577 transitions. [2024-11-07 00:58:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 00:58:30,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:30,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:30,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:58:30,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:30,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1676252180, now seen corresponding path program 1 times [2024-11-07 00:58:30,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:30,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690607487] [2024-11-07 00:58:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:30,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:30,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:30,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:58:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:58:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:30,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:58:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:30,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:58:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:30,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:30,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690607487] [2024-11-07 00:58:30,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690607487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:30,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:30,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:58:30,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683464981] [2024-11-07 00:58:30,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:30,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:58:30,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:30,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:58:30,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:58:30,622 INFO L87 Difference]: Start difference. First operand 2518 states and 4577 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:32,532 INFO L93 Difference]: Finished difference Result 3042 states and 5416 transitions. [2024-11-07 00:58:32,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:58:32,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2024-11-07 00:58:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:32,548 INFO L225 Difference]: With dead ends: 3042 [2024-11-07 00:58:32,548 INFO L226 Difference]: Without dead ends: 2660 [2024-11-07 00:58:32,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:58:32,552 INFO L432 NwaCegarLoop]: 4324 mSDtfsCounter, 1051 mSDsluCounter, 12306 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 16630 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:32,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 16630 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 00:58:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2024-11-07 00:58:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2518. [2024-11-07 00:58:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2482 states have (on average 1.821917808219178) internal successors, (4522), 2485 states have internal predecessors, (4522), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 00:58:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 4576 transitions. [2024-11-07 00:58:32,646 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 4576 transitions. Word has length 179 [2024-11-07 00:58:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:32,646 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 4576 transitions. [2024-11-07 00:58:32,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 4576 transitions. [2024-11-07 00:58:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 00:58:32,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:32,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:32,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:58:32,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:32,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:32,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2048443310, now seen corresponding path program 1 times [2024-11-07 00:58:32,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:32,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710577287] [2024-11-07 00:58:32,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:32,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:32,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:32,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:58:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:33,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:58:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:33,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:58:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:33,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:58:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:33,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:33,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710577287] [2024-11-07 00:58:33,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710577287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:33,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:33,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:58:33,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029989698] [2024-11-07 00:58:33,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:33,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:58:33,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:33,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:58:33,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:58:33,064 INFO L87 Difference]: Start difference. First operand 2518 states and 4576 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:36,186 INFO L93 Difference]: Finished difference Result 3574 states and 6273 transitions. [2024-11-07 00:58:36,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:58:36,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2024-11-07 00:58:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:36,200 INFO L225 Difference]: With dead ends: 3574 [2024-11-07 00:58:36,200 INFO L226 Difference]: Without dead ends: 3197 [2024-11-07 00:58:36,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:58:36,202 INFO L432 NwaCegarLoop]: 4345 mSDtfsCounter, 5546 mSDsluCounter, 13009 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5565 SdHoareTripleChecker+Valid, 17354 SdHoareTripleChecker+Invalid, 2435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:36,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5565 Valid, 17354 Invalid, 2435 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [116 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:58:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2024-11-07 00:58:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2912. [2024-11-07 00:58:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2848 states have (on average 1.7910814606741574) internal successors, (5101), 2852 states have internal predecessors, (5101), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-11-07 00:58:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 5200 transitions. [2024-11-07 00:58:36,304 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 5200 transitions. Word has length 179 [2024-11-07 00:58:36,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:36,304 INFO L471 AbstractCegarLoop]: Abstraction has 2912 states and 5200 transitions. [2024-11-07 00:58:36,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 5200 transitions. [2024-11-07 00:58:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 00:58:36,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:36,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:36,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:58:36,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:36,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash 662703530, now seen corresponding path program 1 times [2024-11-07 00:58:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:36,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839212544] [2024-11-07 00:58:36,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:36,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:36,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:36,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:58:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:36,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:58:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:58:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:58:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:36,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:36,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839212544] [2024-11-07 00:58:36,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839212544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:36,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:36,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:36,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165277126] [2024-11-07 00:58:36,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:36,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:36,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:36,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:36,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:36,674 INFO L87 Difference]: Start difference. First operand 2912 states and 5200 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:40,265 INFO L93 Difference]: Finished difference Result 4523 states and 7793 transitions. [2024-11-07 00:58:40,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:40,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2024-11-07 00:58:40,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:40,280 INFO L225 Difference]: With dead ends: 4523 [2024-11-07 00:58:40,280 INFO L226 Difference]: Without dead ends: 3752 [2024-11-07 00:58:40,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:40,283 INFO L432 NwaCegarLoop]: 4556 mSDtfsCounter, 5579 mSDsluCounter, 17901 mSDsCounter, 0 mSdLazyCounter, 3597 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5598 SdHoareTripleChecker+Valid, 22457 SdHoareTripleChecker+Invalid, 3662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:40,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5598 Valid, 22457 Invalid, 3662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3597 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 00:58:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2024-11-07 00:58:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 3279. [2024-11-07 00:58:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 3187 states have (on average 1.7652965171007218) internal successors, (5626), 3192 states have internal predecessors, (5626), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-07 00:58:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 5769 transitions. [2024-11-07 00:58:40,380 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 5769 transitions. Word has length 179 [2024-11-07 00:58:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:40,381 INFO L471 AbstractCegarLoop]: Abstraction has 3279 states and 5769 transitions. [2024-11-07 00:58:40,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 5769 transitions. [2024-11-07 00:58:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 00:58:40,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:40,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:40,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:58:40,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:40,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:40,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1106768084, now seen corresponding path program 1 times [2024-11-07 00:58:40,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:40,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721706469] [2024-11-07 00:58:40,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:40,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:40,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:40,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:58:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:40,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:58:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:40,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:58:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:58:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:40,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:40,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721706469] [2024-11-07 00:58:40,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721706469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:40,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:40,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:40,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886227000] [2024-11-07 00:58:40,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:40,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:40,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:40,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:40,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:40,730 INFO L87 Difference]: Start difference. First operand 3279 states and 5769 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:43,893 INFO L93 Difference]: Finished difference Result 5923 states and 10016 transitions. [2024-11-07 00:58:43,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:43,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2024-11-07 00:58:43,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:43,936 INFO L225 Difference]: With dead ends: 5923 [2024-11-07 00:58:43,937 INFO L226 Difference]: Without dead ends: 4785 [2024-11-07 00:58:43,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:43,951 INFO L432 NwaCegarLoop]: 4304 mSDtfsCounter, 5693 mSDsluCounter, 17175 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5712 SdHoareTripleChecker+Valid, 21479 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:43,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5712 Valid, 21479 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 00:58:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2024-11-07 00:58:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4014. [2024-11-07 00:58:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4014 states, 3866 states have (on average 1.7271081220900155) internal successors, (6677), 3873 states have internal predecessors, (6677), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-07 00:58:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4014 states to 4014 states and 6912 transitions. [2024-11-07 00:58:44,243 INFO L78 Accepts]: Start accepts. Automaton has 4014 states and 6912 transitions. Word has length 179 [2024-11-07 00:58:44,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:44,244 INFO L471 AbstractCegarLoop]: Abstraction has 4014 states and 6912 transitions. [2024-11-07 00:58:44,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4014 states and 6912 transitions. [2024-11-07 00:58:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 00:58:44,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:44,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:44,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:58:44,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:44,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1718037142, now seen corresponding path program 1 times [2024-11-07 00:58:44,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:44,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140226998] [2024-11-07 00:58:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:44,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:58:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:58:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:58:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:58:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:44,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:44,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140226998] [2024-11-07 00:58:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140226998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:44,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:44,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628769445] [2024-11-07 00:58:44,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:44,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:44,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:44,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:44,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:44,546 INFO L87 Difference]: Start difference. First operand 4014 states and 6912 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:47,986 INFO L93 Difference]: Finished difference Result 8618 states and 14267 transitions. [2024-11-07 00:58:47,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:47,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2024-11-07 00:58:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:48,012 INFO L225 Difference]: With dead ends: 8618 [2024-11-07 00:58:48,012 INFO L226 Difference]: Without dead ends: 6745 [2024-11-07 00:58:48,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:48,020 INFO L432 NwaCegarLoop]: 4554 mSDtfsCounter, 5577 mSDsluCounter, 17901 mSDsCounter, 0 mSdLazyCounter, 3586 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5596 SdHoareTripleChecker+Valid, 22455 SdHoareTripleChecker+Invalid, 3653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:48,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5596 Valid, 22455 Invalid, 3653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3586 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:58:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6745 states. [2024-11-07 00:58:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6745 to 5485. [2024-11-07 00:58:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5485 states, 5225 states have (on average 1.6801913875598087) internal successors, (8779), 5236 states have internal predecessors, (8779), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-07 00:58:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 9204 transitions. [2024-11-07 00:58:48,359 INFO L78 Accepts]: Start accepts. Automaton has 5485 states and 9204 transitions. Word has length 179 [2024-11-07 00:58:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:48,360 INFO L471 AbstractCegarLoop]: Abstraction has 5485 states and 9204 transitions. [2024-11-07 00:58:48,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5485 states and 9204 transitions. [2024-11-07 00:58:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 00:58:48,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:48,369 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:48,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:58:48,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:48,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1171738476, now seen corresponding path program 1 times [2024-11-07 00:58:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918963629] [2024-11-07 00:58:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:48,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:58:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:48,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:58:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:48,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:58:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:48,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:58:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:48,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:48,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918963629] [2024-11-07 00:58:48,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918963629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:48,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:48,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325087421] [2024-11-07 00:58:48,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:48,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:48,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:48,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:48,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:48,884 INFO L87 Difference]: Start difference. First operand 5485 states and 9204 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:52,386 INFO L93 Difference]: Finished difference Result 14000 states and 22773 transitions. [2024-11-07 00:58:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:52,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2024-11-07 00:58:52,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:52,430 INFO L225 Difference]: With dead ends: 14000 [2024-11-07 00:58:52,434 INFO L226 Difference]: Without dead ends: 10656 [2024-11-07 00:58:52,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:52,449 INFO L432 NwaCegarLoop]: 4554 mSDtfsCounter, 5573 mSDsluCounter, 17901 mSDsCounter, 0 mSdLazyCounter, 3558 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5592 SdHoareTripleChecker+Valid, 22455 SdHoareTripleChecker+Invalid, 3625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:52,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5592 Valid, 22455 Invalid, 3625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3558 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 00:58:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10656 states. [2024-11-07 00:58:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10656 to 8441. [2024-11-07 00:58:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8441 states, 7957 states have (on average 1.6346613045117506) internal successors, (13007), 7976 states have internal predecessors, (13007), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-07 00:58:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8441 states to 8441 states and 13830 transitions. [2024-11-07 00:58:53,076 INFO L78 Accepts]: Start accepts. Automaton has 8441 states and 13830 transitions. Word has length 179 [2024-11-07 00:58:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:53,076 INFO L471 AbstractCegarLoop]: Abstraction has 8441 states and 13830 transitions. [2024-11-07 00:58:53,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 8441 states and 13830 transitions. [2024-11-07 00:58:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 00:58:53,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:53,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:53,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:58:53,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:53,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1676647954, now seen corresponding path program 1 times [2024-11-07 00:58:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:53,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029829773] [2024-11-07 00:58:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:53,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:53,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:58:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:53,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:58:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:58:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:58:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:53,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:53,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029829773] [2024-11-07 00:58:53,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029829773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:53,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:53,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:53,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813742883] [2024-11-07 00:58:53,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:53,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:53,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:53,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:53,370 INFO L87 Difference]: Start difference. First operand 8441 states and 13830 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:57,262 INFO L93 Difference]: Finished difference Result 24782 states and 39877 transitions. [2024-11-07 00:58:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:57,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2024-11-07 00:58:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:57,319 INFO L225 Difference]: With dead ends: 24782 [2024-11-07 00:58:57,319 INFO L226 Difference]: Without dead ends: 18482 [2024-11-07 00:58:57,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:57,337 INFO L432 NwaCegarLoop]: 4554 mSDtfsCounter, 5572 mSDsluCounter, 17901 mSDsCounter, 0 mSdLazyCounter, 3545 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5591 SdHoareTripleChecker+Valid, 22455 SdHoareTripleChecker+Invalid, 3612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:57,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5591 Valid, 22455 Invalid, 3612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3545 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 00:58:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18482 states. [2024-11-07 00:58:57,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18482 to 14366. [2024-11-07 00:58:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14366 states, 13434 states have (on average 1.5990025308917672) internal successors, (21481), 13469 states have internal predecessors, (21481), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-07 00:58:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14366 states to 14366 states and 23154 transitions. [2024-11-07 00:58:57,980 INFO L78 Accepts]: Start accepts. Automaton has 14366 states and 23154 transitions. Word has length 179 [2024-11-07 00:58:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:57,981 INFO L471 AbstractCegarLoop]: Abstraction has 14366 states and 23154 transitions. [2024-11-07 00:58:57,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:58:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 14366 states and 23154 transitions. [2024-11-07 00:58:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 00:58:57,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:57,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:57,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:58:57,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:57,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1695151916, now seen corresponding path program 1 times [2024-11-07 00:58:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:57,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271265490] [2024-11-07 00:58:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:58,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:58,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:58:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:58,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:58:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:58,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:58:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:58,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:58:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:58:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271265490] [2024-11-07 00:58:58,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271265490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:58,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:58,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:58,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433468867] [2024-11-07 00:58:58,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:58,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:58,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:58,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:58,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:58,246 INFO L87 Difference]: Start difference. First operand 14366 states and 23154 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:01,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:01,301 INFO L93 Difference]: Finished difference Result 30958 states and 49908 transitions. [2024-11-07 00:59:01,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:59:01,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2024-11-07 00:59:01,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:01,438 INFO L225 Difference]: With dead ends: 30958 [2024-11-07 00:59:01,439 INFO L226 Difference]: Without dead ends: 18733 [2024-11-07 00:59:01,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:59:01,471 INFO L432 NwaCegarLoop]: 4279 mSDtfsCounter, 5292 mSDsluCounter, 12675 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5312 SdHoareTripleChecker+Valid, 16954 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:01,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5312 Valid, 16954 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 00:59:01,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18733 states. [2024-11-07 00:59:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18733 to 14366. [2024-11-07 00:59:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14366 states, 13434 states have (on average 1.5965460771177609) internal successors, (21448), 13469 states have internal predecessors, (21448), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-07 00:59:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14366 states to 14366 states and 23121 transitions. [2024-11-07 00:59:02,271 INFO L78 Accepts]: Start accepts. Automaton has 14366 states and 23121 transitions. Word has length 179 [2024-11-07 00:59:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:02,272 INFO L471 AbstractCegarLoop]: Abstraction has 14366 states and 23121 transitions. [2024-11-07 00:59:02,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 14366 states and 23121 transitions. [2024-11-07 00:59:02,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 00:59:02,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:02,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:02,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:59:02,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:02,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:02,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2081014318, now seen corresponding path program 1 times [2024-11-07 00:59:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:02,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954663696] [2024-11-07 00:59:02,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:02,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:02,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:59:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:02,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:59:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:02,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:59:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:02,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:59:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:02,704 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:59:02,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:02,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954663696] [2024-11-07 00:59:02,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954663696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:02,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:02,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:02,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298120109] [2024-11-07 00:59:02,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:02,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:02,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:02,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:02,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:02,706 INFO L87 Difference]: Start difference. First operand 14366 states and 23121 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:07,489 INFO L93 Difference]: Finished difference Result 46311 states and 74043 transitions. [2024-11-07 00:59:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:59:07,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2024-11-07 00:59:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:07,590 INFO L225 Difference]: With dead ends: 46311 [2024-11-07 00:59:07,590 INFO L226 Difference]: Without dead ends: 34086 [2024-11-07 00:59:07,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:59:07,623 INFO L432 NwaCegarLoop]: 4554 mSDtfsCounter, 5564 mSDsluCounter, 17901 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5583 SdHoareTripleChecker+Valid, 22455 SdHoareTripleChecker+Invalid, 3574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:07,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5583 Valid, 22455 Invalid, 3574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 00:59:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34086 states. [2024-11-07 00:59:08,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34086 to 26280. [2024-11-07 00:59:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26280 states, 24452 states have (on average 1.5722231310322263) internal successors, (38444), 24519 states have internal predecessors, (38444), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-11-07 00:59:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26280 states to 26280 states and 41979 transitions. [2024-11-07 00:59:08,765 INFO L78 Accepts]: Start accepts. Automaton has 26280 states and 41979 transitions. Word has length 179 [2024-11-07 00:59:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:08,766 INFO L471 AbstractCegarLoop]: Abstraction has 26280 states and 41979 transitions. [2024-11-07 00:59:08,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand 26280 states and 41979 transitions. [2024-11-07 00:59:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 00:59:08,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:08,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:08,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:59:08,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:08,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1816366828, now seen corresponding path program 1 times [2024-11-07 00:59:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:08,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087995240] [2024-11-07 00:59:08,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:08,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:08,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:08,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:59:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:09,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:59:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:09,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:59:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:09,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:59:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:09,049 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:59:09,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:09,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087995240] [2024-11-07 00:59:09,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087995240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:09,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:09,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:09,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080780515] [2024-11-07 00:59:09,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:09,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:09,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:09,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:09,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:09,051 INFO L87 Difference]: Start difference. First operand 26280 states and 41979 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:14,634 INFO L93 Difference]: Finished difference Result 89439 states and 143251 transitions. [2024-11-07 00:59:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:59:14,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2024-11-07 00:59:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:14,832 INFO L225 Difference]: With dead ends: 89439 [2024-11-07 00:59:14,832 INFO L226 Difference]: Without dead ends: 65300 [2024-11-07 00:59:14,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:59:14,910 INFO L432 NwaCegarLoop]: 4554 mSDtfsCounter, 5563 mSDsluCounter, 17901 mSDsCounter, 0 mSdLazyCounter, 3494 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5582 SdHoareTripleChecker+Valid, 22455 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:14,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5582 Valid, 22455 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3494 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 00:59:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65300 states. [2024-11-07 00:59:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65300 to 50169. [2024-11-07 00:59:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50169 states, 46549 states have (on average 1.5580571011192508) internal successors, (72526), 46680 states have internal predecessors, (72526), 2716 states have call successors, (2716), 775 states have call predecessors, (2716), 902 states have return successors, (5029), 2841 states have call predecessors, (5029), 2714 states have call successors, (5029) [2024-11-07 00:59:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50169 states to 50169 states and 80271 transitions. [2024-11-07 00:59:17,835 INFO L78 Accepts]: Start accepts. Automaton has 50169 states and 80271 transitions. Word has length 179 [2024-11-07 00:59:17,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:17,835 INFO L471 AbstractCegarLoop]: Abstraction has 50169 states and 80271 transitions. [2024-11-07 00:59:17,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:17,836 INFO L276 IsEmpty]: Start isEmpty. Operand 50169 states and 80271 transitions. [2024-11-07 00:59:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 00:59:17,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:17,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:17,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:59:17,858 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:17,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash -547474834, now seen corresponding path program 1 times [2024-11-07 00:59:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:17,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985481136] [2024-11-07 00:59:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:18,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 00:59:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:18,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:59:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:18,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 00:59:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:18,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 00:59:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:18,112 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:59:18,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:18,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985481136] [2024-11-07 00:59:18,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985481136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:18,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:18,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:18,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620891319] [2024-11-07 00:59:18,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:18,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:18,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:18,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:18,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:18,114 INFO L87 Difference]: Start difference. First operand 50169 states and 80271 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)