./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '81b1f0d7bc9c0822a8207cacf976d5f28113ec35347c6e8d0beebb39e2d17414'] 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_label46+token_ring.03.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81b1f0d7bc9c0822a8207cacf976d5f28113ec35347c6e8d0beebb39e2d17414 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:04:51,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:04:51,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:04:51,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:04:51,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:04:51,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:04:51,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:04:51,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:04:51,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:04:51,134 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:04:51,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:04:51,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:04:51,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:04:51,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:04:51,135 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:04:51,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:04:51,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:04:51,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:04:51,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:04:51,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:04:51,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:04:51,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:04:51,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:04:51,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:04:51,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:04:51,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:04:51,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:04:51,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:04:51,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:04:51,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:04:51,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:04:51,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:04:51,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:04:51,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:04:51,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:04:51,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:04:51,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:04:51,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:04:51,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:04:51,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:04:51,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:04:51,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:04:51,139 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 -> 81b1f0d7bc9c0822a8207cacf976d5f28113ec35347c6e8d0beebb39e2d17414 [2024-11-07 01:04:51,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:04:51,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:04:51,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:04:51,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:04:51,513 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:04:51,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-2.c [2024-11-07 01:04:52,764 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:04:53,338 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:04:53,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-2.c [2024-11-07 01:04:53,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95aa7183a/69693d6adcec4e63b17a6fe148a52d00/FLAG0eec4c9e6 [2024-11-07 01:04:53,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95aa7183a/69693d6adcec4e63b17a6fe148a52d00 [2024-11-07 01:04:53,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:04:53,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:04:53,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:04:53,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:04:53,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:04:53,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:53" (1/1) ... [2024-11-07 01:04:53,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b0d4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:53, skipping insertion in model container [2024-11-07 01:04:53,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:04:53" (1/1) ... [2024-11-07 01:04:53,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:04:54,839 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_label46+token_ring.03.cil-2.c[382357,382370] [2024-11-07 01:04:54,865 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_label46+token_ring.03.cil-2.c[383339,383352] [2024-11-07 01:04:55,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:04:55,022 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:04:55,642 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_label46+token_ring.03.cil-2.c[382357,382370] [2024-11-07 01:04:55,657 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_label46+token_ring.03.cil-2.c[383339,383352] [2024-11-07 01:04:55,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:04:55,761 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:04:55,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55 WrapperNode [2024-11-07 01:04:55,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:04:55,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:04:55,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:04:55,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:04:55,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (1/1) ... [2024-11-07 01:04:55,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (1/1) ... [2024-11-07 01:04:56,377 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12693 [2024-11-07 01:04:56,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:04:56,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:04:56,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:04:56,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:04:56,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (1/1) ... [2024-11-07 01:04:56,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (1/1) ... [2024-11-07 01:04:56,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (1/1) ... [2024-11-07 01:04:56,543 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:04:56,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (1/1) ... [2024-11-07 01:04:56,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (1/1) ... [2024-11-07 01:04:56,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (1/1) ... [2024-11-07 01:04:56,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (1/1) ... [2024-11-07 01:04:56,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (1/1) ... [2024-11-07 01:04:56,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (1/1) ... [2024-11-07 01:04:56,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:04:56,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:04:56,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:04:56,916 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:04:56,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (1/1) ... [2024-11-07 01:04:56,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:04:56,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:04:56,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:04:56,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:04:56,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:04:56,977 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:04:56,977 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:04:56,977 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:04:56,978 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:04:56,978 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:04:56,978 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:04:56,978 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:04:56,978 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:04:56,978 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:04:56,979 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:04:56,979 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:04:56,979 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:04:56,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:04:56,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:04:56,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:04:57,106 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:04:57,108 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:05:05,196 INFO L? ?]: Removed 1701 outVars from TransFormulas that were not future-live. [2024-11-07 01:05:05,196 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:05:05,260 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:05:05,260 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-07 01:05:05,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:05 BoogieIcfgContainer [2024-11-07 01:05:05,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:05:05,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:05:05,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:05:05,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:05:05,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:04:53" (1/3) ... [2024-11-07 01:05:05,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fbd20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:05, skipping insertion in model container [2024-11-07 01:05:05,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:04:55" (2/3) ... [2024-11-07 01:05:05,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fbd20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:05, skipping insertion in model container [2024-11-07 01:05:05,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:05" (3/3) ... [2024-11-07 01:05:05,274 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.03.cil-2.c [2024-11-07 01:05:05,287 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:05:05,287 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:05:05,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:05:05,390 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;@6a95c52a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:05:05,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:05:05,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 2344 states, 2318 states have (on average 1.8541846419327006) internal successors, (4298), 2321 states have internal predecessors, (4298), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 01:05:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:05:05,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:05,419 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] [2024-11-07 01:05:05,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:05,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1659781244, now seen corresponding path program 1 times [2024-11-07 01:05:05,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:05,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430248648] [2024-11-07 01:05:05,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:05,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:05,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:05:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:05,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:05:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:05,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:05:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:05,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:05:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:05,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 01:05:05,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:05,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430248648] [2024-11-07 01:05:05,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430248648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:05,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:05,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:05:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933989062] [2024-11-07 01:05:05,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:05,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:05:05,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:05,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:05:05,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:05:05,985 INFO L87 Difference]: Start difference. First operand has 2344 states, 2318 states have (on average 1.8541846419327006) internal successors, (4298), 2321 states have internal predecessors, (4298), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:07,162 INFO L93 Difference]: Finished difference Result 4911 states and 9024 transitions. [2024-11-07 01:05:07,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:05:07,164 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:05:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:07,196 INFO L225 Difference]: With dead ends: 4911 [2024-11-07 01:05:07,196 INFO L226 Difference]: Without dead ends: 2508 [2024-11-07 01:05:07,205 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 01:05:07,207 INFO L432 NwaCegarLoop]: 4166 mSDtfsCounter, 4555 mSDsluCounter, 12484 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4565 SdHoareTripleChecker+Valid, 16650 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:07,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4565 Valid, 16650 Invalid, 826 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:05:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2024-11-07 01:05:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2423. [2024-11-07 01:05:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2379 states have (on average 1.8263976460697773) internal successors, (4345), 2382 states have internal predecessors, (4345), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2024-11-07 01:05:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 4406 transitions. [2024-11-07 01:05:07,372 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 4406 transitions. Word has length 79 [2024-11-07 01:05:07,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:07,373 INFO L471 AbstractCegarLoop]: Abstraction has 2423 states and 4406 transitions. [2024-11-07 01:05:07,373 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 4406 transitions. [2024-11-07 01:05:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:05:07,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:07,377 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] [2024-11-07 01:05:07,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:05:07,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:07,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:07,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1422733048, now seen corresponding path program 1 times [2024-11-07 01:05:07,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:07,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210230839] [2024-11-07 01:05:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:07,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:07,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:07,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:05:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:07,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:05:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:07,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:05:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:07,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:05:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:05:07,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:07,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210230839] [2024-11-07 01:05:07,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210230839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:07,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:07,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912585181] [2024-11-07 01:05:07,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:07,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:07,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:07,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:07,653 INFO L87 Difference]: Start difference. First operand 2423 states and 4406 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:09,024 INFO L93 Difference]: Finished difference Result 2989 states and 5264 transitions. [2024-11-07 01:05:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:05:09,024 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:05:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:09,038 INFO L225 Difference]: With dead ends: 2989 [2024-11-07 01:05:09,038 INFO L226 Difference]: Without dead ends: 2698 [2024-11-07 01:05:09,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:05:09,043 INFO L432 NwaCegarLoop]: 4194 mSDtfsCounter, 4485 mSDsluCounter, 16591 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4495 SdHoareTripleChecker+Valid, 20785 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:09,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4495 Valid, 20785 Invalid, 1267 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:05:09,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2024-11-07 01:05:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2560. [2024-11-07 01:05:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2497 states have (on average 1.8093712454945936) internal successors, (4518), 2501 states have internal predecessors, (4518), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-11-07 01:05:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 4605 transitions. [2024-11-07 01:05:09,124 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 4605 transitions. Word has length 79 [2024-11-07 01:05:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:09,124 INFO L471 AbstractCegarLoop]: Abstraction has 2560 states and 4605 transitions. [2024-11-07 01:05:09,124 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 4605 transitions. [2024-11-07 01:05:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:05:09,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:09,126 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] [2024-11-07 01:05:09,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:05:09,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:09,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1477125946, now seen corresponding path program 1 times [2024-11-07 01:05:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:09,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858915615] [2024-11-07 01:05:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:09,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:09,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:09,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:05:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:09,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:05:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:09,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:05:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:09,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:05:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:05:09,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:09,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858915615] [2024-11-07 01:05:09,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858915615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:09,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:09,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312371952] [2024-11-07 01:05:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:09,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:09,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:09,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:09,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:09,322 INFO L87 Difference]: Start difference. First operand 2560 states and 4605 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:10,549 INFO L93 Difference]: Finished difference Result 3483 states and 5999 transitions. [2024-11-07 01:05:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:05:10,550 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:05:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:10,565 INFO L225 Difference]: With dead ends: 3483 [2024-11-07 01:05:10,565 INFO L226 Difference]: Without dead ends: 3055 [2024-11-07 01:05:10,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:05:10,568 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 4483 mSDsluCounter, 16591 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4493 SdHoareTripleChecker+Valid, 20783 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:10,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4493 Valid, 20783 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:05:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2024-11-07 01:05:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 2835. [2024-11-07 01:05:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2734 states have (on average 1.7794440380395025) internal successors, (4865), 2740 states have internal predecessors, (4865), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-11-07 01:05:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 5008 transitions. [2024-11-07 01:05:10,660 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 5008 transitions. Word has length 79 [2024-11-07 01:05:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:10,661 INFO L471 AbstractCegarLoop]: Abstraction has 2835 states and 5008 transitions. [2024-11-07 01:05:10,662 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 5008 transitions. [2024-11-07 01:05:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:05:10,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:10,665 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] [2024-11-07 01:05:10,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:05:10,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:10,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1894522552, now seen corresponding path program 1 times [2024-11-07 01:05:10,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:10,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864816106] [2024-11-07 01:05:10,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:10,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:05:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:10,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:05:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:10,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:05:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:05:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:05:10,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:10,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864816106] [2024-11-07 01:05:10,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864816106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:10,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:10,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357911085] [2024-11-07 01:05:10,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:10,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:10,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:10,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:10,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:10,808 INFO L87 Difference]: Start difference. First operand 2835 states and 5008 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:12,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:12,099 INFO L93 Difference]: Finished difference Result 4438 states and 7418 transitions. [2024-11-07 01:05:12,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:05:12,100 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:05:12,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:12,117 INFO L225 Difference]: With dead ends: 4438 [2024-11-07 01:05:12,117 INFO L226 Difference]: Without dead ends: 3735 [2024-11-07 01:05:12,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:05:12,122 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 4479 mSDsluCounter, 16591 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4489 SdHoareTripleChecker+Valid, 20783 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:12,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4489 Valid, 20783 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:05:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2024-11-07 01:05:12,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 3386. [2024-11-07 01:05:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3209 states have (on average 1.7323153630414458) internal successors, (5559), 3219 states have internal predecessors, (5559), 113 states have call successors, (113), 54 states have call predecessors, (113), 62 states have return successors, (148), 120 states have call predecessors, (148), 113 states have call successors, (148) [2024-11-07 01:05:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 5820 transitions. [2024-11-07 01:05:12,290 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 5820 transitions. Word has length 79 [2024-11-07 01:05:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:12,291 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 5820 transitions. [2024-11-07 01:05:12,291 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 5820 transitions. [2024-11-07 01:05:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:05:12,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:12,294 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] [2024-11-07 01:05:12,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:05:12,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:12,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:12,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1215250298, now seen corresponding path program 1 times [2024-11-07 01:05:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:12,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281425095] [2024-11-07 01:05:12,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:12,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:12,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:05:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:12,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:05:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:12,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:05:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:12,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:05:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:05:12,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281425095] [2024-11-07 01:05:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281425095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:12,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:12,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437449924] [2024-11-07 01:05:12,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:12,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:12,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:12,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:12,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:12,474 INFO L87 Difference]: Start difference. First operand 3386 states and 5820 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:13,608 INFO L93 Difference]: Finished difference Result 6755 states and 10866 transitions. [2024-11-07 01:05:13,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:05:13,609 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:05:13,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:13,632 INFO L225 Difference]: With dead ends: 6755 [2024-11-07 01:05:13,632 INFO L226 Difference]: Without dead ends: 5501 [2024-11-07 01:05:13,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:05:13,640 INFO L432 NwaCegarLoop]: 4190 mSDtfsCounter, 4610 mSDsluCounter, 16583 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4624 SdHoareTripleChecker+Valid, 20773 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:13,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4624 Valid, 20773 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:05:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5501 states. [2024-11-07 01:05:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5501 to 4469. [2024-11-07 01:05:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4469 states, 4148 states have (on average 1.6723722275795565) internal successors, (6937), 4166 states have internal predecessors, (6937), 201 states have call successors, (201), 102 states have call predecessors, (201), 118 states have return successors, (298), 216 states have call predecessors, (298), 201 states have call successors, (298) [2024-11-07 01:05:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4469 states to 4469 states and 7436 transitions. [2024-11-07 01:05:13,835 INFO L78 Accepts]: Start accepts. Automaton has 4469 states and 7436 transitions. Word has length 79 [2024-11-07 01:05:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:13,836 INFO L471 AbstractCegarLoop]: Abstraction has 4469 states and 7436 transitions. [2024-11-07 01:05:13,836 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4469 states and 7436 transitions. [2024-11-07 01:05:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:05:13,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:13,841 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] [2024-11-07 01:05:13,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:05:13,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:13,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash 746324360, now seen corresponding path program 1 times [2024-11-07 01:05:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:13,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173105706] [2024-11-07 01:05:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:13,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:13,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:05:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:14,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:05:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:14,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:05:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:14,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:05:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:05:14,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:14,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173105706] [2024-11-07 01:05:14,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173105706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:14,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:14,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:14,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103130587] [2024-11-07 01:05:14,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:14,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:14,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:14,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:14,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:14,040 INFO L87 Difference]: Start difference. First operand 4469 states and 7436 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:15,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:15,278 INFO L93 Difference]: Finished difference Result 10716 states and 16824 transitions. [2024-11-07 01:05:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:05:15,279 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:05:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:15,319 INFO L225 Difference]: With dead ends: 10716 [2024-11-07 01:05:15,319 INFO L226 Difference]: Without dead ends: 8379 [2024-11-07 01:05:15,330 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 01:05:15,331 INFO L432 NwaCegarLoop]: 4189 mSDtfsCounter, 4499 mSDsluCounter, 16580 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4508 SdHoareTripleChecker+Valid, 20769 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:15,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4508 Valid, 20769 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:05:15,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8379 states. [2024-11-07 01:05:15,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8379 to 6544. [2024-11-07 01:05:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6544 states, 5943 states have (on average 1.6097930338213025) internal successors, (9567), 5977 states have internal predecessors, (9567), 369 states have call successors, (369), 198 states have call predecessors, (369), 230 states have return successors, (644), 400 states have call predecessors, (644), 369 states have call successors, (644) [2024-11-07 01:05:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6544 states to 6544 states and 10580 transitions. [2024-11-07 01:05:15,710 INFO L78 Accepts]: Start accepts. Automaton has 6544 states and 10580 transitions. Word has length 79 [2024-11-07 01:05:15,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:15,711 INFO L471 AbstractCegarLoop]: Abstraction has 6544 states and 10580 transitions. [2024-11-07 01:05:15,711 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 6544 states and 10580 transitions. [2024-11-07 01:05:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:05:15,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:15,718 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] [2024-11-07 01:05:15,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:05:15,719 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:15,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:15,720 INFO L85 PathProgramCache]: Analyzing trace with hash 948148294, now seen corresponding path program 1 times [2024-11-07 01:05:15,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:15,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754055293] [2024-11-07 01:05:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:15,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:15,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:05:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:15,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:05:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:15,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:05:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:05:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:05:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754055293] [2024-11-07 01:05:15,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754055293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:15,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:15,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445762927] [2024-11-07 01:05:15,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:15,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:15,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:15,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:15,856 INFO L87 Difference]: Start difference. First operand 6544 states and 10580 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:17,186 INFO L93 Difference]: Finished difference Result 17622 states and 27382 transitions. [2024-11-07 01:05:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:05:17,186 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:05:17,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:17,253 INFO L225 Difference]: With dead ends: 17622 [2024-11-07 01:05:17,254 INFO L226 Difference]: Without dead ends: 13210 [2024-11-07 01:05:17,271 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 01:05:17,272 INFO L432 NwaCegarLoop]: 4190 mSDtfsCounter, 4488 mSDsluCounter, 16583 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4502 SdHoareTripleChecker+Valid, 20773 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:17,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4502 Valid, 20773 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:05:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13210 states. [2024-11-07 01:05:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13210 to 10788. [2024-11-07 01:05:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10788 states, 9643 states have (on average 1.5587472778181064) internal successors, (15031), 9709 states have internal predecessors, (15031), 689 states have call successors, (689), 390 states have call predecessors, (689), 454 states have return successors, (1482), 752 states have call predecessors, (1482), 689 states have call successors, (1482) [2024-11-07 01:05:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10788 states to 10788 states and 17202 transitions. [2024-11-07 01:05:17,822 INFO L78 Accepts]: Start accepts. Automaton has 10788 states and 17202 transitions. Word has length 79 [2024-11-07 01:05:17,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:17,823 INFO L471 AbstractCegarLoop]: Abstraction has 10788 states and 17202 transitions. [2024-11-07 01:05:17,824 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 10788 states and 17202 transitions. [2024-11-07 01:05:17,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:05:17,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:17,892 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] [2024-11-07 01:05:17,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:05:17,893 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:17,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:17,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1381877380, now seen corresponding path program 1 times [2024-11-07 01:05:17,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:17,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266626958] [2024-11-07 01:05:17,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:17,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:05:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:05:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:05:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:18,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:05:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:05:18,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:18,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266626958] [2024-11-07 01:05:18,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266626958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:18,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:18,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:05:18,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150341290] [2024-11-07 01:05:18,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:18,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:05:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:18,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:05:18,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:05:18,007 INFO L87 Difference]: Start difference. First operand 10788 states and 17202 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:19,595 INFO L93 Difference]: Finished difference Result 26631 states and 41350 transitions. [2024-11-07 01:05:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:05:19,595 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2024-11-07 01:05:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:19,660 INFO L225 Difference]: With dead ends: 26631 [2024-11-07 01:05:19,660 INFO L226 Difference]: Without dead ends: 17976 [2024-11-07 01:05:19,685 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 01:05:19,686 INFO L432 NwaCegarLoop]: 4222 mSDtfsCounter, 4656 mSDsluCounter, 12352 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4683 SdHoareTripleChecker+Valid, 16574 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:19,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4683 Valid, 16574 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:05:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17976 states. [2024-11-07 01:05:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17976 to 15113. [2024-11-07 01:05:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15113 states, 13373 states have (on average 1.5226949824272789) internal successors, (20363), 13504 states have internal predecessors, (20363), 1054 states have call successors, (1054), 588 states have call predecessors, (1054), 684 states have return successors, (2091), 1084 states have call predecessors, (2091), 1054 states have call successors, (2091) [2024-11-07 01:05:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15113 states to 15113 states and 23508 transitions. [2024-11-07 01:05:20,484 INFO L78 Accepts]: Start accepts. Automaton has 15113 states and 23508 transitions. Word has length 79 [2024-11-07 01:05:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:20,485 INFO L471 AbstractCegarLoop]: Abstraction has 15113 states and 23508 transitions. [2024-11-07 01:05:20,485 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 15113 states and 23508 transitions. [2024-11-07 01:05:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 01:05:20,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:20,519 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] [2024-11-07 01:05:20,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:05:20,519 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:20,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:20,520 INFO L85 PathProgramCache]: Analyzing trace with hash 372870207, now seen corresponding path program 1 times [2024-11-07 01:05:20,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:20,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068104294] [2024-11-07 01:05:20,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:20,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:05:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:05:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:05:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:05:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:05:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:05:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 01:05:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,729 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 01:05:20,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:20,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068104294] [2024-11-07 01:05:20,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068104294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:05:20,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116748507] [2024-11-07 01:05:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:20,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:05:20,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:05:20,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:05:20,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 01:05:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:20,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:05:20,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:05:20,945 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 01:05:20,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:05:20,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116748507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:20,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:05:20,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 01:05:20,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348294248] [2024-11-07 01:05:20,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:20,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:05:20,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:20,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:05:20,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:05:20,947 INFO L87 Difference]: Start difference. First operand 15113 states and 23508 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:05:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:21,993 INFO L93 Difference]: Finished difference Result 40726 states and 62424 transitions. [2024-11-07 01:05:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:05:21,994 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 129 [2024-11-07 01:05:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:22,121 INFO L225 Difference]: With dead ends: 40726 [2024-11-07 01:05:22,121 INFO L226 Difference]: Without dead ends: 27746 [2024-11-07 01:05:22,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 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 01:05:22,166 INFO L432 NwaCegarLoop]: 4184 mSDtfsCounter, 4140 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4140 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:22,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4140 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:05:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27746 states. [2024-11-07 01:05:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27746 to 27548. [2024-11-07 01:05:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27548 states, 24124 states have (on average 1.4909633559940307) internal successors, (35968), 24384 states have internal predecessors, (35968), 2054 states have call successors, (2054), 1176 states have call predecessors, (2054), 1368 states have return successors, (4065), 2051 states have call predecessors, (4065), 2054 states have call successors, (4065) [2024-11-07 01:05:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27548 states to 27548 states and 42087 transitions. [2024-11-07 01:05:23,973 INFO L78 Accepts]: Start accepts. Automaton has 27548 states and 42087 transitions. Word has length 129 [2024-11-07 01:05:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:23,974 INFO L471 AbstractCegarLoop]: Abstraction has 27548 states and 42087 transitions. [2024-11-07 01:05:23,974 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:05:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 27548 states and 42087 transitions. [2024-11-07 01:05:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 01:05:24,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:24,111 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] [2024-11-07 01:05:24,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 01:05:24,311 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 01:05:24,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:24,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:24,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1742173535, now seen corresponding path program 1 times [2024-11-07 01:05:24,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:24,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656399099] [2024-11-07 01:05:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:24,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:24,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:24,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:05:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:24,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:05:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:24,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:05:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:24,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:05:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:24,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:05:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:24,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:05:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:24,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 01:05:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:24,471 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 01:05:24,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656399099] [2024-11-07 01:05:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656399099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:05:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528881717] [2024-11-07 01:05:24,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:05:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:05:24,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:05:24,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 01:05:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:24,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:05:24,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:05:24,662 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 01:05:24,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:05:24,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528881717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:24,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:05:24,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 01:05:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728097257] [2024-11-07 01:05:24,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:24,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:05:24,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:24,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:05:24,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:05:24,667 INFO L87 Difference]: Start difference. First operand 27548 states and 42087 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:05:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:26,225 INFO L93 Difference]: Finished difference Result 77685 states and 118029 transitions. [2024-11-07 01:05:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:05:26,226 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 129 [2024-11-07 01:05:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:26,472 INFO L225 Difference]: With dead ends: 77685 [2024-11-07 01:05:26,473 INFO L226 Difference]: Without dead ends: 52270 [2024-11-07 01:05:26,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:05:26,562 INFO L432 NwaCegarLoop]: 4184 mSDtfsCounter, 4134 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4134 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:26,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4134 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:05:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52270 states. [2024-11-07 01:05:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52270 to 51876. [2024-11-07 01:05:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51876 states, 45134 states have (on average 1.4709974741879737) internal successors, (66392), 45652 states have internal predecessors, (66392), 4004 states have call successors, (4004), 2352 states have call predecessors, (4004), 2736 states have return successors, (7963), 3935 states have call predecessors, (7963), 4004 states have call successors, (7963) [2024-11-07 01:05:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51876 states to 51876 states and 78359 transitions. [2024-11-07 01:05:29,730 INFO L78 Accepts]: Start accepts. Automaton has 51876 states and 78359 transitions. Word has length 129 [2024-11-07 01:05:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:29,730 INFO L471 AbstractCegarLoop]: Abstraction has 51876 states and 78359 transitions. [2024-11-07 01:05:29,731 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:05:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 51876 states and 78359 transitions. [2024-11-07 01:05:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 01:05:29,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:29,812 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] [2024-11-07 01:05:29,830 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 01:05:30,016 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 01:05:30,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:30,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash 467842687, now seen corresponding path program 1 times [2024-11-07 01:05:30,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:30,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75969561] [2024-11-07 01:05:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:30,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:05:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:05:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:30,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:05:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:30,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:05:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:30,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:05:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:30,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:05:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:30,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 01:05:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:30,173 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 01:05:30,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:30,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75969561] [2024-11-07 01:05:30,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75969561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:05:30,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892263139] [2024-11-07 01:05:30,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:30,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:05:30,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:05:30,178 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 01:05:30,179 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 01:05:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:30,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:05:30,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:05:30,326 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 01:05:30,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:05:30,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892263139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:30,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:05:30,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-07 01:05:30,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052580269] [2024-11-07 01:05:30,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:30,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:05:30,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:30,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:05:30,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:05:30,329 INFO L87 Difference]: Start difference. First operand 51876 states and 78359 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 01:05:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:34,233 INFO L93 Difference]: Finished difference Result 149129 states and 226473 transitions. [2024-11-07 01:05:34,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:05:34,234 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 129 [2024-11-07 01:05:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:34,836 INFO L225 Difference]: With dead ends: 149129 [2024-11-07 01:05:34,836 INFO L226 Difference]: Without dead ends: 99387 [2024-11-07 01:05:34,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:05:34,966 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 197 mSDsluCounter, 4182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 8570 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 01:05:34,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 8570 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:05:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99387 states. [2024-11-07 01:05:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99387 to 99387. [2024-11-07 01:05:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99387 states, 86170 states have (on average 1.4553440872693513) internal successors, (125407), 87073 states have internal predecessors, (125407), 7743 states have call successors, (7743), 4704 states have call predecessors, (7743), 5472 states have return successors, (17046), 7737 states have call predecessors, (17046), 7743 states have call successors, (17046) [2024-11-07 01:05:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99387 states to 99387 states and 150196 transitions. [2024-11-07 01:05:40,593 INFO L78 Accepts]: Start accepts. Automaton has 99387 states and 150196 transitions. Word has length 129 [2024-11-07 01:05:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:40,595 INFO L471 AbstractCegarLoop]: Abstraction has 99387 states and 150196 transitions. [2024-11-07 01:05:40,595 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 01:05:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 99387 states and 150196 transitions. [2024-11-07 01:05:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 01:05:40,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:40,862 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] [2024-11-07 01:05:40,879 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 01:05:41,062 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 01:05:41,063 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:41,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:41,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1721282092, now seen corresponding path program 1 times [2024-11-07 01:05:41,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:41,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980031281] [2024-11-07 01:05:41,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:41,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 01:05:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 01:05:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:05:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 01:05:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:05:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:05:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 01:05:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:05:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 01:05:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,468 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 01:05:41,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:41,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980031281] [2024-11-07 01:05:41,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980031281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:05:41,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119826624] [2024-11-07 01:05:41,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:41,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:05:41,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:05:41,472 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 01:05:41,473 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 [2024-11-07 01:05:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:41,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:05:41,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:05:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-07 01:05:41,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:05:41,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119826624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:41,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:05:41,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 01:05:41,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101269369] [2024-11-07 01:05:41,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:41,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:05:41,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:41,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:05:41,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:05:41,761 INFO L87 Difference]: Start difference. First operand 99387 states and 150196 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)