./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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', '7fcfcf7d93c3fc85869efa536862a56a3ba120e3589f116e608720bbd1f279d7'] 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/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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 7fcfcf7d93c3fc85869efa536862a56a3ba120e3589f116e608720bbd1f279d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:26:08,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:26:08,727 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:26:08,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:26:08,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:26:08,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:26:08,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:26:08,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:26:08,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:26:08,760 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:26:08,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:26:08,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:26:08,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:26:08,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:26:08,761 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:26:08,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:26:08,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:26:08,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:26:08,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:26:08,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:26:08,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:26:08,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:26:08,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:26:08,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:26:08,763 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:26:08,763 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:26:08,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:26:08,763 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:26:08,763 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:26:08,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:26:08,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:26:08,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:26:08,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:26:08,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:26:08,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:26:08,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:26:08,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:26:08,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:26:08,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:26:08,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:26:08,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:26:08,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:26:08,765 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 -> 7fcfcf7d93c3fc85869efa536862a56a3ba120e3589f116e608720bbd1f279d7 [2024-11-07 01:26:09,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:26:09,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:26:09,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:26:09,059 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:26:09,059 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:26:09,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-07 01:26:10,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:26:10,987 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:26:10,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-07 01:26:11,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5bc93ef3/492b2d47a87b459ab637f2360ce84ec0/FLAGeeadd63bf [2024-11-07 01:26:11,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5bc93ef3/492b2d47a87b459ab637f2360ce84ec0 [2024-11-07 01:26:11,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:26:11,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:26:11,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:26:11,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:26:11,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:26:11,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:26:11" (1/1) ... [2024-11-07 01:26:11,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cbde13f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:11, skipping insertion in model container [2024-11-07 01:26:11,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:26:11" (1/1) ... [2024-11-07 01:26:11,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:26:11,461 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/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[6524,6537] [2024-11-07 01:26:11,503 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/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[12079,12092] [2024-11-07 01:26:12,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:26:12,066 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:26:12,099 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/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[6524,6537] [2024-11-07 01:26:12,109 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/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[12079,12092] [2024-11-07 01:26:12,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:26:12,511 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:26:12,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:12 WrapperNode [2024-11-07 01:26:12,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:26:12,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:26:12,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:26:12,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:26:12,532 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:26:12" (1/1) ... [2024-11-07 01:26:12,601 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:26:12" (1/1) ... [2024-11-07 01:26:13,045 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4981 [2024-11-07 01:26:13,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:26:13,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:26:13,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:26:13,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:26:13,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:12" (1/1) ... [2024-11-07 01:26:13,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:12" (1/1) ... [2024-11-07 01:26:13,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:12" (1/1) ... [2024-11-07 01:26:13,305 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:26:13,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:12" (1/1) ... [2024-11-07 01:26:13,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:12" (1/1) ... [2024-11-07 01:26:13,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:12" (1/1) ... [2024-11-07 01:26:13,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:12" (1/1) ... [2024-11-07 01:26:13,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:12" (1/1) ... [2024-11-07 01:26:13,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:12" (1/1) ... [2024-11-07 01:26:13,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:26:13,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:26:13,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:26:13,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:26:13,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:12" (1/1) ... [2024-11-07 01:26:13,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:26:13,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:26:13,769 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:26:13,774 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:26:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:26:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:26:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:26:13,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:26:13,887 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:26:13,889 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:26:18,438 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-11-07 01:26:18,438 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:26:18,483 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:26:18,485 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 01:26:18,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:26:18 BoogieIcfgContainer [2024-11-07 01:26:18,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:26:18,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:26:18,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:26:18,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:26:18,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:26:11" (1/3) ... [2024-11-07 01:26:18,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649c5c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:26:18, skipping insertion in model container [2024-11-07 01:26:18,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:26:12" (2/3) ... [2024-11-07 01:26:18,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649c5c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:26:18, skipping insertion in model container [2024-11-07 01:26:18,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:26:18" (3/3) ... [2024-11-07 01:26:18,496 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-07 01:26:18,510 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:26:18,510 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:26:18,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:26:18,634 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;@14a94c98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:26:18,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:26:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 872 states, 869 states have (on average 1.906789413118527) internal successors, (1657), 871 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:18,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 01:26:18,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:18,653 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] [2024-11-07 01:26:18,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:18,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:18,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1537187155, now seen corresponding path program 1 times [2024-11-07 01:26:18,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:18,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175316308] [2024-11-07 01:26:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:18,867 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:26:18,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:18,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175316308] [2024-11-07 01:26:18,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175316308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:18,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:18,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 01:26:18,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796661013] [2024-11-07 01:26:18,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:18,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 01:26:18,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:18,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 01:26:18,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 01:26:18,898 INFO L87 Difference]: Start difference. First operand has 872 states, 869 states have (on average 1.906789413118527) internal successors, (1657), 871 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:18,989 INFO L93 Difference]: Finished difference Result 1720 states and 3272 transitions. [2024-11-07 01:26:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 01:26:18,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-07 01:26:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:19,007 INFO L225 Difference]: With dead ends: 1720 [2024-11-07 01:26:19,007 INFO L226 Difference]: Without dead ends: 806 [2024-11-07 01:26:19,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 01:26:19,019 INFO L432 NwaCegarLoop]: 1588 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:19,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:19,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-07 01:26:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2024-11-07 01:26:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8955223880597014) internal successors, (1524), 805 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1524 transitions. [2024-11-07 01:26:19,092 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1524 transitions. Word has length 20 [2024-11-07 01:26:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:19,092 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1524 transitions. [2024-11-07 01:26:19,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1524 transitions. [2024-11-07 01:26:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 01:26:19,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:19,094 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] [2024-11-07 01:26:19,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:26:19,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:19,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:19,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1746662891, now seen corresponding path program 1 times [2024-11-07 01:26:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:19,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721888515] [2024-11-07 01:26:19,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:19,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:19,365 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:26:19,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:19,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721888515] [2024-11-07 01:26:19,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721888515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:19,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:19,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:26:19,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832464225] [2024-11-07 01:26:19,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:19,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:26:19,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:19,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:26:19,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:26:19,369 INFO L87 Difference]: Start difference. First operand 806 states and 1524 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:19,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:19,483 INFO L93 Difference]: Finished difference Result 840 states and 1575 transitions. [2024-11-07 01:26:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:26:19,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-07 01:26:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:19,490 INFO L225 Difference]: With dead ends: 840 [2024-11-07 01:26:19,491 INFO L226 Difference]: Without dead ends: 806 [2024-11-07 01:26:19,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:26:19,492 INFO L432 NwaCegarLoop]: 1522 mSDtfsCounter, 0 mSDsluCounter, 4545 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6067 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:19,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6067 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-07 01:26:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2024-11-07 01:26:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8756218905472637) internal successors, (1508), 805 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1508 transitions. [2024-11-07 01:26:19,532 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1508 transitions. Word has length 20 [2024-11-07 01:26:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:19,533 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1508 transitions. [2024-11-07 01:26:19,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1508 transitions. [2024-11-07 01:26:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 01:26:19,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:19,536 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] [2024-11-07 01:26:19,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:26:19,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:19,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:19,537 INFO L85 PathProgramCache]: Analyzing trace with hash 623816355, now seen corresponding path program 1 times [2024-11-07 01:26:19,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:19,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305834445] [2024-11-07 01:26:19,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:19,702 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:26:19,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:19,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305834445] [2024-11-07 01:26:19,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305834445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:19,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:19,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:26:19,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559253103] [2024-11-07 01:26:19,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:19,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:26:19,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:19,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:26:19,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:26:19,705 INFO L87 Difference]: Start difference. First operand 806 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:19,841 INFO L93 Difference]: Finished difference Result 986 states and 1790 transitions. [2024-11-07 01:26:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:26:19,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-07 01:26:19,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:19,847 INFO L225 Difference]: With dead ends: 986 [2024-11-07 01:26:19,848 INFO L226 Difference]: Without dead ends: 956 [2024-11-07 01:26:19,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:26:19,849 INFO L432 NwaCegarLoop]: 1504 mSDtfsCounter, 4589 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:19,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 1865 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:26:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-11-07 01:26:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 834. [2024-11-07 01:26:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 832 states have (on average 1.8653846153846154) internal successors, (1552), 833 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1552 transitions. [2024-11-07 01:26:19,874 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1552 transitions. Word has length 35 [2024-11-07 01:26:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:19,876 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1552 transitions. [2024-11-07 01:26:19,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1552 transitions. [2024-11-07 01:26:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 01:26:19,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:19,878 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] [2024-11-07 01:26:19,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:26:19,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:19,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:19,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1071361683, now seen corresponding path program 1 times [2024-11-07 01:26:19,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:19,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518877600] [2024-11-07 01:26:19,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:19,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:20,005 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:26:20,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:20,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518877600] [2024-11-07 01:26:20,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518877600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:20,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:20,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:26:20,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29803450] [2024-11-07 01:26:20,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:20,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:26:20,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:20,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:26:20,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:20,009 INFO L87 Difference]: Start difference. First operand 834 states and 1552 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:20,040 INFO L93 Difference]: Finished difference Result 939 states and 1715 transitions. [2024-11-07 01:26:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:26:20,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-07 01:26:20,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:20,047 INFO L225 Difference]: With dead ends: 939 [2024-11-07 01:26:20,047 INFO L226 Difference]: Without dead ends: 881 [2024-11-07 01:26:20,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:20,049 INFO L432 NwaCegarLoop]: 1506 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:20,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1548 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-07 01:26:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2024-11-07 01:26:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.847206385404789) internal successors, (1620), 878 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1620 transitions. [2024-11-07 01:26:20,087 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1620 transitions. Word has length 37 [2024-11-07 01:26:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:20,088 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1620 transitions. [2024-11-07 01:26:20,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2024-11-07 01:26:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 01:26:20,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:20,089 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] [2024-11-07 01:26:20,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:26:20,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:20,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:20,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1137855195, now seen corresponding path program 1 times [2024-11-07 01:26:20,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:20,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612191196] [2024-11-07 01:26:20,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:20,332 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:26:20,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:20,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612191196] [2024-11-07 01:26:20,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612191196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:20,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:20,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:26:20,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273924389] [2024-11-07 01:26:20,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:20,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:26:20,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:20,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:26:20,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:26:20,335 INFO L87 Difference]: Start difference. First operand 879 states and 1620 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:20,423 INFO L93 Difference]: Finished difference Result 984 states and 1780 transitions. [2024-11-07 01:26:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:26:20,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-07 01:26:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:20,427 INFO L225 Difference]: With dead ends: 984 [2024-11-07 01:26:20,428 INFO L226 Difference]: Without dead ends: 881 [2024-11-07 01:26:20,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:26:20,430 INFO L432 NwaCegarLoop]: 1503 mSDtfsCounter, 2946 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2946 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:20,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2946 Valid, 1592 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-07 01:26:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2024-11-07 01:26:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.8449258836944127) internal successors, (1618), 878 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1618 transitions. [2024-11-07 01:26:20,457 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1618 transitions. Word has length 37 [2024-11-07 01:26:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:20,459 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1618 transitions. [2024-11-07 01:26:20,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1618 transitions. [2024-11-07 01:26:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 01:26:20,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:20,462 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] [2024-11-07 01:26:20,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:26:20,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:20,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:20,463 INFO L85 PathProgramCache]: Analyzing trace with hash 499049456, now seen corresponding path program 1 times [2024-11-07 01:26:20,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:20,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010585580] [2024-11-07 01:26:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:20,802 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:26:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010585580] [2024-11-07 01:26:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010585580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:26:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596571984] [2024-11-07 01:26:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:20,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:26:20,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:20,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:26:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:26:20,804 INFO L87 Difference]: Start difference. First operand 879 states and 1618 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:20,885 INFO L93 Difference]: Finished difference Result 887 states and 1627 transitions. [2024-11-07 01:26:20,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:26:20,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-07 01:26:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:20,891 INFO L225 Difference]: With dead ends: 887 [2024-11-07 01:26:20,892 INFO L226 Difference]: Without dead ends: 885 [2024-11-07 01:26:20,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:26:20,894 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 0 mSDsluCounter, 8999 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10501 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:20,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10501 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:20,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-07 01:26:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2024-11-07 01:26:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.838052095130238) internal successors, (1623), 884 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1623 transitions. [2024-11-07 01:26:20,917 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1623 transitions. Word has length 38 [2024-11-07 01:26:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:20,918 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1623 transitions. [2024-11-07 01:26:20,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1623 transitions. [2024-11-07 01:26:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 01:26:20,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:20,919 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] [2024-11-07 01:26:20,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:26:20,919 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:20,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:20,920 INFO L85 PathProgramCache]: Analyzing trace with hash 166228827, now seen corresponding path program 1 times [2024-11-07 01:26:20,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:20,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085332604] [2024-11-07 01:26:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:20,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:20,989 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:26:20,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:20,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085332604] [2024-11-07 01:26:20,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085332604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:20,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:20,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:26:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073291095] [2024-11-07 01:26:20,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:20,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:26:20,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:20,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:26:20,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:20,991 INFO L87 Difference]: Start difference. First operand 885 states and 1623 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:21,023 INFO L93 Difference]: Finished difference Result 1007 states and 1804 transitions. [2024-11-07 01:26:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:26:21,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-07 01:26:21,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:21,028 INFO L225 Difference]: With dead ends: 1007 [2024-11-07 01:26:21,028 INFO L226 Difference]: Without dead ends: 943 [2024-11-07 01:26:21,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:21,029 INFO L432 NwaCegarLoop]: 1540 mSDtfsCounter, 1476 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:21,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-07 01:26:21,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2024-11-07 01:26:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 939 states have (on average 1.8146964856230032) internal successors, (1704), 940 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1704 transitions. [2024-11-07 01:26:21,054 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1704 transitions. Word has length 39 [2024-11-07 01:26:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:21,054 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1704 transitions. [2024-11-07 01:26:21,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1704 transitions. [2024-11-07 01:26:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 01:26:21,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:21,055 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] [2024-11-07 01:26:21,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:26:21,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:21,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:21,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2049239973, now seen corresponding path program 1 times [2024-11-07 01:26:21,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:21,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766335218] [2024-11-07 01:26:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:21,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:21,098 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:26:21,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:21,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766335218] [2024-11-07 01:26:21,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766335218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:21,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:21,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:26:21,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945800497] [2024-11-07 01:26:21,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:21,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:26:21,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:21,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:26:21,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:21,100 INFO L87 Difference]: Start difference. First operand 941 states and 1704 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:21,129 INFO L93 Difference]: Finished difference Result 1243 states and 2144 transitions. [2024-11-07 01:26:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:26:21,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-07 01:26:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:21,134 INFO L225 Difference]: With dead ends: 1243 [2024-11-07 01:26:21,134 INFO L226 Difference]: Without dead ends: 1080 [2024-11-07 01:26:21,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:21,135 INFO L432 NwaCegarLoop]: 1542 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:21,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-11-07 01:26:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2024-11-07 01:26:21,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1076 states have (on average 1.762081784386617) internal successors, (1896), 1077 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1896 transitions. [2024-11-07 01:26:21,160 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1896 transitions. Word has length 39 [2024-11-07 01:26:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:21,160 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1896 transitions. [2024-11-07 01:26:21,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1896 transitions. [2024-11-07 01:26:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 01:26:21,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:21,161 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] [2024-11-07 01:26:21,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:26:21,162 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:21,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash -268307109, now seen corresponding path program 1 times [2024-11-07 01:26:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:21,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518994851] [2024-11-07 01:26:21,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:21,203 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:26:21,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:21,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518994851] [2024-11-07 01:26:21,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518994851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:21,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:21,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:26:21,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263475590] [2024-11-07 01:26:21,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:21,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:26:21,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:21,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:26:21,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:21,205 INFO L87 Difference]: Start difference. First operand 1078 states and 1896 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:21,240 INFO L93 Difference]: Finished difference Result 1630 states and 2678 transitions. [2024-11-07 01:26:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:26:21,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-07 01:26:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:21,246 INFO L225 Difference]: With dead ends: 1630 [2024-11-07 01:26:21,247 INFO L226 Difference]: Without dead ends: 1330 [2024-11-07 01:26:21,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:21,248 INFO L432 NwaCegarLoop]: 1540 mSDtfsCounter, 1472 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:21,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2024-11-07 01:26:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2024-11-07 01:26:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 1.6832579185520362) internal successors, (2232), 1327 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2232 transitions. [2024-11-07 01:26:21,282 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2232 transitions. Word has length 39 [2024-11-07 01:26:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:21,283 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2232 transitions. [2024-11-07 01:26:21,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2232 transitions. [2024-11-07 01:26:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 01:26:21,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:21,283 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] [2024-11-07 01:26:21,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:26:21,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:21,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1521212245, now seen corresponding path program 1 times [2024-11-07 01:26:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155852967] [2024-11-07 01:26:21,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:21,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:21,355 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:26:21,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:21,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155852967] [2024-11-07 01:26:21,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155852967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:21,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:21,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 01:26:21,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3193845] [2024-11-07 01:26:21,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:21,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:26:21,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:21,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:26:21,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:21,359 INFO L87 Difference]: Start difference. First operand 1328 states and 2232 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:25,207 INFO L93 Difference]: Finished difference Result 2832 states and 5105 transitions. [2024-11-07 01:26:25,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:26:25,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-07 01:26:25,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:25,217 INFO L225 Difference]: With dead ends: 2832 [2024-11-07 01:26:25,217 INFO L226 Difference]: Without dead ends: 2079 [2024-11-07 01:26:25,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:25,219 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 836 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:25,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 146 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-07 01:26:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-11-07 01:26:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 2079. [2024-11-07 01:26:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2077 states have (on average 1.7366393837265286) internal successors, (3607), 2078 states have internal predecessors, (3607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3607 transitions. [2024-11-07 01:26:25,262 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3607 transitions. Word has length 48 [2024-11-07 01:26:25,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:25,263 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 3607 transitions. [2024-11-07 01:26:25,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3607 transitions. [2024-11-07 01:26:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 01:26:25,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:25,264 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:26:25,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:26:25,265 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:25,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:25,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1567417933, now seen corresponding path program 1 times [2024-11-07 01:26:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:25,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940166073] [2024-11-07 01:26:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:25,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:26:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940166073] [2024-11-07 01:26:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940166073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:25,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:25,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:26:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456494835] [2024-11-07 01:26:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:25,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:26:25,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:25,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:26:25,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:26:25,460 INFO L87 Difference]: Start difference. First operand 2079 states and 3607 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:25,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:25,543 INFO L93 Difference]: Finished difference Result 3711 states and 5883 transitions. [2024-11-07 01:26:25,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:26:25,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 01:26:25,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:25,556 INFO L225 Difference]: With dead ends: 3711 [2024-11-07 01:26:25,557 INFO L226 Difference]: Without dead ends: 3309 [2024-11-07 01:26:25,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:26:25,559 INFO L432 NwaCegarLoop]: 1548 mSDtfsCounter, 3039 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:25,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3160 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2024-11-07 01:26:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 2555. [2024-11-07 01:26:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2553 states have (on average 1.6698002350176264) internal successors, (4263), 2554 states have internal predecessors, (4263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4263 transitions. [2024-11-07 01:26:25,625 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4263 transitions. Word has length 54 [2024-11-07 01:26:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:25,626 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 4263 transitions. [2024-11-07 01:26:25,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4263 transitions. [2024-11-07 01:26:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 01:26:25,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:25,627 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:26:25,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:26:25,627 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:25,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:25,628 INFO L85 PathProgramCache]: Analyzing trace with hash -648050867, now seen corresponding path program 1 times [2024-11-07 01:26:25,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:25,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097558137] [2024-11-07 01:26:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:25,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:26:25,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:25,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097558137] [2024-11-07 01:26:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097558137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:25,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:25,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:26:25,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98975645] [2024-11-07 01:26:25,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:25,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:26:25,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:25,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:26:25,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:26:25,732 INFO L87 Difference]: Start difference. First operand 2555 states and 4263 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:25,828 INFO L93 Difference]: Finished difference Result 4259 states and 6643 transitions. [2024-11-07 01:26:25,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:26:25,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 01:26:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:25,844 INFO L225 Difference]: With dead ends: 4259 [2024-11-07 01:26:25,844 INFO L226 Difference]: Without dead ends: 3709 [2024-11-07 01:26:25,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:26:25,848 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 3039 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3157 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:25,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3157 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2024-11-07 01:26:25,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3303. [2024-11-07 01:26:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 3301 states have (on average 1.6028476219327477) internal successors, (5291), 3302 states have internal predecessors, (5291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 5291 transitions. [2024-11-07 01:26:25,944 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 5291 transitions. Word has length 54 [2024-11-07 01:26:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:25,945 INFO L471 AbstractCegarLoop]: Abstraction has 3303 states and 5291 transitions. [2024-11-07 01:26:25,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 5291 transitions. [2024-11-07 01:26:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 01:26:25,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:25,951 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:26:25,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:26:25,951 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:25,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:25,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1132881997, now seen corresponding path program 1 times [2024-11-07 01:26:25,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:25,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089213664] [2024-11-07 01:26:25,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:25,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 01:26:26,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:26,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089213664] [2024-11-07 01:26:26,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089213664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:26,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:26,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:26:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049198245] [2024-11-07 01:26:26,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:26,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:26:26,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:26,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:26:26,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:26:26,060 INFO L87 Difference]: Start difference. First operand 3303 states and 5291 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:26,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:26,169 INFO L93 Difference]: Finished difference Result 4807 states and 7399 transitions. [2024-11-07 01:26:26,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:26:26,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 01:26:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:26,185 INFO L225 Difference]: With dead ends: 4807 [2024-11-07 01:26:26,185 INFO L226 Difference]: Without dead ends: 4257 [2024-11-07 01:26:26,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:26:26,188 INFO L432 NwaCegarLoop]: 1546 mSDtfsCounter, 3045 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3045 SdHoareTripleChecker+Valid, 3158 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:26,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3045 Valid, 3158 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:26,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2024-11-07 01:26:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 3851. [2024-11-07 01:26:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.5710574175110419) internal successors, (6047), 3850 states have internal predecessors, (6047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 6047 transitions. [2024-11-07 01:26:26,317 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 6047 transitions. Word has length 54 [2024-11-07 01:26:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:26,318 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 6047 transitions. [2024-11-07 01:26:26,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 6047 transitions. [2024-11-07 01:26:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 01:26:26,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:26,319 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:26:26,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:26:26,319 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:26,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:26,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1336470191, now seen corresponding path program 1 times [2024-11-07 01:26:26,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:26,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466099145] [2024-11-07 01:26:26,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:26,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:26,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:26,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466099145] [2024-11-07 01:26:26,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466099145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:26,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:26,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:26:26,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009735767] [2024-11-07 01:26:26,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:26,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:26:26,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:26,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:26:26,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:26,406 INFO L87 Difference]: Start difference. First operand 3851 states and 6047 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:26,453 INFO L93 Difference]: Finished difference Result 6175 states and 9257 transitions. [2024-11-07 01:26:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:26:26,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-07 01:26:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:26,466 INFO L225 Difference]: With dead ends: 6175 [2024-11-07 01:26:26,466 INFO L226 Difference]: Without dead ends: 3853 [2024-11-07 01:26:26,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:26,472 INFO L432 NwaCegarLoop]: 1526 mSDtfsCounter, 29 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:26,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2024-11-07 01:26:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2024-11-07 01:26:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.558067030397506) internal successors, (5997), 3850 states have internal predecessors, (5997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5997 transitions. [2024-11-07 01:26:26,565 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5997 transitions. Word has length 55 [2024-11-07 01:26:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:26,565 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5997 transitions. [2024-11-07 01:26:26,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5997 transitions. [2024-11-07 01:26:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 01:26:26,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:26,568 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:26:26,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:26:26,568 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:26,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1355833083, now seen corresponding path program 1 times [2024-11-07 01:26:26,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:26,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128479723] [2024-11-07 01:26:26,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:26,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:26,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128479723] [2024-11-07 01:26:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128479723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:26,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:26,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:26:26,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856806430] [2024-11-07 01:26:26,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:26,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:26:26,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:26,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:26:26,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:26,652 INFO L87 Difference]: Start difference. First operand 3851 states and 5997 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:26,691 INFO L93 Difference]: Finished difference Result 4770 states and 7257 transitions. [2024-11-07 01:26:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:26:26,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-07 01:26:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:26,698 INFO L225 Difference]: With dead ends: 4770 [2024-11-07 01:26:26,698 INFO L226 Difference]: Without dead ends: 2448 [2024-11-07 01:26:26,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:26,704 INFO L432 NwaCegarLoop]: 1524 mSDtfsCounter, 23 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:26,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2024-11-07 01:26:26,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2440. [2024-11-07 01:26:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2438 states have (on average 1.6702214930270713) internal successors, (4072), 2439 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 4072 transitions. [2024-11-07 01:26:26,761 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 4072 transitions. Word has length 56 [2024-11-07 01:26:26,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:26,762 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 4072 transitions. [2024-11-07 01:26:26,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 4072 transitions. [2024-11-07 01:26:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 01:26:26,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:26,764 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:26:26,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:26:26,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:26,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:26,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1597882527, now seen corresponding path program 1 times [2024-11-07 01:26:26,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:26,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828719921] [2024-11-07 01:26:26,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:26,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:26,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:26,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828719921] [2024-11-07 01:26:26,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828719921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:26:26,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:26:26,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:26:26,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052509259] [2024-11-07 01:26:26,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:26:26,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:26:26,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:26,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:26:26,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:26,840 INFO L87 Difference]: Start difference. First operand 2440 states and 4072 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:26,866 INFO L93 Difference]: Finished difference Result 2894 states and 4686 transitions. [2024-11-07 01:26:26,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:26:26,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-07 01:26:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:26,871 INFO L225 Difference]: With dead ends: 2894 [2024-11-07 01:26:26,871 INFO L226 Difference]: Without dead ends: 1992 [2024-11-07 01:26:26,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:26:26,873 INFO L432 NwaCegarLoop]: 1518 mSDtfsCounter, 25 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:26,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2998 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:26:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2024-11-07 01:26:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1990. [2024-11-07 01:26:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1988 states have (on average 1.7359154929577465) internal successors, (3451), 1989 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 3451 transitions. [2024-11-07 01:26:26,906 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 3451 transitions. Word has length 57 [2024-11-07 01:26:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:26,906 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 3451 transitions. [2024-11-07 01:26:26,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 3451 transitions. [2024-11-07 01:26:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 01:26:26,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:26,909 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:26:26,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:26:26,909 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:26,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:26,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1649038701, now seen corresponding path program 1 times [2024-11-07 01:26:26,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:26,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180646716] [2024-11-07 01:26:26,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:26,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180646716] [2024-11-07 01:26:28,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180646716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:26:28,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361106523] [2024-11-07 01:26:28,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:28,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:28,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:26:28,445 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:26:28,446 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:26:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:28,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 01:26:28,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:26:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:26:28,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:26:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:26:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361106523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:26:28,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:26:28,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2024-11-07 01:26:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145268978] [2024-11-07 01:26:28,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:26:28,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 01:26:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:28,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 01:26:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:26:28,988 INFO L87 Difference]: Start difference. First operand 1990 states and 3451 transitions. Second operand has 19 states, 19 states have (on average 8.421052631578947) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:30,976 INFO L93 Difference]: Finished difference Result 4292 states and 6474 transitions. [2024-11-07 01:26:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-07 01:26:30,984 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.421052631578947) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-07 01:26:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:31,000 INFO L225 Difference]: With dead ends: 4292 [2024-11-07 01:26:31,001 INFO L226 Difference]: Without dead ends: 3840 [2024-11-07 01:26:31,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=545, Invalid=2535, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 01:26:31,010 INFO L432 NwaCegarLoop]: 1495 mSDtfsCounter, 17224 mSDsluCounter, 7660 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17224 SdHoareTripleChecker+Valid, 9155 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:31,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17224 Valid, 9155 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:26:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2024-11-07 01:26:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3722. [2024-11-07 01:26:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 3720 states have (on average 1.5091397849462365) internal successors, (5614), 3721 states have internal predecessors, (5614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 5614 transitions. [2024-11-07 01:26:31,236 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 5614 transitions. Word has length 59 [2024-11-07 01:26:31,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:31,237 INFO L471 AbstractCegarLoop]: Abstraction has 3722 states and 5614 transitions. [2024-11-07 01:26:31,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.421052631578947) internal successors, (160), 19 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:31,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5614 transitions. [2024-11-07 01:26:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 01:26:31,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:31,240 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:26:31,261 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:26:31,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 01:26:31,442 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:31,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:31,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1651307681, now seen corresponding path program 1 times [2024-11-07 01:26:31,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:31,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504302521] [2024-11-07 01:26:31,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:31,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:33,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:33,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504302521] [2024-11-07 01:26:33,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504302521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:26:33,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113003936] [2024-11-07 01:26:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:33,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:33,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:26:33,018 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:26:33,020 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:26:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:33,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 01:26:33,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:26:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:33,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:26:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:34,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113003936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:26:34,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:26:34,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-11-07 01:26:34,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689153824] [2024-11-07 01:26:34,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:26:34,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 01:26:34,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:34,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 01:26:34,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-11-07 01:26:34,002 INFO L87 Difference]: Start difference. First operand 3722 states and 5614 transitions. Second operand has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 25 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:34,451 INFO L93 Difference]: Finished difference Result 7645 states and 10631 transitions. [2024-11-07 01:26:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:26:34,452 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 25 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-07 01:26:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:34,463 INFO L225 Difference]: With dead ends: 7645 [2024-11-07 01:26:34,463 INFO L226 Difference]: Without dead ends: 5856 [2024-11-07 01:26:34,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 01:26:34,468 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 16487 mSDsluCounter, 3186 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16487 SdHoareTripleChecker+Valid, 4677 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:34,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16487 Valid, 4677 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:26:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5856 states. [2024-11-07 01:26:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5856 to 5790. [2024-11-07 01:26:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5790 states, 5788 states have (on average 1.4082584657912924) internal successors, (8151), 5789 states have internal predecessors, (8151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5790 states to 5790 states and 8151 transitions. [2024-11-07 01:26:34,630 INFO L78 Accepts]: Start accepts. Automaton has 5790 states and 8151 transitions. Word has length 60 [2024-11-07 01:26:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:34,630 INFO L471 AbstractCegarLoop]: Abstraction has 5790 states and 8151 transitions. [2024-11-07 01:26:34,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 25 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 5790 states and 8151 transitions. [2024-11-07 01:26:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 01:26:34,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:34,631 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:26:34,648 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:26:34,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 01:26:34,833 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:34,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1955522029, now seen corresponding path program 1 times [2024-11-07 01:26:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138648675] [2024-11-07 01:26:34,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:35,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:35,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138648675] [2024-11-07 01:26:35,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138648675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:26:35,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522336674] [2024-11-07 01:26:35,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:35,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:35,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:26:35,126 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:26:35,128 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:26:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:35,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 01:26:35,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:26:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:36,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:26:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:38,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522336674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:26:38,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:26:38,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 16] total 38 [2024-11-07 01:26:38,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748479773] [2024-11-07 01:26:38,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:26:38,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-07 01:26:38,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:38,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-07 01:26:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 01:26:38,360 INFO L87 Difference]: Start difference. First operand 5790 states and 8151 transitions. Second operand has 38 states, 38 states have (on average 4.157894736842105) internal successors, (158), 38 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:55,727 INFO L93 Difference]: Finished difference Result 16672 states and 22018 transitions. [2024-11-07 01:26:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2024-11-07 01:26:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.157894736842105) internal successors, (158), 38 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-07 01:26:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:55,755 INFO L225 Difference]: With dead ends: 16672 [2024-11-07 01:26:55,755 INFO L226 Difference]: Without dead ends: 12731 [2024-11-07 01:26:55,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11487 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=5606, Invalid=24844, Unknown=0, NotChecked=0, Total=30450 [2024-11-07 01:26:55,768 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 16550 mSDsluCounter, 22188 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16550 SdHoareTripleChecker+Valid, 23735 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:55,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16550 Valid, 23735 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:26:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12731 states. [2024-11-07 01:26:56,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12731 to 9861. [2024-11-07 01:26:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9861 states, 9859 states have (on average 1.347094025763262) internal successors, (13281), 9860 states have internal predecessors, (13281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9861 states to 9861 states and 13281 transitions. [2024-11-07 01:26:56,051 INFO L78 Accepts]: Start accepts. Automaton has 9861 states and 13281 transitions. Word has length 60 [2024-11-07 01:26:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:56,052 INFO L471 AbstractCegarLoop]: Abstraction has 9861 states and 13281 transitions. [2024-11-07 01:26:56,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.157894736842105) internal successors, (158), 38 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 9861 states and 13281 transitions. [2024-11-07 01:26:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 01:26:56,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:56,053 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:26:56,068 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:26:56,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:56,254 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:56,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:56,254 INFO L85 PathProgramCache]: Analyzing trace with hash -909285249, now seen corresponding path program 1 times [2024-11-07 01:26:56,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:56,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105246047] [2024-11-07 01:26:56,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:56,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:56,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:56,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105246047] [2024-11-07 01:26:56,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105246047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:26:56,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622001589] [2024-11-07 01:26:56,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:56,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:56,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:26:56,592 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:26:56,594 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:26:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:56,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 01:26:56,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:26:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:58,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:26:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:58,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622001589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:26:58,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:26:58,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-11-07 01:26:58,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735320502] [2024-11-07 01:26:58,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:26:58,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 01:26:58,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:58,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 01:26:58,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2024-11-07 01:26:58,719 INFO L87 Difference]: Start difference. First operand 9861 states and 13281 transitions. Second operand has 27 states, 27 states have (on average 5.888888888888889) internal successors, (159), 26 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:27:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:27:00,030 INFO L93 Difference]: Finished difference Result 19021 states and 24807 transitions. [2024-11-07 01:27:00,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 01:27:00,031 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.888888888888889) internal successors, (159), 26 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-07 01:27:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:27:00,049 INFO L225 Difference]: With dead ends: 19021 [2024-11-07 01:27:00,050 INFO L226 Difference]: Without dead ends: 11371 [2024-11-07 01:27:00,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=628, Invalid=2024, Unknown=0, NotChecked=0, Total=2652 [2024-11-07 01:27:00,061 INFO L432 NwaCegarLoop]: 1511 mSDtfsCounter, 24208 mSDsluCounter, 7892 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24208 SdHoareTripleChecker+Valid, 9403 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:27:00,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24208 Valid, 9403 Invalid, 572 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:27:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11371 states. [2024-11-07 01:27:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11371 to 10903. [2024-11-07 01:27:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10903 states, 10901 states have (on average 1.3207045225208696) internal successors, (14397), 10902 states have internal predecessors, (14397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:27:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10903 states to 10903 states and 14397 transitions. [2024-11-07 01:27:00,617 INFO L78 Accepts]: Start accepts. Automaton has 10903 states and 14397 transitions. Word has length 61 [2024-11-07 01:27:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:27:00,617 INFO L471 AbstractCegarLoop]: Abstraction has 10903 states and 14397 transitions. [2024-11-07 01:27:00,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.888888888888889) internal successors, (159), 26 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:27:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 10903 states and 14397 transitions. [2024-11-07 01:27:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 01:27:00,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:27:00,620 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:27:00,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 01:27:00,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:27:00,825 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:27:00,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:27:00,826 INFO L85 PathProgramCache]: Analyzing trace with hash 705601745, now seen corresponding path program 1 times [2024-11-07 01:27:00,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:27:00,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114674716] [2024-11-07 01:27:00,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:27:00,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:27:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:27:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:27:01,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:27:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114674716] [2024-11-07 01:27:01,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114674716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:27:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286843028] [2024-11-07 01:27:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:27:01,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:27:01,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:27:01,502 INFO L229 MonitoredProcess]: Starting monitored process 6 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:27:01,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 01:27:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:27:01,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-07 01:27:01,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:27:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:27:03,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:27:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:27:05,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286843028] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:27:05,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:27:05,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 16] total 45 [2024-11-07 01:27:05,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089581521] [2024-11-07 01:27:05,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:27:05,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-07 01:27:05,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:27:05,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-07 01:27:05,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1732, Unknown=0, NotChecked=0, Total=1980 [2024-11-07 01:27:05,414 INFO L87 Difference]: Start difference. First operand 10903 states and 14397 transitions. Second operand has 45 states, 45 states have (on average 3.688888888888889) internal successors, (166), 45 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:27:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:27:14,532 INFO L93 Difference]: Finished difference Result 16603 states and 21539 transitions. [2024-11-07 01:27:14,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-07 01:27:14,533 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.688888888888889) internal successors, (166), 45 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-07 01:27:14,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:27:14,544 INFO L225 Difference]: With dead ends: 16603 [2024-11-07 01:27:14,544 INFO L226 Difference]: Without dead ends: 11487 [2024-11-07 01:27:14,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3777 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=2761, Invalid=11281, Unknown=0, NotChecked=0, Total=14042 [2024-11-07 01:27:14,552 INFO L432 NwaCegarLoop]: 1526 mSDtfsCounter, 16271 mSDsluCounter, 27471 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16271 SdHoareTripleChecker+Valid, 28997 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:27:14,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16271 Valid, 28997 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:27:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11487 states. [2024-11-07 01:27:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11487 to 9237. [2024-11-07 01:27:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9237 states, 9235 states have (on average 1.3339469409853817) internal successors, (12319), 9236 states have internal predecessors, (12319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:27:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9237 states to 9237 states and 12319 transitions. [2024-11-07 01:27:15,126 INFO L78 Accepts]: Start accepts. Automaton has 9237 states and 12319 transitions. Word has length 62 [2024-11-07 01:27:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:27:15,126 INFO L471 AbstractCegarLoop]: Abstraction has 9237 states and 12319 transitions. [2024-11-07 01:27:15,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.688888888888889) internal successors, (166), 45 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:27:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 9237 states and 12319 transitions. [2024-11-07 01:27:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 01:27:15,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:27:15,129 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-11-07 01:27:15,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 01:27:15,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:27:15,334 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:27:15,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:27:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash 115923907, now seen corresponding path program 1 times [2024-11-07 01:27:15,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:27:15,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942192729] [2024-11-07 01:27:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:27:15,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:27:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:27:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:27:16,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:27:16,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942192729] [2024-11-07 01:27:16,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942192729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:27:16,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998380160] [2024-11-07 01:27:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:27:16,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:27:16,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:27:16,084 INFO L229 MonitoredProcess]: Starting monitored process 7 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:27:16,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 01:27:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:27:16,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 01:27:16,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:27:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 26 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:27:16,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:27:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:27:17,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998380160] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:27:17,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:27:17,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2024-11-07 01:27:17,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863539204] [2024-11-07 01:27:17,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:27:17,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-07 01:27:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:27:17,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-07 01:27:17,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1083, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 01:27:17,847 INFO L87 Difference]: Start difference. First operand 9237 states and 12319 transitions. Second operand has 35 states, 35 states have (on average 7.685714285714286) internal successors, (269), 35 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:27:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:27:24,304 INFO L93 Difference]: Finished difference Result 28063 states and 35516 transitions. [2024-11-07 01:27:24,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-07 01:27:24,305 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.685714285714286) internal successors, (269), 35 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-07 01:27:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:27:24,325 INFO L225 Difference]: With dead ends: 28063 [2024-11-07 01:27:24,325 INFO L226 Difference]: Without dead ends: 22046 [2024-11-07 01:27:24,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5353 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3030, Invalid=15060, Unknown=0, NotChecked=0, Total=18090 [2024-11-07 01:27:24,334 INFO L432 NwaCegarLoop]: 1569 mSDtfsCounter, 23282 mSDsluCounter, 20948 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23282 SdHoareTripleChecker+Valid, 22517 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:27:24,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23282 Valid, 22517 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:27:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22046 states. [2024-11-07 01:27:24,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22046 to 12616. [2024-11-07 01:27:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12616 states, 12614 states have (on average 1.2970508958300302) internal successors, (16361), 12615 states have internal predecessors, (16361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:27:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12616 states to 12616 states and 16361 transitions. [2024-11-07 01:27:24,888 INFO L78 Accepts]: Start accepts. Automaton has 12616 states and 16361 transitions. Word has length 100 [2024-11-07 01:27:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:27:24,888 INFO L471 AbstractCegarLoop]: Abstraction has 12616 states and 16361 transitions. [2024-11-07 01:27:24,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.685714285714286) internal successors, (269), 35 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:27:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 12616 states and 16361 transitions. [2024-11-07 01:27:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:27:24,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:27:24,891 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 01:27:24,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0