./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.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', '7f3df0b4eae1d513bdc1ba52a53496aa05ff593bd28211e99c6fbfee672a86c9'] 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.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 7f3df0b4eae1d513bdc1ba52a53496aa05ff593bd28211e99c6fbfee672a86c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:29:01,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:29:01,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:29:01,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:29:01,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:29:01,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:29:01,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:29:01,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:29:01,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:29:01,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:29:01,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:29:01,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:29:01,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:29:01,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:29:01,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:29:01,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:29:01,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:29:01,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:29:01,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:29:01,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:29:01,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:29:01,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:29:01,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:29:01,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:29:01,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:29:01,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:29:01,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:29:01,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:29:01,573 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 -> 7f3df0b4eae1d513bdc1ba52a53496aa05ff593bd28211e99c6fbfee672a86c9 [2024-11-07 00:29:01,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:29:01,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:29:01,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:29:01,769 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:29:01,770 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:29:01,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-07 00:29:03,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:29:03,352 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:29:03,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-07 00:29:03,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7047c3c7/2d3604a3830d4c288436320681ab5ed4/FLAGb67e87387 [2024-11-07 00:29:03,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7047c3c7/2d3604a3830d4c288436320681ab5ed4 [2024-11-07 00:29:03,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:29:03,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:29:03,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:29:03,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:29:03,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:29:03,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:29:03" (1/1) ... [2024-11-07 00:29:03,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edc10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:03, skipping insertion in model container [2024-11-07 00:29:03,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:29:03" (1/1) ... [2024-11-07 00:29:03,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:29:03,910 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5819,5832] [2024-11-07 00:29:03,931 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8492,8505] [2024-11-07 00:29:03,941 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11299,11312] [2024-11-07 00:29:03,950 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13874,13887] [2024-11-07 00:29:03,960 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16880,16893] [2024-11-07 00:29:03,968 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19470,19483] [2024-11-07 00:29:03,976 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[22230,22243] [2024-11-07 00:29:03,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:29:04,009 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:29:04,029 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5819,5832] [2024-11-07 00:29:04,035 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8492,8505] [2024-11-07 00:29:04,041 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11299,11312] [2024-11-07 00:29:04,047 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13874,13887] [2024-11-07 00:29:04,053 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16880,16893] [2024-11-07 00:29:04,058 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19470,19483] [2024-11-07 00:29:04,064 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/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[22230,22243] [2024-11-07 00:29:04,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:29:04,088 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:29:04,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04 WrapperNode [2024-11-07 00:29:04,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:29:04,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:29:04,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:29:04,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:29:04,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (1/1) ... [2024-11-07 00:29:04,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (1/1) ... [2024-11-07 00:29:04,168 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1340 [2024-11-07 00:29:04,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:29:04,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:29:04,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:29:04,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:29:04,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (1/1) ... [2024-11-07 00:29:04,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (1/1) ... [2024-11-07 00:29:04,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (1/1) ... [2024-11-07 00:29:04,208 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 00:29:04,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (1/1) ... [2024-11-07 00:29:04,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (1/1) ... [2024-11-07 00:29:04,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (1/1) ... [2024-11-07 00:29:04,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (1/1) ... [2024-11-07 00:29:04,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (1/1) ... [2024-11-07 00:29:04,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (1/1) ... [2024-11-07 00:29:04,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:29:04,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:29:04,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:29:04,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:29:04,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (1/1) ... [2024-11-07 00:29:04,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:29:04,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:04,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:29:04,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:29:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:29:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:29:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:29:04,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:29:04,420 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:29:04,421 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:29:05,269 INFO L? ?]: Removed 222 outVars from TransFormulas that were not future-live. [2024-11-07 00:29:05,269 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:29:05,280 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:29:05,280 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:29:05,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:29:05 BoogieIcfgContainer [2024-11-07 00:29:05,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:29:05,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:29:05,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:29:05,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:29:05,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:29:03" (1/3) ... [2024-11-07 00:29:05,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9bcb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:29:05, skipping insertion in model container [2024-11-07 00:29:05,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:04" (2/3) ... [2024-11-07 00:29:05,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9bcb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:29:05, skipping insertion in model container [2024-11-07 00:29:05,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:29:05" (3/3) ... [2024-11-07 00:29:05,288 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-07 00:29:05,298 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:29:05,298 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-07 00:29:05,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:29:05,341 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;@a6be844, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:29:05,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 00:29:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 266 states, 258 states have (on average 1.8294573643410852) internal successors, (472), 265 states have internal predecessors, (472), 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 00:29:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 00:29:05,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:05,353 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] [2024-11-07 00:29:05,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:05,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash -102713619, now seen corresponding path program 1 times [2024-11-07 00:29:05,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:05,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415998007] [2024-11-07 00:29:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:05,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:05,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415998007] [2024-11-07 00:29:05,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415998007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:05,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:05,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:05,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360469811] [2024-11-07 00:29:05,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:05,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:05,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:05,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:05,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:05,773 INFO L87 Difference]: Start difference. First operand has 266 states, 258 states have (on average 1.8294573643410852) internal successors, (472), 265 states have internal predecessors, (472), 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 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 00:29:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:05,933 INFO L93 Difference]: Finished difference Result 343 states and 586 transitions. [2024-11-07 00:29:05,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:05,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-11-07 00:29:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:05,940 INFO L225 Difference]: With dead ends: 343 [2024-11-07 00:29:05,940 INFO L226 Difference]: Without dead ends: 193 [2024-11-07 00:29:05,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:05,944 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 934 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:05,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 249 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:05,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-07 00:29:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-07 00:29:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 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 00:29:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 238 transitions. [2024-11-07 00:29:05,969 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 238 transitions. Word has length 47 [2024-11-07 00:29:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:05,969 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 238 transitions. [2024-11-07 00:29:05,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 00:29:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2024-11-07 00:29:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 00:29:05,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:05,970 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] [2024-11-07 00:29:05,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:29:05,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:05,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1933719334, now seen corresponding path program 1 times [2024-11-07 00:29:05,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:05,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985409023] [2024-11-07 00:29:05,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:05,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:06,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:06,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985409023] [2024-11-07 00:29:06,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985409023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:06,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:06,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:06,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838632338] [2024-11-07 00:29:06,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:06,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:06,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:06,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:06,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:06,102 INFO L87 Difference]: Start difference. First operand 193 states and 238 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 00:29:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:06,214 INFO L93 Difference]: Finished difference Result 279 states and 353 transitions. [2024-11-07 00:29:06,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:06,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-11-07 00:29:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:06,216 INFO L225 Difference]: With dead ends: 279 [2024-11-07 00:29:06,216 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 00:29:06,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:06,217 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 602 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:06,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 139 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:06,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 00:29:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-07 00:29:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 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 00:29:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 219 transitions. [2024-11-07 00:29:06,223 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 219 transitions. Word has length 47 [2024-11-07 00:29:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:06,223 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 219 transitions. [2024-11-07 00:29:06,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 00:29:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2024-11-07 00:29:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 00:29:06,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:06,224 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] [2024-11-07 00:29:06,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:29:06,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:06,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash 458596476, now seen corresponding path program 1 times [2024-11-07 00:29:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:06,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718558658] [2024-11-07 00:29:06,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:06,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:06,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:06,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718558658] [2024-11-07 00:29:06,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718558658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:06,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:06,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272663880] [2024-11-07 00:29:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:06,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:06,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:06,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:06,335 INFO L87 Difference]: Start difference. First operand 177 states and 219 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 00:29:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:06,480 INFO L93 Difference]: Finished difference Result 339 states and 435 transitions. [2024-11-07 00:29:06,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:06,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-11-07 00:29:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:06,482 INFO L225 Difference]: With dead ends: 339 [2024-11-07 00:29:06,482 INFO L226 Difference]: Without dead ends: 239 [2024-11-07 00:29:06,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:06,483 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 768 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:06,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 190 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-07 00:29:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2024-11-07 00:29:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 214 states have internal predecessors, (281), 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 00:29:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 281 transitions. [2024-11-07 00:29:06,492 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 281 transitions. Word has length 47 [2024-11-07 00:29:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:06,492 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 281 transitions. [2024-11-07 00:29:06,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 00:29:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 281 transitions. [2024-11-07 00:29:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 00:29:06,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:06,493 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 00:29:06,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:29:06,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:06,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:06,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1498085814, now seen corresponding path program 1 times [2024-11-07 00:29:06,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:06,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624566163] [2024-11-07 00:29:06,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:06,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:06,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:06,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624566163] [2024-11-07 00:29:06,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624566163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:06,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:06,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:06,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485852250] [2024-11-07 00:29:06,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:06,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:06,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:06,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:06,810 INFO L87 Difference]: Start difference. First operand 215 states and 281 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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 00:29:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:07,152 INFO L93 Difference]: Finished difference Result 358 states and 474 transitions. [2024-11-07 00:29:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:07,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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 00:29:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:07,154 INFO L225 Difference]: With dead ends: 358 [2024-11-07 00:29:07,154 INFO L226 Difference]: Without dead ends: 353 [2024-11-07 00:29:07,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:29:07,155 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1095 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:07,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 480 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-07 00:29:07,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 215. [2024-11-07 00:29:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3461538461538463) internal successors, (280), 214 states have internal predecessors, (280), 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 00:29:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 280 transitions. [2024-11-07 00:29:07,166 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 280 transitions. Word has length 48 [2024-11-07 00:29:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:07,166 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 280 transitions. [2024-11-07 00:29:07,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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 00:29:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 280 transitions. [2024-11-07 00:29:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 00:29:07,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:07,168 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 00:29:07,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:29:07,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:07,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash 267052195, now seen corresponding path program 1 times [2024-11-07 00:29:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774795209] [2024-11-07 00:29:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:07,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:07,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774795209] [2024-11-07 00:29:07,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774795209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:07,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:07,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:07,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073657203] [2024-11-07 00:29:07,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:07,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:07,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:07,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:07,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:07,391 INFO L87 Difference]: Start difference. First operand 215 states and 280 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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 00:29:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:07,679 INFO L93 Difference]: Finished difference Result 403 states and 541 transitions. [2024-11-07 00:29:07,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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 00:29:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:07,680 INFO L225 Difference]: With dead ends: 403 [2024-11-07 00:29:07,680 INFO L226 Difference]: Without dead ends: 302 [2024-11-07 00:29:07,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:29:07,681 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 802 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:07,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 484 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-07 00:29:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 215. [2024-11-07 00:29:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 214 states have internal predecessors, (279), 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 00:29:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2024-11-07 00:29:07,688 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 48 [2024-11-07 00:29:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:07,689 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2024-11-07 00:29:07,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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 00:29:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2024-11-07 00:29:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 00:29:07,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:07,690 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 00:29:07,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:29:07,690 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:07,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:07,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1788008380, now seen corresponding path program 1 times [2024-11-07 00:29:07,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:07,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555712310] [2024-11-07 00:29:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:07,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:07,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:07,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555712310] [2024-11-07 00:29:07,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555712310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:07,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:07,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:29:07,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508211513] [2024-11-07 00:29:07,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:07,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:29:07,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:07,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:29:07,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:29:07,889 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 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 00:29:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:08,119 INFO L93 Difference]: Finished difference Result 459 states and 614 transitions. [2024-11-07 00:29:08,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:29:08,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 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 00:29:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:08,122 INFO L225 Difference]: With dead ends: 459 [2024-11-07 00:29:08,122 INFO L226 Difference]: Without dead ends: 335 [2024-11-07 00:29:08,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-07 00:29:08,123 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 971 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:08,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 391 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-07 00:29:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2024-11-07 00:29:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3365384615384615) internal successors, (278), 214 states have internal predecessors, (278), 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 00:29:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 278 transitions. [2024-11-07 00:29:08,141 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 278 transitions. Word has length 48 [2024-11-07 00:29:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:08,142 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 278 transitions. [2024-11-07 00:29:08,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 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 00:29:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 278 transitions. [2024-11-07 00:29:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 00:29:08,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:08,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:08,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:29:08,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:08,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:08,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1932349207, now seen corresponding path program 1 times [2024-11-07 00:29:08,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:08,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458449942] [2024-11-07 00:29:08,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:08,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:08,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458449942] [2024-11-07 00:29:08,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458449942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:08,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:08,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:29:08,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200793407] [2024-11-07 00:29:08,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:08,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:29:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:08,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:29:08,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:29:08,668 INFO L87 Difference]: Start difference. First operand 215 states and 278 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 00:29:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:09,083 INFO L93 Difference]: Finished difference Result 349 states and 463 transitions. [2024-11-07 00:29:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:09,084 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 50 [2024-11-07 00:29:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:09,085 INFO L225 Difference]: With dead ends: 349 [2024-11-07 00:29:09,085 INFO L226 Difference]: Without dead ends: 345 [2024-11-07 00:29:09,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:29:09,086 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 931 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:09,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 953 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-07 00:29:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 211. [2024-11-07 00:29:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 205 states have (on average 1.3365853658536586) internal successors, (274), 210 states have internal predecessors, (274), 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 00:29:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 274 transitions. [2024-11-07 00:29:09,092 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 274 transitions. Word has length 50 [2024-11-07 00:29:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:09,092 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 274 transitions. [2024-11-07 00:29:09,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 00:29:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 274 transitions. [2024-11-07 00:29:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 00:29:09,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:09,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:09,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:29:09,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:09,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:09,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1779763646, now seen corresponding path program 1 times [2024-11-07 00:29:09,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:09,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672181863] [2024-11-07 00:29:09,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:09,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:09,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:09,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672181863] [2024-11-07 00:29:09,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672181863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:09,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:09,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:29:09,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668199154] [2024-11-07 00:29:09,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:09,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 00:29:09,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:09,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 00:29:09,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:29:09,442 INFO L87 Difference]: Start difference. First operand 211 states and 274 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 00:29:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:09,741 INFO L93 Difference]: Finished difference Result 401 states and 551 transitions. [2024-11-07 00:29:09,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:29:09,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 50 [2024-11-07 00:29:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:09,742 INFO L225 Difference]: With dead ends: 401 [2024-11-07 00:29:09,743 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 00:29:09,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:29:09,743 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 591 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:09,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 575 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 00:29:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 178. [2024-11-07 00:29:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.3428571428571427) internal successors, (235), 177 states have internal predecessors, (235), 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 00:29:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 235 transitions. [2024-11-07 00:29:09,748 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 235 transitions. Word has length 50 [2024-11-07 00:29:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:09,748 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 235 transitions. [2024-11-07 00:29:09,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 00:29:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 235 transitions. [2024-11-07 00:29:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 00:29:09,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:09,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:09,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:29:09,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:09,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:09,750 INFO L85 PathProgramCache]: Analyzing trace with hash -767196360, now seen corresponding path program 1 times [2024-11-07 00:29:09,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:09,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786087393] [2024-11-07 00:29:09,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:09,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786087393] [2024-11-07 00:29:09,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786087393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:09,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:09,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:09,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114931739] [2024-11-07 00:29:09,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:09,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:09,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:09,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:09,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:09,922 INFO L87 Difference]: Start difference. First operand 178 states and 235 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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 00:29:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:10,155 INFO L93 Difference]: Finished difference Result 305 states and 410 transitions. [2024-11-07 00:29:10,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:10,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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 51 [2024-11-07 00:29:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:10,156 INFO L225 Difference]: With dead ends: 305 [2024-11-07 00:29:10,156 INFO L226 Difference]: Without dead ends: 298 [2024-11-07 00:29:10,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:29:10,157 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 842 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:10,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 364 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-07 00:29:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 178. [2024-11-07 00:29:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.3371428571428572) internal successors, (234), 177 states have internal predecessors, (234), 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 00:29:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 234 transitions. [2024-11-07 00:29:10,162 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 234 transitions. Word has length 51 [2024-11-07 00:29:10,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:10,163 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 234 transitions. [2024-11-07 00:29:10,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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 00:29:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 234 transitions. [2024-11-07 00:29:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 00:29:10,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:10,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:10,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:29:10,164 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:10,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:10,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1195663953, now seen corresponding path program 1 times [2024-11-07 00:29:10,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:10,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403407231] [2024-11-07 00:29:10,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:10,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:10,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403407231] [2024-11-07 00:29:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403407231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:10,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:10,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787942502] [2024-11-07 00:29:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:10,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:10,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:10,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:10,338 INFO L87 Difference]: Start difference. First operand 178 states and 234 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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 00:29:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:10,542 INFO L93 Difference]: Finished difference Result 295 states and 400 transitions. [2024-11-07 00:29:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:10,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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 51 [2024-11-07 00:29:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:10,543 INFO L225 Difference]: With dead ends: 295 [2024-11-07 00:29:10,543 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 00:29:10,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:29:10,544 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 337 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:10,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 366 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:10,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 00:29:10,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-11-07 00:29:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 177 states have internal predecessors, (232), 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 00:29:10,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 232 transitions. [2024-11-07 00:29:10,548 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 232 transitions. Word has length 51 [2024-11-07 00:29:10,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:10,549 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 232 transitions. [2024-11-07 00:29:10,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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 00:29:10,549 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 232 transitions. [2024-11-07 00:29:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:29:10,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:10,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:10,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:29:10,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:10,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:10,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1837589620, now seen corresponding path program 1 times [2024-11-07 00:29:10,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:10,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278320429] [2024-11-07 00:29:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:10,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:11,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:11,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278320429] [2024-11-07 00:29:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278320429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:11,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:11,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 00:29:11,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550127358] [2024-11-07 00:29:11,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:11,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 00:29:11,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:11,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 00:29:11,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:29:11,144 INFO L87 Difference]: Start difference. First operand 178 states and 232 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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 00:29:11,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:11,762 INFO L93 Difference]: Finished difference Result 191 states and 247 transitions. [2024-11-07 00:29:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 00:29:11,762 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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 53 [2024-11-07 00:29:11,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:11,763 INFO L225 Difference]: With dead ends: 191 [2024-11-07 00:29:11,763 INFO L226 Difference]: Without dead ends: 185 [2024-11-07 00:29:11,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2024-11-07 00:29:11,764 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 228 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:11,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1013 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:29:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-07 00:29:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2024-11-07 00:29:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 181 states have (on average 1.3259668508287292) internal successors, (240), 183 states have internal predecessors, (240), 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 00:29:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 240 transitions. [2024-11-07 00:29:11,768 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 240 transitions. Word has length 53 [2024-11-07 00:29:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:11,768 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 240 transitions. [2024-11-07 00:29:11,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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 00:29:11,768 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 240 transitions. [2024-11-07 00:29:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:29:11,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:11,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:11,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:29:11,769 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:11,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash 916052531, now seen corresponding path program 1 times [2024-11-07 00:29:11,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:11,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807340265] [2024-11-07 00:29:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:11,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:12,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:12,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807340265] [2024-11-07 00:29:12,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807340265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:12,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:12,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 00:29:12,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407459410] [2024-11-07 00:29:12,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:12,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 00:29:12,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:12,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 00:29:12,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:29:12,342 INFO L87 Difference]: Start difference. First operand 184 states and 240 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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 00:29:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:12,958 INFO L93 Difference]: Finished difference Result 196 states and 252 transitions. [2024-11-07 00:29:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 00:29:12,959 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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 53 [2024-11-07 00:29:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:12,959 INFO L225 Difference]: With dead ends: 196 [2024-11-07 00:29:12,959 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 00:29:12,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 00:29:12,960 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 399 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:12,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 976 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:29:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 00:29:12,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2024-11-07 00:29:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 184 states have (on average 1.3206521739130435) internal successors, (243), 186 states have internal predecessors, (243), 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 00:29:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 243 transitions. [2024-11-07 00:29:12,966 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 243 transitions. Word has length 53 [2024-11-07 00:29:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:12,967 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 243 transitions. [2024-11-07 00:29:12,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 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 00:29:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 243 transitions. [2024-11-07 00:29:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:29:12,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:12,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:12,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:29:12,968 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:12,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash 576756188, now seen corresponding path program 1 times [2024-11-07 00:29:12,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:12,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329980421] [2024-11-07 00:29:12,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:12,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:13,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329980421] [2024-11-07 00:29:13,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329980421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:13,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:13,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:29:13,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818119551] [2024-11-07 00:29:13,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:13,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:29:13,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:13,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:29:13,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:29:13,304 INFO L87 Difference]: Start difference. First operand 187 states and 243 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 00:29:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:13,697 INFO L93 Difference]: Finished difference Result 291 states and 394 transitions. [2024-11-07 00:29:13,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:29:13,698 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 00:29:13,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:13,699 INFO L225 Difference]: With dead ends: 291 [2024-11-07 00:29:13,699 INFO L226 Difference]: Without dead ends: 285 [2024-11-07 00:29:13,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:29:13,700 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 619 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:13,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 921 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-07 00:29:13,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 175. [2024-11-07 00:29:13,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.3179190751445087) internal successors, (228), 174 states have internal predecessors, (228), 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 00:29:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 228 transitions. [2024-11-07 00:29:13,709 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 228 transitions. Word has length 54 [2024-11-07 00:29:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:13,709 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 228 transitions. [2024-11-07 00:29:13,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 00:29:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 228 transitions. [2024-11-07 00:29:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:29:13,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:13,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:13,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:29:13,710 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:13,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:13,710 INFO L85 PathProgramCache]: Analyzing trace with hash -787967428, now seen corresponding path program 1 times [2024-11-07 00:29:13,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:13,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780586448] [2024-11-07 00:29:13,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:13,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:14,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:14,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780586448] [2024-11-07 00:29:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780586448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:14,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:14,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:29:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312257861] [2024-11-07 00:29:14,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:14,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:29:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:14,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:29:14,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:29:14,088 INFO L87 Difference]: Start difference. First operand 175 states and 228 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 00:29:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:14,381 INFO L93 Difference]: Finished difference Result 175 states and 228 transitions. [2024-11-07 00:29:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:14,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 00:29:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:14,382 INFO L225 Difference]: With dead ends: 175 [2024-11-07 00:29:14,382 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 00:29:14,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:29:14,383 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 172 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:14,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 778 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 00:29:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-07 00:29:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.3270440251572326) internal successors, (211), 159 states have internal predecessors, (211), 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 00:29:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2024-11-07 00:29:14,387 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 54 [2024-11-07 00:29:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:14,387 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2024-11-07 00:29:14,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 00:29:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2024-11-07 00:29:14,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 00:29:14,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:14,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:14,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:29:14,388 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:14,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:14,389 INFO L85 PathProgramCache]: Analyzing trace with hash 415256315, now seen corresponding path program 1 times [2024-11-07 00:29:14,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:14,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798035080] [2024-11-07 00:29:14,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:14,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:14,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:14,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798035080] [2024-11-07 00:29:14,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798035080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:14,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:14,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:14,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6596587] [2024-11-07 00:29:14,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:14,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:14,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:14,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:14,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:14,452 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 00:29:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:14,511 INFO L93 Difference]: Finished difference Result 664 states and 979 transitions. [2024-11-07 00:29:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:29:14,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 71 [2024-11-07 00:29:14,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:14,513 INFO L225 Difference]: With dead ends: 664 [2024-11-07 00:29:14,513 INFO L226 Difference]: Without dead ends: 580 [2024-11-07 00:29:14,513 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 00:29:14,514 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 492 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:14,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 506 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-11-07 00:29:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 242. [2024-11-07 00:29:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.3858921161825726) internal successors, (334), 241 states have internal predecessors, (334), 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 00:29:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 334 transitions. [2024-11-07 00:29:14,526 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 334 transitions. Word has length 71 [2024-11-07 00:29:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:14,527 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 334 transitions. [2024-11-07 00:29:14,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 00:29:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 334 transitions. [2024-11-07 00:29:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 00:29:14,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:14,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:14,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:29:14,528 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:14,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash -237734748, now seen corresponding path program 1 times [2024-11-07 00:29:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:14,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442441326] [2024-11-07 00:29:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:14,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:14,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:14,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442441326] [2024-11-07 00:29:14,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442441326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:14,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:14,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:14,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899765921] [2024-11-07 00:29:14,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:14,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:14,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:14,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:14,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:14,622 INFO L87 Difference]: Start difference. First operand 242 states and 334 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 00:29:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:14,677 INFO L93 Difference]: Finished difference Result 824 states and 1211 transitions. [2024-11-07 00:29:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:14,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 73 [2024-11-07 00:29:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:14,680 INFO L225 Difference]: With dead ends: 824 [2024-11-07 00:29:14,680 INFO L226 Difference]: Without dead ends: 658 [2024-11-07 00:29:14,681 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 00:29:14,682 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 291 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:14,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 438 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-07 00:29:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 406. [2024-11-07 00:29:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.4370370370370371) internal successors, (582), 405 states have internal predecessors, (582), 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 00:29:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 582 transitions. [2024-11-07 00:29:14,693 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 582 transitions. Word has length 73 [2024-11-07 00:29:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:14,693 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 582 transitions. [2024-11-07 00:29:14,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 00:29:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 582 transitions. [2024-11-07 00:29:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 00:29:14,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:14,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:14,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:29:14,695 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:14,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash -871401261, now seen corresponding path program 1 times [2024-11-07 00:29:14,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:14,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955038175] [2024-11-07 00:29:14,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:14,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:14,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:14,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955038175] [2024-11-07 00:29:14,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955038175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:14,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:14,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:14,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765912601] [2024-11-07 00:29:14,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:14,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:14,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:14,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:14,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:14,743 INFO L87 Difference]: Start difference. First operand 406 states and 582 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 00:29:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:14,766 INFO L93 Difference]: Finished difference Result 738 states and 1082 transitions. [2024-11-07 00:29:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:14,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2024-11-07 00:29:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:14,768 INFO L225 Difference]: With dead ends: 738 [2024-11-07 00:29:14,768 INFO L226 Difference]: Without dead ends: 408 [2024-11-07 00:29:14,769 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 00:29:14,769 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 52 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:14,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 201 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-07 00:29:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 406. [2024-11-07 00:29:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.4271604938271605) internal successors, (578), 405 states have internal predecessors, (578), 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 00:29:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 578 transitions. [2024-11-07 00:29:14,779 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 578 transitions. Word has length 73 [2024-11-07 00:29:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:14,779 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 578 transitions. [2024-11-07 00:29:14,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 00:29:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 578 transitions. [2024-11-07 00:29:14,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 00:29:14,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:14,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:14,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:29:14,781 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:14,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:14,781 INFO L85 PathProgramCache]: Analyzing trace with hash -937894773, now seen corresponding path program 1 times [2024-11-07 00:29:14,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:14,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907571602] [2024-11-07 00:29:14,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:14,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:14,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:14,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907571602] [2024-11-07 00:29:14,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907571602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:14,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:14,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:14,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987259710] [2024-11-07 00:29:14,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:14,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:14,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:14,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:14,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:14,821 INFO L87 Difference]: Start difference. First operand 406 states and 578 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 00:29:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:14,845 INFO L93 Difference]: Finished difference Result 1014 states and 1480 transitions. [2024-11-07 00:29:14,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:14,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2024-11-07 00:29:14,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:14,848 INFO L225 Difference]: With dead ends: 1014 [2024-11-07 00:29:14,848 INFO L226 Difference]: Without dead ends: 684 [2024-11-07 00:29:14,848 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 00:29:14,849 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 67 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:14,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 197 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-11-07 00:29:14,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 674. [2024-11-07 00:29:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 673 states have (on average 1.4205052005943537) internal successors, (956), 673 states have internal predecessors, (956), 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 00:29:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 956 transitions. [2024-11-07 00:29:14,862 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 956 transitions. Word has length 73 [2024-11-07 00:29:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:14,862 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 956 transitions. [2024-11-07 00:29:14,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 00:29:14,862 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 956 transitions. [2024-11-07 00:29:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 00:29:14,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:14,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:14,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:29:14,863 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:14,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash -852412764, now seen corresponding path program 1 times [2024-11-07 00:29:14,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:14,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836987947] [2024-11-07 00:29:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:14,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:14,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836987947] [2024-11-07 00:29:14,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836987947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:14,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:14,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:14,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915508781] [2024-11-07 00:29:14,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:14,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:14,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:14,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:14,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:14,938 INFO L87 Difference]: Start difference. First operand 674 states and 956 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 00:29:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:14,992 INFO L93 Difference]: Finished difference Result 1726 states and 2490 transitions. [2024-11-07 00:29:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:14,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 73 [2024-11-07 00:29:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:14,996 INFO L225 Difference]: With dead ends: 1726 [2024-11-07 00:29:14,997 INFO L226 Difference]: Without dead ends: 1426 [2024-11-07 00:29:14,998 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 00:29:14,998 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 294 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:14,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 438 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-11-07 00:29:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1122. [2024-11-07 00:29:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4326494201605708) internal successors, (1606), 1121 states have internal predecessors, (1606), 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 00:29:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1606 transitions. [2024-11-07 00:29:15,026 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1606 transitions. Word has length 73 [2024-11-07 00:29:15,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:15,026 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1606 transitions. [2024-11-07 00:29:15,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 00:29:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1606 transitions. [2024-11-07 00:29:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 00:29:15,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:15,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:15,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:29:15,027 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:15,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:15,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1459706699, now seen corresponding path program 1 times [2024-11-07 00:29:15,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:15,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780230728] [2024-11-07 00:29:15,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:15,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:15,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:15,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780230728] [2024-11-07 00:29:15,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780230728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:15,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:15,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:15,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677876239] [2024-11-07 00:29:15,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:15,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:15,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:15,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:15,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:15,065 INFO L87 Difference]: Start difference. First operand 1122 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 00:29:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:15,095 INFO L93 Difference]: Finished difference Result 2526 states and 3651 transitions. [2024-11-07 00:29:15,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:15,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2024-11-07 00:29:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:15,100 INFO L225 Difference]: With dead ends: 2526 [2024-11-07 00:29:15,100 INFO L226 Difference]: Without dead ends: 1480 [2024-11-07 00:29:15,102 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 00:29:15,103 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 51 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:15,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 281 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2024-11-07 00:29:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1462. [2024-11-07 00:29:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1461 states have (on average 1.4243668720054756) internal successors, (2081), 1461 states have internal predecessors, (2081), 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 00:29:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2081 transitions. [2024-11-07 00:29:15,133 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 2081 transitions. Word has length 74 [2024-11-07 00:29:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:15,134 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 2081 transitions. [2024-11-07 00:29:15,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 00:29:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 2081 transitions. [2024-11-07 00:29:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 00:29:15,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:15,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:15,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:29:15,137 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:15,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1468955342, now seen corresponding path program 1 times [2024-11-07 00:29:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496664036] [2024-11-07 00:29:15,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:15,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:15,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:15,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496664036] [2024-11-07 00:29:15,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496664036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:15,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:15,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274153383] [2024-11-07 00:29:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:15,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:15,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:15,206 INFO L87 Difference]: Start difference. First operand 1462 states and 2081 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 00:29:15,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:15,267 INFO L93 Difference]: Finished difference Result 2676 states and 3839 transitions. [2024-11-07 00:29:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:15,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2024-11-07 00:29:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:15,274 INFO L225 Difference]: With dead ends: 2676 [2024-11-07 00:29:15,274 INFO L226 Difference]: Without dead ends: 2266 [2024-11-07 00:29:15,275 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 00:29:15,275 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 289 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:15,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 465 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2024-11-07 00:29:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 1852. [2024-11-07 00:29:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1851 states have (on average 1.4278768233387358) internal successors, (2643), 1851 states have internal predecessors, (2643), 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 00:29:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2643 transitions. [2024-11-07 00:29:15,319 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2643 transitions. Word has length 74 [2024-11-07 00:29:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:15,319 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 2643 transitions. [2024-11-07 00:29:15,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 00:29:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2643 transitions. [2024-11-07 00:29:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 00:29:15,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:15,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:15,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:29:15,322 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:15,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:15,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1631844587, now seen corresponding path program 1 times [2024-11-07 00:29:15,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:15,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602374615] [2024-11-07 00:29:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:15,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:15,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602374615] [2024-11-07 00:29:15,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602374615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:15,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:15,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:15,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664027142] [2024-11-07 00:29:15,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:15,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:15,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:15,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:15,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:15,388 INFO L87 Difference]: Start difference. First operand 1852 states and 2643 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 00:29:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:15,418 INFO L93 Difference]: Finished difference Result 5188 states and 7385 transitions. [2024-11-07 00:29:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:15,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2024-11-07 00:29:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:15,434 INFO L225 Difference]: With dead ends: 5188 [2024-11-07 00:29:15,434 INFO L226 Difference]: Without dead ends: 3412 [2024-11-07 00:29:15,438 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 00:29:15,439 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 55 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 258 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 00:29:15,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3412 states. [2024-11-07 00:29:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 3194. [2024-11-07 00:29:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 3193 states have (on average 1.4093329157532102) internal successors, (4500), 3193 states have internal predecessors, (4500), 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 00:29:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4500 transitions. [2024-11-07 00:29:15,497 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4500 transitions. Word has length 74 [2024-11-07 00:29:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:15,498 INFO L471 AbstractCegarLoop]: Abstraction has 3194 states and 4500 transitions. [2024-11-07 00:29:15,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 00:29:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4500 transitions. [2024-11-07 00:29:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 00:29:15,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:15,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:15,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:29:15,499 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:15,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:15,500 INFO L85 PathProgramCache]: Analyzing trace with hash -536068422, now seen corresponding path program 1 times [2024-11-07 00:29:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640515607] [2024-11-07 00:29:15,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:15,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:15,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:15,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640515607] [2024-11-07 00:29:15,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640515607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:15,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:15,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:15,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198068513] [2024-11-07 00:29:15,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:15,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:15,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:15,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:15,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:15,570 INFO L87 Difference]: Start difference. First operand 3194 states and 4500 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 00:29:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:15,612 INFO L93 Difference]: Finished difference Result 8998 states and 12578 transitions. [2024-11-07 00:29:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:15,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 75 [2024-11-07 00:29:15,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:15,630 INFO L225 Difference]: With dead ends: 8998 [2024-11-07 00:29:15,630 INFO L226 Difference]: Without dead ends: 5880 [2024-11-07 00:29:15,635 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 00:29:15,636 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 45 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:15,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 257 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5880 states. [2024-11-07 00:29:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5880 to 5446. [2024-11-07 00:29:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5446 states, 5445 states have (on average 1.3796143250688706) internal successors, (7512), 5445 states have internal predecessors, (7512), 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 00:29:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5446 states to 5446 states and 7512 transitions. [2024-11-07 00:29:15,730 INFO L78 Accepts]: Start accepts. Automaton has 5446 states and 7512 transitions. Word has length 75 [2024-11-07 00:29:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:15,730 INFO L471 AbstractCegarLoop]: Abstraction has 5446 states and 7512 transitions. [2024-11-07 00:29:15,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 00:29:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5446 states and 7512 transitions. [2024-11-07 00:29:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:29:15,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:15,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:15,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:29:15,732 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:15,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:15,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1852091383, now seen corresponding path program 1 times [2024-11-07 00:29:15,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:15,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840693729] [2024-11-07 00:29:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:15,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:15,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840693729] [2024-11-07 00:29:15,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840693729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:15,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:15,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:29:15,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769288470] [2024-11-07 00:29:15,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:15,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:29:15,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:15,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:29:15,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:29:15,912 INFO L87 Difference]: Start difference. First operand 5446 states and 7512 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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 00:29:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:15,948 INFO L93 Difference]: Finished difference Result 5544 states and 7641 transitions. [2024-11-07 00:29:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:29:15,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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 76 [2024-11-07 00:29:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:15,967 INFO L225 Difference]: With dead ends: 5544 [2024-11-07 00:29:15,967 INFO L226 Difference]: Without dead ends: 5542 [2024-11-07 00:29:15,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:29:15,970 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:15,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5542 states. [2024-11-07 00:29:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5542 to 5542. [2024-11-07 00:29:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5542 states, 5541 states have (on average 1.3658184443241292) internal successors, (7568), 5541 states have internal predecessors, (7568), 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 00:29:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 7568 transitions. [2024-11-07 00:29:16,052 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 7568 transitions. Word has length 76 [2024-11-07 00:29:16,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:16,052 INFO L471 AbstractCegarLoop]: Abstraction has 5542 states and 7568 transitions. [2024-11-07 00:29:16,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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 00:29:16,052 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 7568 transitions. [2024-11-07 00:29:16,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:29:16,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:16,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:16,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:29:16,054 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:16,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:16,054 INFO L85 PathProgramCache]: Analyzing trace with hash -966335138, now seen corresponding path program 1 times [2024-11-07 00:29:16,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:16,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132767749] [2024-11-07 00:29:16,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:16,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:16,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:16,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132767749] [2024-11-07 00:29:16,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132767749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:16,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:16,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:16,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985293161] [2024-11-07 00:29:16,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:16,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:16,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:16,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:16,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:16,112 INFO L87 Difference]: Start difference. First operand 5542 states and 7568 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 00:29:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:16,154 INFO L93 Difference]: Finished difference Result 12850 states and 17506 transitions. [2024-11-07 00:29:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:16,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2024-11-07 00:29:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:16,173 INFO L225 Difference]: With dead ends: 12850 [2024-11-07 00:29:16,173 INFO L226 Difference]: Without dead ends: 7384 [2024-11-07 00:29:16,180 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 00:29:16,180 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 59 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 259 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 00:29:16,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 259 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7384 states. [2024-11-07 00:29:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7384 to 6774. [2024-11-07 00:29:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6774 states, 6773 states have (on average 1.3335301934150303) internal successors, (9032), 6773 states have internal predecessors, (9032), 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 00:29:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6774 states to 6774 states and 9032 transitions. [2024-11-07 00:29:16,331 INFO L78 Accepts]: Start accepts. Automaton has 6774 states and 9032 transitions. Word has length 77 [2024-11-07 00:29:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:16,332 INFO L471 AbstractCegarLoop]: Abstraction has 6774 states and 9032 transitions. [2024-11-07 00:29:16,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 00:29:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6774 states and 9032 transitions. [2024-11-07 00:29:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:29:16,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:16,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:16,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:29:16,335 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:16,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash 914913403, now seen corresponding path program 1 times [2024-11-07 00:29:16,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:16,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85309928] [2024-11-07 00:29:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:16,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:16,631 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 00:29:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85309928] [2024-11-07 00:29:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85309928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:29:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093636084] [2024-11-07 00:29:16,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:16,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:29:16,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:16,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:29:16,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 00:29:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:16,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 00:29:16,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:29:17,355 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 00:29:17,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:29:18,407 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 00:29:18,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093636084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:29:18,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:29:18,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-11-07 00:29:18,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853329059] [2024-11-07 00:29:18,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:29:18,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 00:29:18,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:18,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 00:29:18,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:29:18,409 INFO L87 Difference]: Start difference. First operand 6774 states and 9032 transitions. Second operand has 28 states, 28 states have (on average 8.392857142857142) internal successors, (235), 27 states have internal predecessors, (235), 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 00:29:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:22,540 INFO L93 Difference]: Finished difference Result 64543 states and 85424 transitions. [2024-11-07 00:29:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-11-07 00:29:22,541 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.392857142857142) internal successors, (235), 27 states have internal predecessors, (235), 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 98 [2024-11-07 00:29:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:22,686 INFO L225 Difference]: With dead ends: 64543 [2024-11-07 00:29:22,686 INFO L226 Difference]: Without dead ends: 57845 [2024-11-07 00:29:22,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7068 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3017, Invalid=18153, Unknown=0, NotChecked=0, Total=21170 [2024-11-07 00:29:22,718 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 2579 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:22,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 1847 Invalid, 2092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:29:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57845 states. [2024-11-07 00:29:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57845 to 25464. [2024-11-07 00:29:23,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25464 states, 25463 states have (on average 1.3217609865294742) internal successors, (33656), 25463 states have internal predecessors, (33656), 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 00:29:23,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25464 states to 25464 states and 33656 transitions. [2024-11-07 00:29:23,310 INFO L78 Accepts]: Start accepts. Automaton has 25464 states and 33656 transitions. Word has length 98 [2024-11-07 00:29:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:23,310 INFO L471 AbstractCegarLoop]: Abstraction has 25464 states and 33656 transitions. [2024-11-07 00:29:23,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.392857142857142) internal successors, (235), 27 states have internal predecessors, (235), 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 00:29:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 25464 states and 33656 transitions. [2024-11-07 00:29:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:29:23,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:23,314 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:23,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 00:29:23,519 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,SelfDestructingSolverStorable25 [2024-11-07 00:29:23,519 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:23,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:23,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1809238733, now seen corresponding path program 1 times [2024-11-07 00:29:23,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:23,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111241793] [2024-11-07 00:29:23,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:23,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:23,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:23,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111241793] [2024-11-07 00:29:23,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111241793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:23,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:23,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:23,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703428690] [2024-11-07 00:29:23,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:23,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:23,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:23,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:23,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:23,582 INFO L87 Difference]: Start difference. First operand 25464 states and 33656 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 00:29:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:23,780 INFO L93 Difference]: Finished difference Result 50087 states and 66235 transitions. [2024-11-07 00:29:23,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:23,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2024-11-07 00:29:23,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:23,809 INFO L225 Difference]: With dead ends: 50087 [2024-11-07 00:29:23,809 INFO L226 Difference]: Without dead ends: 24706 [2024-11-07 00:29:23,822 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 00:29:23,823 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 55 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:23,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 239 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24706 states. [2024-11-07 00:29:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24706 to 24529. [2024-11-07 00:29:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24529 states, 24528 states have (on average 1.2961921069797782) internal successors, (31793), 24528 states have internal predecessors, (31793), 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 00:29:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24529 states to 24529 states and 31793 transitions. [2024-11-07 00:29:24,043 INFO L78 Accepts]: Start accepts. Automaton has 24529 states and 31793 transitions. Word has length 98 [2024-11-07 00:29:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:24,043 INFO L471 AbstractCegarLoop]: Abstraction has 24529 states and 31793 transitions. [2024-11-07 00:29:24,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 00:29:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 24529 states and 31793 transitions. [2024-11-07 00:29:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:29:24,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:24,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:24,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 00:29:24,046 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:24,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:24,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1600083782, now seen corresponding path program 1 times [2024-11-07 00:29:24,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:24,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307842792] [2024-11-07 00:29:24,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:24,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:24,504 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 00:29:24,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:24,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307842792] [2024-11-07 00:29:24,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307842792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:29:24,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075903302] [2024-11-07 00:29:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:24,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:29:24,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:24,507 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:29:24,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 00:29:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:24,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 00:29:24,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:29:25,124 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 00:29:25,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:29:25,762 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 00:29:25,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075903302] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:29:25,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:29:25,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2024-11-07 00:29:25,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056695549] [2024-11-07 00:29:25,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:29:25,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 00:29:25,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:25,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 00:29:25,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:29:25,763 INFO L87 Difference]: Start difference. First operand 24529 states and 31793 transitions. Second operand has 28 states, 28 states have (on average 9.642857142857142) internal successors, (270), 28 states have internal predecessors, (270), 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 00:29:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:35,164 INFO L93 Difference]: Finished difference Result 120105 states and 154351 transitions. [2024-11-07 00:29:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-11-07 00:29:35,165 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.642857142857142) internal successors, (270), 28 states have internal predecessors, (270), 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 99 [2024-11-07 00:29:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:35,406 INFO L225 Difference]: With dead ends: 120105 [2024-11-07 00:29:35,406 INFO L226 Difference]: Without dead ends: 95659 [2024-11-07 00:29:35,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19498 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=7084, Invalid=41978, Unknown=0, NotChecked=0, Total=49062 [2024-11-07 00:29:35,490 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 5412 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5412 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 3035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:35,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5412 Valid, 1708 Invalid, 3035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 00:29:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95659 states. [2024-11-07 00:29:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95659 to 57162. [2024-11-07 00:29:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57162 states, 57161 states have (on average 1.2910550900089222) internal successors, (73798), 57161 states have internal predecessors, (73798), 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 00:29:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57162 states to 57162 states and 73798 transitions. [2024-11-07 00:29:36,988 INFO L78 Accepts]: Start accepts. Automaton has 57162 states and 73798 transitions. Word has length 99 [2024-11-07 00:29:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:36,988 INFO L471 AbstractCegarLoop]: Abstraction has 57162 states and 73798 transitions. [2024-11-07 00:29:36,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.642857142857142) internal successors, (270), 28 states have internal predecessors, (270), 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 00:29:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 57162 states and 73798 transitions. [2024-11-07 00:29:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:29:36,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:36,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:37,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 00:29:37,195 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,SelfDestructingSolverStorable27 [2024-11-07 00:29:37,195 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:37,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:37,197 INFO L85 PathProgramCache]: Analyzing trace with hash 44373165, now seen corresponding path program 1 times [2024-11-07 00:29:37,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:37,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806744977] [2024-11-07 00:29:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 00:29:37,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:37,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806744977] [2024-11-07 00:29:37,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806744977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:37,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:37,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:37,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305049372] [2024-11-07 00:29:37,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:37,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:37,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:37,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:37,282 INFO L87 Difference]: Start difference. First operand 57162 states and 73798 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 00:29:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:37,666 INFO L93 Difference]: Finished difference Result 99412 states and 128778 transitions. [2024-11-07 00:29:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:37,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 00:29:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:37,716 INFO L225 Difference]: With dead ends: 99412 [2024-11-07 00:29:37,717 INFO L226 Difference]: Without dead ends: 42366 [2024-11-07 00:29:37,752 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 00:29:37,754 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 83 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:37,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 103 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42366 states. [2024-11-07 00:29:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42366 to 42066. [2024-11-07 00:29:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42066 states, 42065 states have (on average 1.2826577915131345) internal successors, (53955), 42065 states have internal predecessors, (53955), 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 00:29:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42066 states to 42066 states and 53955 transitions. [2024-11-07 00:29:38,333 INFO L78 Accepts]: Start accepts. Automaton has 42066 states and 53955 transitions. Word has length 100 [2024-11-07 00:29:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:38,333 INFO L471 AbstractCegarLoop]: Abstraction has 42066 states and 53955 transitions. [2024-11-07 00:29:38,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 00:29:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 42066 states and 53955 transitions. [2024-11-07 00:29:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:29:38,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:38,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:38,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 00:29:38,338 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:38,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1119659590, now seen corresponding path program 1 times [2024-11-07 00:29:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:38,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466408823] [2024-11-07 00:29:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 00:29:38,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:38,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466408823] [2024-11-07 00:29:38,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466408823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:38,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:38,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:29:38,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476757990] [2024-11-07 00:29:38,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:38,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:29:38,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:38,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:29:38,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:29:38,765 INFO L87 Difference]: Start difference. First operand 42066 states and 53955 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 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 00:29:39,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:39,491 INFO L93 Difference]: Finished difference Result 108845 states and 138734 transitions. [2024-11-07 00:29:39,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:29:39,492 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 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 00:29:39,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:39,619 INFO L225 Difference]: With dead ends: 108845 [2024-11-07 00:29:39,619 INFO L226 Difference]: Without dead ends: 66883 [2024-11-07 00:29:39,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:29:39,706 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1416 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:39,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 449 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:29:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66883 states. [2024-11-07 00:29:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66883 to 42066. [2024-11-07 00:29:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42066 states, 42065 states have (on average 1.2826102460477833) internal successors, (53953), 42065 states have internal predecessors, (53953), 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 00:29:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42066 states to 42066 states and 53953 transitions. [2024-11-07 00:29:40,401 INFO L78 Accepts]: Start accepts. Automaton has 42066 states and 53953 transitions. Word has length 100 [2024-11-07 00:29:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:40,401 INFO L471 AbstractCegarLoop]: Abstraction has 42066 states and 53953 transitions. [2024-11-07 00:29:40,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 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 00:29:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 42066 states and 53953 transitions. [2024-11-07 00:29:40,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:29:40,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:40,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:40,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 00:29:40,406 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:40,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash -679937044, now seen corresponding path program 1 times [2024-11-07 00:29:40,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:40,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75525232] [2024-11-07 00:29:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:40,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:40,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 00:29:40,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:40,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75525232] [2024-11-07 00:29:40,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75525232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:40,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:40,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:40,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001887693] [2024-11-07 00:29:40,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:40,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:29:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:40,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:29:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:29:40,563 INFO L87 Difference]: Start difference. First operand 42066 states and 53953 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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 00:29:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:40,782 INFO L93 Difference]: Finished difference Result 101464 states and 129719 transitions. [2024-11-07 00:29:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:29:40,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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 00:29:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:40,851 INFO L225 Difference]: With dead ends: 101464 [2024-11-07 00:29:40,851 INFO L226 Difference]: Without dead ends: 59514 [2024-11-07 00:29:40,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:40,885 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 80 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:40,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 222 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59514 states. [2024-11-07 00:29:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59514 to 41820. [2024-11-07 00:29:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41820 states, 41819 states have (on average 1.2783902054090246) internal successors, (53461), 41819 states have internal predecessors, (53461), 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 00:29:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41820 states to 41820 states and 53461 transitions. [2024-11-07 00:29:41,549 INFO L78 Accepts]: Start accepts. Automaton has 41820 states and 53461 transitions. Word has length 100 [2024-11-07 00:29:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:41,549 INFO L471 AbstractCegarLoop]: Abstraction has 41820 states and 53461 transitions. [2024-11-07 00:29:41,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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 00:29:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 41820 states and 53461 transitions. [2024-11-07 00:29:41,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:29:41,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:41,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:41,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 00:29:41,558 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:41,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash 595165645, now seen corresponding path program 1 times [2024-11-07 00:29:41,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:41,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231104368] [2024-11-07 00:29:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:42,136 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 00:29:42,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:42,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231104368] [2024-11-07 00:29:42,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231104368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:29:42,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880248266] [2024-11-07 00:29:42,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:42,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:29:42,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:42,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:29:42,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 00:29:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:42,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 00:29:42,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:29:42,809 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 00:29:42,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:29:43,266 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 00:29:43,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880248266] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:29:43,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:29:43,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-07 00:29:43,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838426283] [2024-11-07 00:29:43,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:29:43,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 00:29:43,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:43,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 00:29:43,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2024-11-07 00:29:43,269 INFO L87 Difference]: Start difference. First operand 41820 states and 53461 transitions. Second operand has 24 states, 24 states have (on average 11.291666666666666) internal successors, (271), 24 states have internal predecessors, (271), 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 00:29:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:46,884 INFO L93 Difference]: Finished difference Result 134135 states and 170392 transitions. [2024-11-07 00:29:46,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-11-07 00:29:46,884 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 11.291666666666666) internal successors, (271), 24 states have internal predecessors, (271), 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 00:29:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:47,015 INFO L225 Difference]: With dead ends: 134135 [2024-11-07 00:29:47,016 INFO L226 Difference]: Without dead ends: 107977 [2024-11-07 00:29:47,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3975 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2034, Invalid=11076, Unknown=0, NotChecked=0, Total=13110 [2024-11-07 00:29:47,046 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1023 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 3039 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:47,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 2258 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3039 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:29:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107977 states. [2024-11-07 00:29:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107977 to 57431. [2024-11-07 00:29:47,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57431 states, 57430 states have (on average 1.2791920598990074) internal successors, (73464), 57430 states have internal predecessors, (73464), 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 00:29:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57431 states to 57431 states and 73464 transitions. [2024-11-07 00:29:47,869 INFO L78 Accepts]: Start accepts. Automaton has 57431 states and 73464 transitions. Word has length 100 [2024-11-07 00:29:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:47,869 INFO L471 AbstractCegarLoop]: Abstraction has 57431 states and 73464 transitions. [2024-11-07 00:29:47,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.291666666666666) internal successors, (271), 24 states have internal predecessors, (271), 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 00:29:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 57431 states and 73464 transitions. [2024-11-07 00:29:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:29:47,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:47,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:47,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 00:29:48,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:29:48,077 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:48,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:48,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1968061963, now seen corresponding path program 1 times [2024-11-07 00:29:48,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:48,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247108421] [2024-11-07 00:29:48,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:48,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:48,594 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 00:29:48,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:48,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247108421] [2024-11-07 00:29:48,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247108421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:29:48,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164112276] [2024-11-07 00:29:48,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:48,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:29:48,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:48,596 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:29:48,597 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 00:29:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:48,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 00:29:48,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:29:49,275 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 00:29:49,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:29:50,463 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 00:29:50,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164112276] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:29:50,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:29:50,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-11-07 00:29:50,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636362004] [2024-11-07 00:29:50,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:29:50,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 00:29:50,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:50,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 00:29:50,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-11-07 00:29:50,464 INFO L87 Difference]: Start difference. First operand 57431 states and 73464 transitions. Second operand has 26 states, 26 states have (on average 8.73076923076923) internal successors, (227), 25 states have internal predecessors, (227), 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 00:29:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:51,295 INFO L93 Difference]: Finished difference Result 106190 states and 135574 transitions. [2024-11-07 00:29:51,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 00:29:51,296 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.73076923076923) internal successors, (227), 25 states have internal predecessors, (227), 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 101 [2024-11-07 00:29:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:51,391 INFO L225 Difference]: With dead ends: 106190 [2024-11-07 00:29:51,391 INFO L226 Difference]: Without dead ends: 79334 [2024-11-07 00:29:51,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=346, Invalid=1294, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 00:29:51,427 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 492 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:51,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1250 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:29:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79334 states. [2024-11-07 00:29:52,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79334 to 62298. [2024-11-07 00:29:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62298 states, 62297 states have (on average 1.2783280093744482) internal successors, (79636), 62297 states have internal predecessors, (79636), 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 00:29:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62298 states to 62298 states and 79636 transitions. [2024-11-07 00:29:52,531 INFO L78 Accepts]: Start accepts. Automaton has 62298 states and 79636 transitions. Word has length 101 [2024-11-07 00:29:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:52,531 INFO L471 AbstractCegarLoop]: Abstraction has 62298 states and 79636 transitions. [2024-11-07 00:29:52,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.73076923076923) internal successors, (227), 25 states have internal predecessors, (227), 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 00:29:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 62298 states and 79636 transitions. [2024-11-07 00:29:52,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:29:52,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:52,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:52,556 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 00:29:52,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-07 00:29:52,736 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:52,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1868298, now seen corresponding path program 1 times [2024-11-07 00:29:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:52,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719130875] [2024-11-07 00:29:52,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:52,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 00:29:53,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:53,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719130875] [2024-11-07 00:29:53,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719130875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:53,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:53,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:53,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722247900] [2024-11-07 00:29:53,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:53,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:53,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:53,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:53,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:53,051 INFO L87 Difference]: Start difference. First operand 62298 states and 79636 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 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 00:29:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:53,717 INFO L93 Difference]: Finished difference Result 156231 states and 199638 transitions. [2024-11-07 00:29:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:29:53,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 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 101 [2024-11-07 00:29:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:53,837 INFO L225 Difference]: With dead ends: 156231 [2024-11-07 00:29:53,837 INFO L226 Difference]: Without dead ends: 98886 [2024-11-07 00:29:53,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:29:53,863 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 365 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:53,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 465 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98886 states. [2024-11-07 00:29:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98886 to 62290. [2024-11-07 00:29:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62290 states, 62289 states have (on average 1.278331647642441) internal successors, (79626), 62289 states have internal predecessors, (79626), 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 00:29:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62290 states to 62290 states and 79626 transitions. [2024-11-07 00:29:55,378 INFO L78 Accepts]: Start accepts. Automaton has 62290 states and 79626 transitions. Word has length 101 [2024-11-07 00:29:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:55,379 INFO L471 AbstractCegarLoop]: Abstraction has 62290 states and 79626 transitions. [2024-11-07 00:29:55,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 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 00:29:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 62290 states and 79626 transitions. [2024-11-07 00:29:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 00:29:55,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:55,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:55,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 00:29:55,382 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:55,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:55,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2099092396, now seen corresponding path program 1 times [2024-11-07 00:29:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:55,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487272267] [2024-11-07 00:29:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 00:29:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487272267] [2024-11-07 00:29:55,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487272267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:55,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:55,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:55,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799246052] [2024-11-07 00:29:55,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:55,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:55,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:55,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:55,417 INFO L87 Difference]: Start difference. First operand 62290 states and 79626 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 00:29:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:55,724 INFO L93 Difference]: Finished difference Result 117787 states and 150939 transitions. [2024-11-07 00:29:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:55,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 102 [2024-11-07 00:29:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:55,791 INFO L225 Difference]: With dead ends: 117787 [2024-11-07 00:29:55,791 INFO L226 Difference]: Without dead ends: 55648 [2024-11-07 00:29:55,823 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 00:29:55,823 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 85 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:55,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 135 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55648 states. [2024-11-07 00:29:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55648 to 55648. [2024-11-07 00:29:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55648 states, 55647 states have (on average 1.2701852750372886) internal successors, (70682), 55647 states have internal predecessors, (70682), 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 00:29:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55648 states to 55648 states and 70682 transitions. [2024-11-07 00:29:56,604 INFO L78 Accepts]: Start accepts. Automaton has 55648 states and 70682 transitions. Word has length 102 [2024-11-07 00:29:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:56,604 INFO L471 AbstractCegarLoop]: Abstraction has 55648 states and 70682 transitions. [2024-11-07 00:29:56,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 00:29:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 55648 states and 70682 transitions. [2024-11-07 00:29:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 00:29:56,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:56,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:56,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 00:29:56,607 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:56,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1858682910, now seen corresponding path program 1 times [2024-11-07 00:29:56,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:56,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588238667] [2024-11-07 00:29:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-07 00:29:56,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:56,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588238667] [2024-11-07 00:29:56,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588238667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:56,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:56,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:56,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649806642] [2024-11-07 00:29:56,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:56,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:56,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:56,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:56,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:56,654 INFO L87 Difference]: Start difference. First operand 55648 states and 70682 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 00:29:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:56,996 INFO L93 Difference]: Finished difference Result 102310 states and 130047 transitions. [2024-11-07 00:29:56,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:56,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 102 [2024-11-07 00:29:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:57,057 INFO L225 Difference]: With dead ends: 102310 [2024-11-07 00:29:57,057 INFO L226 Difference]: Without dead ends: 46783 [2024-11-07 00:29:57,075 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 00:29:57,076 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 81 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:57,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 118 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46783 states. [2024-11-07 00:29:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46783 to 46783. [2024-11-07 00:29:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46783 states, 46782 states have (on average 1.2507374631268438) internal successors, (58512), 46782 states have internal predecessors, (58512), 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 00:29:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46783 states to 46783 states and 58512 transitions. [2024-11-07 00:29:57,557 INFO L78 Accepts]: Start accepts. Automaton has 46783 states and 58512 transitions. Word has length 102 [2024-11-07 00:29:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:57,557 INFO L471 AbstractCegarLoop]: Abstraction has 46783 states and 58512 transitions. [2024-11-07 00:29:57,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 00:29:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 46783 states and 58512 transitions. [2024-11-07 00:29:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 00:29:57,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:57,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:57,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 00:29:57,560 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:57,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash -783672287, now seen corresponding path program 1 times [2024-11-07 00:29:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:57,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8315531] [2024-11-07 00:29:57,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:57,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:59,128 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 00:29:59,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:59,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8315531] [2024-11-07 00:29:59,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8315531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:29:59,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818475870] [2024-11-07 00:29:59,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:59,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:29:59,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:59,131 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 00:29:59,136 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 00:29:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:59,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-07 00:29:59,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:30:02,530 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 00:30:02,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:30:04,592 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 00:30:04,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818475870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:30:04,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:30:04,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 20] total 62 [2024-11-07 00:30:04,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252788123] [2024-11-07 00:30:04,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:30:04,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-07 00:30:04,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-07 00:30:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3510, Unknown=0, NotChecked=0, Total=3782 [2024-11-07 00:30:04,596 INFO L87 Difference]: Start difference. First operand 46783 states and 58512 transitions. Second operand has 62 states, 62 states have (on average 4.467741935483871) internal successors, (277), 62 states have internal predecessors, (277), 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 00:30:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:16,658 INFO L93 Difference]: Finished difference Result 147648 states and 184558 transitions. [2024-11-07 00:30:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-11-07 00:30:16,659 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.467741935483871) internal successors, (277), 62 states have internal predecessors, (277), 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 102 [2024-11-07 00:30:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:16,785 INFO L225 Difference]: With dead ends: 147648 [2024-11-07 00:30:16,786 INFO L226 Difference]: Without dead ends: 100986 [2024-11-07 00:30:16,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3108 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2137, Invalid=14375, Unknown=0, NotChecked=0, Total=16512 [2024-11-07 00:30:16,831 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 2576 mSDsluCounter, 5645 mSDsCounter, 0 mSdLazyCounter, 4025 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2576 SdHoareTripleChecker+Valid, 5777 SdHoareTripleChecker+Invalid, 4076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 4025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:16,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2576 Valid, 5777 Invalid, 4076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 4025 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 00:30:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100986 states. [2024-11-07 00:30:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100986 to 61522. [2024-11-07 00:30:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61522 states, 61521 states have (on average 1.2508574307959883) internal successors, (76954), 61521 states have internal predecessors, (76954), 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 00:30:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61522 states to 61522 states and 76954 transitions. [2024-11-07 00:30:18,052 INFO L78 Accepts]: Start accepts. Automaton has 61522 states and 76954 transitions. Word has length 102 [2024-11-07 00:30:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:18,053 INFO L471 AbstractCegarLoop]: Abstraction has 61522 states and 76954 transitions. [2024-11-07 00:30:18,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.467741935483871) internal successors, (277), 62 states have internal predecessors, (277), 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 00:30:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 61522 states and 76954 transitions. [2024-11-07 00:30:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 00:30:18,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:18,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:18,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 00:30:18,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-07 00:30:18,260 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:30:18,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:18,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2078637285, now seen corresponding path program 1 times [2024-11-07 00:30:18,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:18,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229602221] [2024-11-07 00:30:18,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:18,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 00:30:18,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:18,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229602221] [2024-11-07 00:30:18,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229602221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:18,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:18,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 00:30:18,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703688909] [2024-11-07 00:30:18,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:18,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 00:30:18,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:18,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 00:30:18,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:30:18,705 INFO L87 Difference]: Start difference. First operand 61522 states and 76954 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 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 00:30:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:19,427 INFO L93 Difference]: Finished difference Result 87620 states and 109739 transitions. [2024-11-07 00:30:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 00:30:19,428 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 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 102 [2024-11-07 00:30:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:19,494 INFO L225 Difference]: With dead ends: 87620 [2024-11-07 00:30:19,495 INFO L226 Difference]: Without dead ends: 56157 [2024-11-07 00:30:19,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:30:19,527 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 198 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:19,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 970 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:30:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56157 states. [2024-11-07 00:30:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56157 to 56157. [2024-11-07 00:30:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56157 states, 56156 states have (on average 1.2513355652111975) internal successors, (70270), 56156 states have internal predecessors, (70270), 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 00:30:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56157 states to 56157 states and 70270 transitions. [2024-11-07 00:30:20,211 INFO L78 Accepts]: Start accepts. Automaton has 56157 states and 70270 transitions. Word has length 102 [2024-11-07 00:30:20,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:20,211 INFO L471 AbstractCegarLoop]: Abstraction has 56157 states and 70270 transitions. [2024-11-07 00:30:20,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 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 00:30:20,211 INFO L276 IsEmpty]: Start isEmpty. Operand 56157 states and 70270 transitions. [2024-11-07 00:30:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 00:30:20,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:20,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:20,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 00:30:20,214 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:30:20,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:20,214 INFO L85 PathProgramCache]: Analyzing trace with hash -843570899, now seen corresponding path program 1 times [2024-11-07 00:30:20,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:20,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587882179] [2024-11-07 00:30:20,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:20,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:21,279 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 00:30:21,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587882179] [2024-11-07 00:30:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587882179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:30:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339494473] [2024-11-07 00:30:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:21,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:30:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:30:21,283 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 00:30:21,285 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 00:30:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:21,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 00:30:21,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:30:22,167 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 00:30:22,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:30:22,873 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 00:30:22,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339494473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:30:22,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:30:22,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 11] total 42 [2024-11-07 00:30:22,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185278144] [2024-11-07 00:30:22,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:30:22,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-07 00:30:22,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:22,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-07 00:30:22,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1611, Unknown=0, NotChecked=0, Total=1722 [2024-11-07 00:30:22,875 INFO L87 Difference]: Start difference. First operand 56157 states and 70270 transitions. Second operand has 42 states, 42 states have (on average 6.5476190476190474) internal successors, (275), 42 states have internal predecessors, (275), 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)