./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.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.03.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', '9ef62c47abda8be3b48c3c090b2cfd60af093668e4aab452f52a0b386786ccc6'] 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.03.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 9ef62c47abda8be3b48c3c090b2cfd60af093668e4aab452f52a0b386786ccc6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:56:32,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:56:33,036 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:56:33,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:56:33,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:56:33,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:56:33,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:56:33,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:56:33,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:56:33,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:56:33,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:56:33,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:56:33,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:56:33,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:56:33,084 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:56:33,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:56:33,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:56:33,084 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:56:33,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:56:33,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:56:33,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:56:33,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:56:33,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:56:33,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:56:33,085 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:56:33,085 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:56:33,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:56:33,086 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:56:33,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:56:33,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:56:33,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:56:33,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:56:33,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:56:33,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:56:33,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:56:33,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:56:33,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:56:33,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:56:33,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:56:33,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:56:33,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:56:33,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:56:33,088 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 -> 9ef62c47abda8be3b48c3c090b2cfd60af093668e4aab452f52a0b386786ccc6 [2024-11-07 00:56:33,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:56:33,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:56:33,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:56:33,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:56:33,441 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:56:33,442 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.03.cil-1.c [2024-11-07 00:56:34,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:56:35,312 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:56:35,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.03.cil-1.c [2024-11-07 00:56:35,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/219a5d4b6/12a740f656ad48c9a51e7cb9f0a84745/FLAG8c68d30ee [2024-11-07 00:56:35,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/219a5d4b6/12a740f656ad48c9a51e7cb9f0a84745 [2024-11-07 00:56:35,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:56:35,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:56:35,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:56:35,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:56:35,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:56:35,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:56:35" (1/1) ... [2024-11-07 00:56:35,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0fc952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:35, skipping insertion in model container [2024-11-07 00:56:35,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:56:35" (1/1) ... [2024-11-07 00:56:35,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:56:37,193 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.03.cil-1.c[378560,378573] [2024-11-07 00:56:37,229 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.03.cil-1.c[383339,383352] [2024-11-07 00:56:37,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:56:37,386 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:56:38,148 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.03.cil-1.c[378560,378573] [2024-11-07 00:56:38,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.03.cil-1.c[383339,383352] [2024-11-07 00:56:38,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:56:38,251 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:56:38,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:38 WrapperNode [2024-11-07 00:56:38,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:56:38,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:56:38,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:56:38,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:56:38,260 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:56:38" (1/1) ... [2024-11-07 00:56:38,343 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:56:38" (1/1) ... [2024-11-07 00:56:38,879 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12699 [2024-11-07 00:56:38,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:56:38,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:56:38,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:56:38,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:56:38,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:38" (1/1) ... [2024-11-07 00:56:38,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:38" (1/1) ... [2024-11-07 00:56:38,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:38" (1/1) ... [2024-11-07 00:56:39,086 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:56:39,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:38" (1/1) ... [2024-11-07 00:56:39,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:38" (1/1) ... [2024-11-07 00:56:39,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:38" (1/1) ... [2024-11-07 00:56:39,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:38" (1/1) ... [2024-11-07 00:56:39,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:38" (1/1) ... [2024-11-07 00:56:39,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:38" (1/1) ... [2024-11-07 00:56:39,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:56:39,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:56:39,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:56:39,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:56:39,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:38" (1/1) ... [2024-11-07 00:56:39,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:56:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:56:39,446 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:56:39,449 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:56:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:56:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:56:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:56:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:56:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:56:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:56:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:56:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-07 00:56:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-07 00:56:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:56:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:56:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:56:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:56:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:56:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:56:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:56:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:56:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:56:39,586 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:56:39,588 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:56:47,462 INFO L? ?]: Removed 1705 outVars from TransFormulas that were not future-live. [2024-11-07 00:56:47,463 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:56:47,529 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:56:47,531 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-07 00:56:47,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:56:47 BoogieIcfgContainer [2024-11-07 00:56:47,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:56:47,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:56:47,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:56:47,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:56:47,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:56:35" (1/3) ... [2024-11-07 00:56:47,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c70a612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:56:47, skipping insertion in model container [2024-11-07 00:56:47,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:38" (2/3) ... [2024-11-07 00:56:47,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c70a612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:56:47, skipping insertion in model container [2024-11-07 00:56:47,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:56:47" (3/3) ... [2024-11-07 00:56:47,542 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.03.cil-1.c [2024-11-07 00:56:47,556 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:56:47,557 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:56:47,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:56:47,682 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;@4643c370, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:56:47,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:56:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 2352 states, 2323 states have (on average 1.8544984933275936) internal successors, (4308), 2328 states have internal predecessors, (4308), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 00:56:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:56:47,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:47,711 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] [2024-11-07 00:56:47,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:47,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:47,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1300199463, now seen corresponding path program 1 times [2024-11-07 00:56:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:47,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236815780] [2024-11-07 00:56:47,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:47,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:48,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:48,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 00:56:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:48,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 00:56:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:56:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:56:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:48,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:48,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236815780] [2024-11-07 00:56:48,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236815780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:48,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:48,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:56:48,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090628028] [2024-11-07 00:56:48,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:48,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:56:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:48,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:56:48,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:56:48,298 INFO L87 Difference]: Start difference. First operand has 2352 states, 2323 states have (on average 1.8544984933275936) internal successors, (4308), 2328 states have internal predecessors, (4308), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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:56:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:49,481 INFO L93 Difference]: Finished difference Result 4933 states and 9066 transitions. [2024-11-07 00:56:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:56:49,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2024-11-07 00:56:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:49,516 INFO L225 Difference]: With dead ends: 4933 [2024-11-07 00:56:49,517 INFO L226 Difference]: Without dead ends: 2522 [2024-11-07 00:56:49,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:56:49,532 INFO L432 NwaCegarLoop]: 4177 mSDtfsCounter, 4571 mSDsluCounter, 12522 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4581 SdHoareTripleChecker+Valid, 16699 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:49,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4581 Valid, 16699 Invalid, 839 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:56:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2024-11-07 00:56:49,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2435. [2024-11-07 00:56:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 2389 states have (on average 1.8271243197990792) internal successors, (4365), 2393 states have internal predecessors, (4365), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2024-11-07 00:56:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 4428 transitions. [2024-11-07 00:56:49,704 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 4428 transitions. Word has length 80 [2024-11-07 00:56:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:49,705 INFO L471 AbstractCegarLoop]: Abstraction has 2435 states and 4428 transitions. [2024-11-07 00:56:49,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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:56:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 4428 transitions. [2024-11-07 00:56:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:56:49,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:49,711 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] [2024-11-07 00:56:49,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:56:49,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:49,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1753327317, now seen corresponding path program 1 times [2024-11-07 00:56:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:49,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626944283] [2024-11-07 00:56:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:49,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 00:56:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:49,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 00:56:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:49,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:56:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:49,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:56:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:49,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:49,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626944283] [2024-11-07 00:56:49,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626944283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:49,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:49,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:49,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940009361] [2024-11-07 00:56:49,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:49,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:49,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:49,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:49,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:49,948 INFO L87 Difference]: Start difference. First operand 2435 states and 4428 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:56:51,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:51,322 INFO L93 Difference]: Finished difference Result 3020 states and 5320 transitions. [2024-11-07 00:56:51,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:56:51,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2024-11-07 00:56:51,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:51,339 INFO L225 Difference]: With dead ends: 3020 [2024-11-07 00:56:51,339 INFO L226 Difference]: Without dead ends: 2717 [2024-11-07 00:56:51,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:56:51,344 INFO L432 NwaCegarLoop]: 4216 mSDtfsCounter, 4499 mSDsluCounter, 16674 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4509 SdHoareTripleChecker+Valid, 20890 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:51,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4509 Valid, 20890 Invalid, 1286 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:56:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2024-11-07 00:56:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2577. [2024-11-07 00:56:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2577 states, 2512 states have (on average 1.8105095541401275) internal successors, (4548), 2517 states have internal predecessors, (4548), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-11-07 00:56:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 4637 transitions. [2024-11-07 00:56:51,452 INFO L78 Accepts]: Start accepts. Automaton has 2577 states and 4637 transitions. Word has length 80 [2024-11-07 00:56:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:51,453 INFO L471 AbstractCegarLoop]: Abstraction has 2577 states and 4637 transitions. [2024-11-07 00:56:51,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:56:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 4637 transitions. [2024-11-07 00:56:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:56:51,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:51,458 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] [2024-11-07 00:56:51,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:56:51,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:51,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:51,459 INFO L85 PathProgramCache]: Analyzing trace with hash 67147479, now seen corresponding path program 1 times [2024-11-07 00:56:51,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:51,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179740996] [2024-11-07 00:56:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:51,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:51,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 00:56:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 00:56:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:51,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:56:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:51,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:56:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:51,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:51,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179740996] [2024-11-07 00:56:51,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179740996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:51,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:51,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:51,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610932636] [2024-11-07 00:56:51,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:51,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:51,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:51,640 INFO L87 Difference]: Start difference. First operand 2577 states and 4637 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:56:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:53,019 INFO L93 Difference]: Finished difference Result 3529 states and 6085 transitions. [2024-11-07 00:56:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:56:53,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2024-11-07 00:56:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:53,037 INFO L225 Difference]: With dead ends: 3529 [2024-11-07 00:56:53,038 INFO L226 Difference]: Without dead ends: 3084 [2024-11-07 00:56:53,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:56:53,044 INFO L432 NwaCegarLoop]: 4214 mSDtfsCounter, 4497 mSDsluCounter, 16674 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4507 SdHoareTripleChecker+Valid, 20888 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:53,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4507 Valid, 20888 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:56:53,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2024-11-07 00:56:53,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2862. [2024-11-07 00:56:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2759 states have (on average 1.7814425516491483) internal successors, (4915), 2766 states have internal predecessors, (4915), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-11-07 00:56:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 5060 transitions. [2024-11-07 00:56:53,152 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 5060 transitions. Word has length 80 [2024-11-07 00:56:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:53,153 INFO L471 AbstractCegarLoop]: Abstraction has 2862 states and 5060 transitions. [2024-11-07 00:56:53,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:56:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 5060 transitions. [2024-11-07 00:56:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:56:53,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:53,157 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] [2024-11-07 00:56:53,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:56:53,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:53,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:53,158 INFO L85 PathProgramCache]: Analyzing trace with hash 12754581, now seen corresponding path program 1 times [2024-11-07 00:56:53,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:53,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718510503] [2024-11-07 00:56:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:53,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:53,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 00:56:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:53,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 00:56:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:56:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:53,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:56:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:53,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:53,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718510503] [2024-11-07 00:56:53,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718510503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:53,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:53,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:53,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379559574] [2024-11-07 00:56:53,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:53,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:53,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:53,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:53,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:53,316 INFO L87 Difference]: Start difference. First operand 2862 states and 5060 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:56:54,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:54,657 INFO L93 Difference]: Finished difference Result 4514 states and 7564 transitions. [2024-11-07 00:56:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:56:54,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2024-11-07 00:56:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:54,674 INFO L225 Difference]: With dead ends: 4514 [2024-11-07 00:56:54,674 INFO L226 Difference]: Without dead ends: 3784 [2024-11-07 00:56:54,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:56:54,679 INFO L432 NwaCegarLoop]: 4214 mSDtfsCounter, 4493 mSDsluCounter, 16674 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4503 SdHoareTripleChecker+Valid, 20888 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:54,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4503 Valid, 20888 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:56:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2024-11-07 00:56:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3433. [2024-11-07 00:56:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3433 states, 3254 states have (on average 1.7360172095881992) internal successors, (5649), 3265 states have internal predecessors, (5649), 115 states have call successors, (115), 55 states have call predecessors, (115), 62 states have return successors, (148), 120 states have call predecessors, (148), 113 states have call successors, (148) [2024-11-07 00:56:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 5912 transitions. [2024-11-07 00:56:54,832 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 5912 transitions. Word has length 80 [2024-11-07 00:56:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:54,832 INFO L471 AbstractCegarLoop]: Abstraction has 3433 states and 5912 transitions. [2024-11-07 00:56:54,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:56:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 5912 transitions. [2024-11-07 00:56:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:56:54,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:54,835 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] [2024-11-07 00:56:54,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:56:54,835 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:54,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash -404642025, now seen corresponding path program 1 times [2024-11-07 00:56:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:54,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805228056] [2024-11-07 00:56:54,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:54,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 00:56:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:54,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 00:56:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:54,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:56:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:54,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:56:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:55,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:55,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805228056] [2024-11-07 00:56:55,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805228056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:55,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:55,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:55,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274045556] [2024-11-07 00:56:55,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:55,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:55,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:55,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:55,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:55,006 INFO L87 Difference]: Start difference. First operand 3433 states and 5912 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:56:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:56,137 INFO L93 Difference]: Finished difference Result 6891 states and 11132 transitions. [2024-11-07 00:56:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:56:56,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2024-11-07 00:56:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:56,161 INFO L225 Difference]: With dead ends: 6891 [2024-11-07 00:56:56,161 INFO L226 Difference]: Without dead ends: 5590 [2024-11-07 00:56:56,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:56:56,168 INFO L432 NwaCegarLoop]: 4212 mSDtfsCounter, 4624 mSDsluCounter, 16666 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4638 SdHoareTripleChecker+Valid, 20878 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:56,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4638 Valid, 20878 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:56:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5590 states. [2024-11-07 00:56:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5590 to 4556. [2024-11-07 00:56:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4556 states, 4233 states have (on average 1.6789510985116938) internal successors, (7107), 4252 states have internal predecessors, (7107), 203 states have call successors, (203), 103 states have call predecessors, (203), 118 states have return successors, (298), 216 states have call predecessors, (298), 201 states have call successors, (298) [2024-11-07 00:56:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4556 states to 4556 states and 7608 transitions. [2024-11-07 00:56:56,395 INFO L78 Accepts]: Start accepts. Automaton has 4556 states and 7608 transitions. Word has length 80 [2024-11-07 00:56:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:56,395 INFO L471 AbstractCegarLoop]: Abstraction has 4556 states and 7608 transitions. [2024-11-07 00:56:56,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:56:56,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4556 states and 7608 transitions. [2024-11-07 00:56:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:56:56,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:56,398 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] [2024-11-07 00:56:56,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:56:56,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:56,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:56,399 INFO L85 PathProgramCache]: Analyzing trace with hash 274630229, now seen corresponding path program 1 times [2024-11-07 00:56:56,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:56,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419701889] [2024-11-07 00:56:56,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:56,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:56,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 00:56:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:56,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 00:56:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:56,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:56:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:56,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:56:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:56,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:56,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419701889] [2024-11-07 00:56:56,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419701889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:56,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:56,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:56,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356008112] [2024-11-07 00:56:56,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:56,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:56,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:56,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:56,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:56,539 INFO L87 Difference]: Start difference. First operand 4556 states and 7608 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:56:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:57,680 INFO L93 Difference]: Finished difference Result 10972 states and 17330 transitions. [2024-11-07 00:56:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:56:57,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2024-11-07 00:56:57,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:57,723 INFO L225 Difference]: With dead ends: 10972 [2024-11-07 00:56:57,724 INFO L226 Difference]: Without dead ends: 8548 [2024-11-07 00:56:57,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:56:57,737 INFO L432 NwaCegarLoop]: 4211 mSDtfsCounter, 4513 mSDsluCounter, 16663 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4522 SdHoareTripleChecker+Valid, 20874 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:57,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4522 Valid, 20874 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:56:57,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8548 states. [2024-11-07 00:56:58,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8548 to 6631. [2024-11-07 00:56:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6631 states, 6028 states have (on average 1.6152952886529528) internal successors, (9737), 6063 states have internal predecessors, (9737), 371 states have call successors, (371), 199 states have call predecessors, (371), 230 states have return successors, (644), 400 states have call predecessors, (644), 369 states have call successors, (644) [2024-11-07 00:56:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6631 states to 6631 states and 10752 transitions. [2024-11-07 00:56:58,096 INFO L78 Accepts]: Start accepts. Automaton has 6631 states and 10752 transitions. Word has length 80 [2024-11-07 00:56:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:58,097 INFO L471 AbstractCegarLoop]: Abstraction has 6631 states and 10752 transitions. [2024-11-07 00:56:58,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:56:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6631 states and 10752 transitions. [2024-11-07 00:56:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:56:58,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:58,103 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] [2024-11-07 00:56:58,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:56:58,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:58,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:58,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2058762409, now seen corresponding path program 1 times [2024-11-07 00:56:58,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:58,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992608401] [2024-11-07 00:56:58,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:58,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:58,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:58,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 00:56:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 00:56:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:58,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:56:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:58,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:56:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:56:58,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:58,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992608401] [2024-11-07 00:56:58,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992608401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:58,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:58,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:58,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320057220] [2024-11-07 00:56:58,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:58,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:58,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:58,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:58,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:58,229 INFO L87 Difference]: Start difference. First operand 6631 states and 10752 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:56:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:59,501 INFO L93 Difference]: Finished difference Result 17878 states and 27888 transitions. [2024-11-07 00:56:59,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:56:59,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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 80 [2024-11-07 00:56:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:59,558 INFO L225 Difference]: With dead ends: 17878 [2024-11-07 00:56:59,558 INFO L226 Difference]: Without dead ends: 13379 [2024-11-07 00:56:59,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:56:59,577 INFO L432 NwaCegarLoop]: 4212 mSDtfsCounter, 4502 mSDsluCounter, 16666 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4516 SdHoareTripleChecker+Valid, 20878 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:59,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4516 Valid, 20878 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:56:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13379 states. [2024-11-07 00:57:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13379 to 10955. [2024-11-07 00:57:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10955 states, 9808 states have (on average 1.5661704730831973) internal successors, (15361), 9875 states have internal predecessors, (15361), 691 states have call successors, (691), 391 states have call predecessors, (691), 454 states have return successors, (1482), 752 states have call predecessors, (1482), 689 states have call successors, (1482) [2024-11-07 00:57:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10955 states to 10955 states and 17534 transitions. [2024-11-07 00:57:00,328 INFO L78 Accepts]: Start accepts. Automaton has 10955 states and 17534 transitions. Word has length 80 [2024-11-07 00:57:00,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:00,329 INFO L471 AbstractCegarLoop]: Abstraction has 10955 states and 17534 transitions. [2024-11-07 00:57:00,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 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:57:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 10955 states and 17534 transitions. [2024-11-07 00:57:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:57:00,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:00,342 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] [2024-11-07 00:57:00,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:57:00,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:00,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:00,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1498062631, now seen corresponding path program 1 times [2024-11-07 00:57:00,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:00,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713435462] [2024-11-07 00:57:00,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:00,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:00,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 00:57:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:00,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 00:57:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:00,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:57:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:00,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:57:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:57:00,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:00,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713435462] [2024-11-07 00:57:00,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713435462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:00,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:00,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:57:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241987916] [2024-11-07 00:57:00,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:00,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:57:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:00,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:57:00,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:57:00,460 INFO L87 Difference]: Start difference. First operand 10955 states and 17534 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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:57:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:01,783 INFO L93 Difference]: Finished difference Result 26965 states and 42014 transitions. [2024-11-07 00:57:01,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:57:01,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2024-11-07 00:57:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:01,861 INFO L225 Difference]: With dead ends: 26965 [2024-11-07 00:57:01,862 INFO L226 Difference]: Without dead ends: 18143 [2024-11-07 00:57:01,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:57:01,895 INFO L432 NwaCegarLoop]: 4233 mSDtfsCounter, 4670 mSDsluCounter, 12379 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4697 SdHoareTripleChecker+Valid, 16612 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:01,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4697 Valid, 16612 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:57:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18143 states. [2024-11-07 00:57:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18143 to 15280. [2024-11-07 00:57:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15280 states, 13538 states have (on average 1.528512335647806) internal successors, (20693), 13670 states have internal predecessors, (20693), 1056 states have call successors, (1056), 589 states have call predecessors, (1056), 684 states have return successors, (2091), 1084 states have call predecessors, (2091), 1054 states have call successors, (2091) [2024-11-07 00:57:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15280 states to 15280 states and 23840 transitions. [2024-11-07 00:57:02,694 INFO L78 Accepts]: Start accepts. Automaton has 15280 states and 23840 transitions. Word has length 80 [2024-11-07 00:57:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:02,694 INFO L471 AbstractCegarLoop]: Abstraction has 15280 states and 23840 transitions. [2024-11-07 00:57:02,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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:57:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 15280 states and 23840 transitions. [2024-11-07 00:57:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 00:57:02,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:02,730 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:02,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:57:02,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:02,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:02,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2122320658, now seen corresponding path program 1 times [2024-11-07 00:57:02,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:02,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404417550] [2024-11-07 00:57:02,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:02,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:02,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:02,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 00:57:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:02,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 00:57:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:02,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:57:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:57:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:02,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:57:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:02,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 00:57:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:02,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 00:57:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 00:57:02,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:02,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404417550] [2024-11-07 00:57:02,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404417550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:57:02,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819351657] [2024-11-07 00:57:02,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:02,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:57:02,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:57:02,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:57:02,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 00:57:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:03,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 00:57:03,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:57:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 00:57:03,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:57:03,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819351657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:03,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:57:03,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 00:57:03,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800761727] [2024-11-07 00:57:03,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:03,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:57:03,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:03,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:57:03,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:57:03,141 INFO L87 Difference]: Start difference. First operand 15280 states and 23840 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 00:57:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:04,365 INFO L93 Difference]: Finished difference Result 41227 states and 63420 transitions. [2024-11-07 00:57:04,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:57:04,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 130 [2024-11-07 00:57:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:04,490 INFO L225 Difference]: With dead ends: 41227 [2024-11-07 00:57:04,490 INFO L226 Difference]: Without dead ends: 28080 [2024-11-07 00:57:04,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:57:04,539 INFO L432 NwaCegarLoop]: 4196 mSDtfsCounter, 4152 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4152 SdHoareTripleChecker+Valid, 4410 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:04,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4152 Valid, 4410 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:57:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28080 states. [2024-11-07 00:57:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28080 to 27880. [2024-11-07 00:57:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27880 states, 24454 states have (on average 1.4978326654126115) internal successors, (36628), 24715 states have internal predecessors, (36628), 2056 states have call successors, (2056), 1177 states have call predecessors, (2056), 1368 states have return successors, (4065), 2051 states have call predecessors, (4065), 2054 states have call successors, (4065) [2024-11-07 00:57:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27880 states to 27880 states and 42749 transitions. [2024-11-07 00:57:06,029 INFO L78 Accepts]: Start accepts. Automaton has 27880 states and 42749 transitions. Word has length 130 [2024-11-07 00:57:06,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:06,029 INFO L471 AbstractCegarLoop]: Abstraction has 27880 states and 42749 transitions. [2024-11-07 00:57:06,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 00:57:06,029 INFO L276 IsEmpty]: Start isEmpty. Operand 27880 states and 42749 transitions. [2024-11-07 00:57:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 00:57:06,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:06,083 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:06,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 00:57:06,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:57:06,285 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:06,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:06,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1621050866, now seen corresponding path program 1 times [2024-11-07 00:57:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:06,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533729699] [2024-11-07 00:57:06,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:06,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:06,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:06,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 00:57:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:06,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 00:57:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:06,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:57:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:06,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:57:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:06,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:57:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:06,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 00:57:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:06,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 00:57:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 00:57:06,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:06,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533729699] [2024-11-07 00:57:06,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533729699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:57:06,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291641699] [2024-11-07 00:57:06,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:06,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:57:06,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:57:06,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:57:06,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 00:57:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:06,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 00:57:06,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:57:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 00:57:06,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:57:06,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291641699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:06,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:57:06,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 00:57:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209139351] [2024-11-07 00:57:06,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:06,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:57:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:57:06,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:57:06,629 INFO L87 Difference]: Start difference. First operand 27880 states and 42749 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 00:57:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:08,315 INFO L93 Difference]: Finished difference Result 78681 states and 120015 transitions. [2024-11-07 00:57:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:57:08,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 130 [2024-11-07 00:57:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:08,560 INFO L225 Difference]: With dead ends: 78681 [2024-11-07 00:57:08,561 INFO L226 Difference]: Without dead ends: 52934 [2024-11-07 00:57:08,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:57:08,635 INFO L432 NwaCegarLoop]: 4196 mSDtfsCounter, 4146 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4146 SdHoareTripleChecker+Valid, 4410 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:08,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4146 Valid, 4410 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:57:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52934 states. [2024-11-07 00:57:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52934 to 52538. [2024-11-07 00:57:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52538 states, 45794 states have (on average 1.4786216534917238) internal successors, (67712), 46313 states have internal predecessors, (67712), 4006 states have call successors, (4006), 2353 states have call predecessors, (4006), 2736 states have return successors, (7963), 3935 states have call predecessors, (7963), 4004 states have call successors, (7963) [2024-11-07 00:57:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52538 states to 52538 states and 79681 transitions. [2024-11-07 00:57:11,673 INFO L78 Accepts]: Start accepts. Automaton has 52538 states and 79681 transitions. Word has length 130 [2024-11-07 00:57:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:11,674 INFO L471 AbstractCegarLoop]: Abstraction has 52538 states and 79681 transitions. [2024-11-07 00:57:11,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 00:57:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 52538 states and 79681 transitions. [2024-11-07 00:57:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 00:57:11,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:11,765 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:11,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 00:57:11,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:57:11,967 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:11,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash 771500242, now seen corresponding path program 1 times [2024-11-07 00:57:11,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:11,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301312867] [2024-11-07 00:57:11,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:11,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:12,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:12,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 00:57:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:12,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 00:57:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:12,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:57:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:12,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:57:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:12,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:57:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:12,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 00:57:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:12,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 00:57:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 00:57:12,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:12,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301312867] [2024-11-07 00:57:12,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301312867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:57:12,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538550174] [2024-11-07 00:57:12,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:12,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:57:12,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:57:12,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:57:12,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 00:57:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:12,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 00:57:12,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:57:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-07 00:57:12,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:57:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538550174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:12,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:57:12,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-07 00:57:12,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380575648] [2024-11-07 00:57:12,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:12,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:57:12,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:12,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:57:12,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:57:12,311 INFO L87 Difference]: Start difference. First operand 52538 states and 79681 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:57:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:16,339 INFO L93 Difference]: Finished difference Result 150453 states and 229117 transitions. [2024-11-07 00:57:16,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:57:16,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 130 [2024-11-07 00:57:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:16,937 INFO L225 Difference]: With dead ends: 150453 [2024-11-07 00:57:16,937 INFO L226 Difference]: Without dead ends: 100049 [2024-11-07 00:57:17,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:57:17,083 INFO L432 NwaCegarLoop]: 4400 mSDtfsCounter, 197 mSDsluCounter, 4194 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 8594 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:17,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 8594 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:57:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100049 states. [2024-11-07 00:57:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100049 to 100049. [2024-11-07 00:57:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100049 states, 86830 states have (on average 1.4594840492917194) internal successors, (126727), 87734 states have internal predecessors, (126727), 7745 states have call successors, (7745), 4705 states have call predecessors, (7745), 5472 states have return successors, (17046), 7737 states have call predecessors, (17046), 7743 states have call successors, (17046) [2024-11-07 00:57:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100049 states to 100049 states and 151518 transitions. [2024-11-07 00:57:22,918 INFO L78 Accepts]: Start accepts. Automaton has 100049 states and 151518 transitions. Word has length 130 [2024-11-07 00:57:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:22,919 INFO L471 AbstractCegarLoop]: Abstraction has 100049 states and 151518 transitions. [2024-11-07 00:57:22,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 00:57:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 100049 states and 151518 transitions. [2024-11-07 00:57:23,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 00:57:23,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:23,258 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:23,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 00:57:23,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:57:23,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:23,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1173211957, now seen corresponding path program 1 times [2024-11-07 00:57:23,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245631819] [2024-11-07 00:57:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 00:57:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 00:57:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:57:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 00:57:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 00:57:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 00:57:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 00:57:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 00:57:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 00:57:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-07 00:57:23,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:23,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245631819] [2024-11-07 00:57:23,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245631819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:57:23,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153172680] [2024-11-07 00:57:23,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:23,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:57:23,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:57:23,651 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:57:23,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process