./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.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-var-start-time.3.1.ufo.BOUNDED-6.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', '532121231e517c5ccd98a51763e37538cc4af219147e372fd62404dc9cc0f64d'] 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-var-start-time.3.1.ufo.BOUNDED-6.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 532121231e517c5ccd98a51763e37538cc4af219147e372fd62404dc9cc0f64d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:21:49,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:21:49,147 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:21:49,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:21:49,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:21:49,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:21:49,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:21:49,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:21:49,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:21:49,180 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:21:49,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:21:49,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:21:49,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:21:49,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:21:49,182 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:21:49,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:21:49,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:21:49,182 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:21:49,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:21:49,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:21:49,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:21:49,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:21:49,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:21:49,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:21:49,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:21:49,183 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:21:49,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:21:49,183 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:21:49,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:21:49,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:21:49,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:21:49,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:21:49,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:21:49,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:21:49,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:21:49,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:21:49,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:21:49,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:21:49,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:21:49,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:21:49,185 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:21:49,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:21:49,185 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 -> 532121231e517c5ccd98a51763e37538cc4af219147e372fd62404dc9cc0f64d [2024-11-07 00:21:49,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:21:49,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:21:49,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:21:49,610 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:21:49,610 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:21:49,612 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-11-07 00:21:50,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:21:51,254 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:21:51,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-11-07 00:21:51,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/659b871ff/0931ccb1475b4aca9b143bacc5407067/FLAG7ca9bdb4a [2024-11-07 00:21:51,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/659b871ff/0931ccb1475b4aca9b143bacc5407067 [2024-11-07 00:21:51,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:21:51,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:21:51,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:21:51,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:21:51,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:21:51,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:21:51" (1/1) ... [2024-11-07 00:21:51,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@597b2c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:51, skipping insertion in model container [2024-11-07 00:21:51,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:21:51" (1/1) ... [2024-11-07 00:21:51,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:21:51,671 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8426,8439] [2024-11-07 00:21:51,704 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12993,13006] [2024-11-07 00:21:51,751 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[20763,20776] [2024-11-07 00:21:51,768 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[27894,27907] [2024-11-07 00:21:51,829 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[49218,49231] [2024-11-07 00:21:51,880 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[80449,80462] [2024-11-07 00:21:52,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:21:52,029 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:21:52,056 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8426,8439] [2024-11-07 00:21:52,066 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12993,13006] [2024-11-07 00:21:52,083 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[20763,20776] [2024-11-07 00:21:52,096 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[27894,27907] [2024-11-07 00:21:52,127 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[49218,49231] [2024-11-07 00:21:52,172 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[80449,80462] [2024-11-07 00:21:52,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:21:52,273 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:21:52,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:52 WrapperNode [2024-11-07 00:21:52,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:21:52,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:21:52,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:21:52,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:21:52,282 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:21:52" (1/1) ... [2024-11-07 00:21:52,353 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:21:52" (1/1) ... [2024-11-07 00:21:52,497 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6446 [2024-11-07 00:21:52,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:21:52,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:21:52,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:21:52,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:21:52,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:52" (1/1) ... [2024-11-07 00:21:52,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:52" (1/1) ... [2024-11-07 00:21:52,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:52" (1/1) ... [2024-11-07 00:21:52,584 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:21:52,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:52" (1/1) ... [2024-11-07 00:21:52,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:52" (1/1) ... [2024-11-07 00:21:52,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:52" (1/1) ... [2024-11-07 00:21:52,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:52" (1/1) ... [2024-11-07 00:21:52,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:52" (1/1) ... [2024-11-07 00:21:52,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:52" (1/1) ... [2024-11-07 00:21:52,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:21:52,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:21:52,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:21:52,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:21:52,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:52" (1/1) ... [2024-11-07 00:21:52,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:21:52,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:21:52,749 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:21:52,752 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:21:52,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:21:52,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:21:52,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:21:52,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:21:53,014 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:21:53,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:21:55,698 INFO L? ?]: Removed 1251 outVars from TransFormulas that were not future-live. [2024-11-07 00:21:55,699 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:21:55,740 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:21:55,740 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:21:55,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:21:55 BoogieIcfgContainer [2024-11-07 00:21:55,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:21:55,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:21:55,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:21:55,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:21:55,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:21:51" (1/3) ... [2024-11-07 00:21:55,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52382f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:21:55, skipping insertion in model container [2024-11-07 00:21:55,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:21:52" (2/3) ... [2024-11-07 00:21:55,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52382f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:21:55, skipping insertion in model container [2024-11-07 00:21:55,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:21:55" (3/3) ... [2024-11-07 00:21:55,753 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-11-07 00:21:55,765 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:21:55,766 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-07 00:21:55,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:21:55,863 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;@55dde4d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:21:55,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 00:21:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 1290 states, 1283 states have (on average 1.7716289945440373) internal successors, (2273), 1289 states have internal predecessors, (2273), 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:21:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:21:55,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:55,903 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] [2024-11-07 00:21:55,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:21:55,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:55,908 INFO L85 PathProgramCache]: Analyzing trace with hash 692081489, now seen corresponding path program 1 times [2024-11-07 00:21:55,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:55,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991923152] [2024-11-07 00:21:55,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:55,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:56,470 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:21:56,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:56,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991923152] [2024-11-07 00:21:56,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991923152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:56,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:56,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:21:56,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3495532] [2024-11-07 00:21:56,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:56,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:21:56,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:56,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:21:56,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:21:56,499 INFO L87 Difference]: Start difference. First operand has 1290 states, 1283 states have (on average 1.7716289945440373) internal successors, (2273), 1289 states have internal predecessors, (2273), 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 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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:21:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:57,724 INFO L93 Difference]: Finished difference Result 2522 states and 4334 transitions. [2024-11-07 00:21:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:21:57,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2024-11-07 00:21:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:57,751 INFO L225 Difference]: With dead ends: 2522 [2024-11-07 00:21:57,751 INFO L226 Difference]: Without dead ends: 1598 [2024-11-07 00:21:57,759 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:21:57,762 INFO L432 NwaCegarLoop]: 1054 mSDtfsCounter, 7094 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7094 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:57,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7094 Valid, 1564 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:21:57,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2024-11-07 00:21:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1592. [2024-11-07 00:21:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1586 states have (on average 1.3076923076923077) internal successors, (2074), 1591 states have internal predecessors, (2074), 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:21:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2074 transitions. [2024-11-07 00:21:57,859 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2074 transitions. Word has length 52 [2024-11-07 00:21:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:57,860 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2074 transitions. [2024-11-07 00:21:57,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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:21:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2074 transitions. [2024-11-07 00:21:57,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:21:57,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:57,866 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:21:57,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:21:57,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:21:57,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:57,867 INFO L85 PathProgramCache]: Analyzing trace with hash -736362272, now seen corresponding path program 1 times [2024-11-07 00:21:57,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:57,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226211254] [2024-11-07 00:21:57,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:57,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:58,058 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:21:58,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:58,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226211254] [2024-11-07 00:21:58,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226211254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:58,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:58,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:21:58,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414877943] [2024-11-07 00:21:58,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:58,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:21:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:58,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:21:58,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:21:58,060 INFO L87 Difference]: Start difference. First operand 1592 states and 2074 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:21:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:58,854 INFO L93 Difference]: Finished difference Result 3210 states and 4213 transitions. [2024-11-07 00:21:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:21:58,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:21:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:58,862 INFO L225 Difference]: With dead ends: 3210 [2024-11-07 00:21:58,862 INFO L226 Difference]: Without dead ends: 2216 [2024-11-07 00:21:58,864 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:21:58,865 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 4976 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4976 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:58,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4976 Valid, 1044 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:21:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2024-11-07 00:21:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2202. [2024-11-07 00:21:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 2196 states have (on average 1.3183060109289617) internal successors, (2895), 2201 states have internal predecessors, (2895), 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:21:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2895 transitions. [2024-11-07 00:21:58,911 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2895 transitions. Word has length 53 [2024-11-07 00:21:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:58,911 INFO L471 AbstractCegarLoop]: Abstraction has 2202 states and 2895 transitions. [2024-11-07 00:21:58,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:21:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2895 transitions. [2024-11-07 00:21:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:21:58,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:58,915 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:21:58,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:21:58,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:21:58,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:58,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1386389066, now seen corresponding path program 1 times [2024-11-07 00:21:58,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:58,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684196503] [2024-11-07 00:21:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:58,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:59,058 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:21:59,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:59,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684196503] [2024-11-07 00:21:59,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684196503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:59,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:59,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:21:59,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756156758] [2024-11-07 00:21:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:59,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:21:59,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:59,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:21:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:21:59,060 INFO L87 Difference]: Start difference. First operand 2202 states and 2895 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:21:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:59,789 INFO L93 Difference]: Finished difference Result 4509 states and 5999 transitions. [2024-11-07 00:21:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:21:59,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:21:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:59,800 INFO L225 Difference]: With dead ends: 4509 [2024-11-07 00:21:59,800 INFO L226 Difference]: Without dead ends: 3078 [2024-11-07 00:21:59,803 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:21:59,804 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 4462 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4462 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:59,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4462 Valid, 932 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:21:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2024-11-07 00:21:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 3068. [2024-11-07 00:21:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3062 states have (on average 1.3229915088177662) internal successors, (4051), 3067 states have internal predecessors, (4051), 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:21:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4051 transitions. [2024-11-07 00:21:59,870 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4051 transitions. Word has length 53 [2024-11-07 00:21:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:59,871 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4051 transitions. [2024-11-07 00:21:59,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:21:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4051 transitions. [2024-11-07 00:21:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:21:59,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:59,874 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] [2024-11-07 00:21:59,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:21:59,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:21:59,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1763239895, now seen corresponding path program 1 times [2024-11-07 00:21:59,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:59,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998725270] [2024-11-07 00:21:59,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:59,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:00,297 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:22:00,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:00,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998725270] [2024-11-07 00:22:00,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998725270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:00,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:00,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:22:00,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905154398] [2024-11-07 00:22:00,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:00,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:22:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:22:00,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:22:00,300 INFO L87 Difference]: Start difference. First operand 3068 states and 4051 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:01,288 INFO L93 Difference]: Finished difference Result 4445 states and 5991 transitions. [2024-11-07 00:22:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:22:01,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-07 00:22:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:01,299 INFO L225 Difference]: With dead ends: 4445 [2024-11-07 00:22:01,299 INFO L226 Difference]: Without dead ends: 3741 [2024-11-07 00:22:01,301 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:22:01,302 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 6207 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6207 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:01,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6207 Valid, 2210 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:22:01,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2024-11-07 00:22:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3068. [2024-11-07 00:22:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3062 states have (on average 1.3226649248856956) internal successors, (4050), 3067 states have internal predecessors, (4050), 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:22:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4050 transitions. [2024-11-07 00:22:01,399 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4050 transitions. Word has length 55 [2024-11-07 00:22:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:01,399 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4050 transitions. [2024-11-07 00:22:01,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4050 transitions. [2024-11-07 00:22:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:22:01,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:01,402 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] [2024-11-07 00:22:01,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:22:01,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:01,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:01,404 INFO L85 PathProgramCache]: Analyzing trace with hash 622296368, now seen corresponding path program 1 times [2024-11-07 00:22:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463503739] [2024-11-07 00:22:01,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:01,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:01,788 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:22:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:01,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463503739] [2024-11-07 00:22:01,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463503739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:01,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:01,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:22:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319630701] [2024-11-07 00:22:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:01,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:22:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:01,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:22:01,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:22:01,791 INFO L87 Difference]: Start difference. First operand 3068 states and 4050 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:03,317 INFO L93 Difference]: Finished difference Result 5229 states and 7082 transitions. [2024-11-07 00:22:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:22:03,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-07 00:22:03,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:03,330 INFO L225 Difference]: With dead ends: 5229 [2024-11-07 00:22:03,330 INFO L226 Difference]: Without dead ends: 4659 [2024-11-07 00:22:03,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:22:03,333 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 5146 mSDsluCounter, 2924 mSDsCounter, 0 mSdLazyCounter, 3647 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5146 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 3700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:03,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5146 Valid, 3567 Invalid, 3700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3647 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 00:22:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2024-11-07 00:22:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 3068. [2024-11-07 00:22:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3062 states have (on average 1.3223383409536251) internal successors, (4049), 3067 states have internal predecessors, (4049), 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:22:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4049 transitions. [2024-11-07 00:22:03,395 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4049 transitions. Word has length 55 [2024-11-07 00:22:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:03,396 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4049 transitions. [2024-11-07 00:22:03,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4049 transitions. [2024-11-07 00:22:03,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:22:03,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:03,399 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] [2024-11-07 00:22:03,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:22:03,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:03,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1268497001, now seen corresponding path program 1 times [2024-11-07 00:22:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:03,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323241409] [2024-11-07 00:22:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:03,651 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:22:03,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:03,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323241409] [2024-11-07 00:22:03,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323241409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:03,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:03,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:22:03,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638360330] [2024-11-07 00:22:03,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:03,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:22:03,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:03,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:22:03,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:22:03,653 INFO L87 Difference]: Start difference. First operand 3068 states and 4049 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:04,804 INFO L93 Difference]: Finished difference Result 4393 states and 5884 transitions. [2024-11-07 00:22:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:22:04,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-07 00:22:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:04,815 INFO L225 Difference]: With dead ends: 4393 [2024-11-07 00:22:04,816 INFO L226 Difference]: Without dead ends: 4387 [2024-11-07 00:22:04,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:22:04,818 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 5271 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5271 SdHoareTripleChecker+Valid, 2972 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:04,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5271 Valid, 2972 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:22:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4387 states. [2024-11-07 00:22:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4387 to 3068. [2024-11-07 00:22:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3062 states have (on average 1.3220117570215546) internal successors, (4048), 3067 states have internal predecessors, (4048), 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:22:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4048 transitions. [2024-11-07 00:22:04,886 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4048 transitions. Word has length 55 [2024-11-07 00:22:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:04,886 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4048 transitions. [2024-11-07 00:22:04,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4048 transitions. [2024-11-07 00:22:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:22:04,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:04,889 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] [2024-11-07 00:22:04,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:22:04,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:04,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:04,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1662572980, now seen corresponding path program 1 times [2024-11-07 00:22:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:04,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080842751] [2024-11-07 00:22:04,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:04,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:04,950 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:22:04,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:04,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080842751] [2024-11-07 00:22:04,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080842751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:04,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:04,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:22:04,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764945374] [2024-11-07 00:22:04,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:04,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:22:04,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:04,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:22:04,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:22:04,952 INFO L87 Difference]: Start difference. First operand 3068 states and 4048 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:05,002 INFO L93 Difference]: Finished difference Result 4024 states and 5497 transitions. [2024-11-07 00:22:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:22:05,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-07 00:22:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:05,012 INFO L225 Difference]: With dead ends: 4024 [2024-11-07 00:22:05,012 INFO L226 Difference]: Without dead ends: 3087 [2024-11-07 00:22:05,014 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:22:05,015 INFO L432 NwaCegarLoop]: 1186 mSDtfsCounter, 579 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:05,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1790 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:22:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2024-11-07 00:22:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 3085. [2024-11-07 00:22:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3085 states, 3079 states have (on average 1.3380967846703475) internal successors, (4120), 3084 states have internal predecessors, (4120), 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:22:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 4120 transitions. [2024-11-07 00:22:05,053 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 4120 transitions. Word has length 56 [2024-11-07 00:22:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:05,054 INFO L471 AbstractCegarLoop]: Abstraction has 3085 states and 4120 transitions. [2024-11-07 00:22:05,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 4120 transitions. [2024-11-07 00:22:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:22:05,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:05,056 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] [2024-11-07 00:22:05,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:22:05,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:05,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1775531576, now seen corresponding path program 1 times [2024-11-07 00:22:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:05,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838298687] [2024-11-07 00:22:05,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:05,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:05,125 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:22:05,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838298687] [2024-11-07 00:22:05,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838298687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:05,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:05,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:22:05,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452529823] [2024-11-07 00:22:05,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:05,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:22:05,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:05,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:22:05,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:22:05,128 INFO L87 Difference]: Start difference. First operand 3085 states and 4120 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:05,176 INFO L93 Difference]: Finished difference Result 4759 states and 6655 transitions. [2024-11-07 00:22:05,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:22:05,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-07 00:22:05,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:05,189 INFO L225 Difference]: With dead ends: 4759 [2024-11-07 00:22:05,189 INFO L226 Difference]: Without dead ends: 3515 [2024-11-07 00:22:05,195 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:22:05,195 INFO L432 NwaCegarLoop]: 1145 mSDtfsCounter, 587 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:05,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1728 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:22:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3515 states. [2024-11-07 00:22:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3515 to 3513. [2024-11-07 00:22:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3513 states, 3507 states have (on average 1.3695466210436271) internal successors, (4803), 3512 states have internal predecessors, (4803), 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:22:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 3513 states and 4803 transitions. [2024-11-07 00:22:05,237 INFO L78 Accepts]: Start accepts. Automaton has 3513 states and 4803 transitions. Word has length 56 [2024-11-07 00:22:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:05,237 INFO L471 AbstractCegarLoop]: Abstraction has 3513 states and 4803 transitions. [2024-11-07 00:22:05,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 4803 transitions. [2024-11-07 00:22:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:22:05,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:05,239 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] [2024-11-07 00:22:05,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:22:05,240 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:05,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:05,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1498951000, now seen corresponding path program 1 times [2024-11-07 00:22:05,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:05,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915653897] [2024-11-07 00:22:05,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:05,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:05,297 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:22:05,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:05,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915653897] [2024-11-07 00:22:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915653897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:05,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:05,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:22:05,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862142214] [2024-11-07 00:22:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:05,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:22:05,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:05,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:22:05,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:22:05,300 INFO L87 Difference]: Start difference. First operand 3513 states and 4803 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:05,396 INFO L93 Difference]: Finished difference Result 7723 states and 10788 transitions. [2024-11-07 00:22:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:22:05,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-07 00:22:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:05,427 INFO L225 Difference]: With dead ends: 7723 [2024-11-07 00:22:05,428 INFO L226 Difference]: Without dead ends: 5314 [2024-11-07 00:22:05,430 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:22:05,431 INFO L432 NwaCegarLoop]: 1215 mSDtfsCounter, 657 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:05,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1963 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:22:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2024-11-07 00:22:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 5308. [2024-11-07 00:22:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5308 states, 5302 states have (on average 1.3583553376084496) internal successors, (7202), 5307 states have internal predecessors, (7202), 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:22:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 7202 transitions. [2024-11-07 00:22:05,492 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 7202 transitions. Word has length 56 [2024-11-07 00:22:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:05,493 INFO L471 AbstractCegarLoop]: Abstraction has 5308 states and 7202 transitions. [2024-11-07 00:22:05,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 7202 transitions. [2024-11-07 00:22:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:22:05,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:05,496 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] [2024-11-07 00:22:05,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:22:05,496 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:05,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:05,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1118792296, now seen corresponding path program 1 times [2024-11-07 00:22:05,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:05,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897624572] [2024-11-07 00:22:05,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:05,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:06,004 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:22:06,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:06,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897624572] [2024-11-07 00:22:06,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897624572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:06,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:06,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:22:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600262589] [2024-11-07 00:22:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:06,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:22:06,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:22:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:22:06,005 INFO L87 Difference]: Start difference. First operand 5308 states and 7202 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:07,223 INFO L93 Difference]: Finished difference Result 11230 states and 15600 transitions. [2024-11-07 00:22:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:22:07,224 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-07 00:22:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:07,242 INFO L225 Difference]: With dead ends: 11230 [2024-11-07 00:22:07,243 INFO L226 Difference]: Without dead ends: 11119 [2024-11-07 00:22:07,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:22:07,247 INFO L432 NwaCegarLoop]: 940 mSDtfsCounter, 6876 mSDsluCounter, 4432 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6876 SdHoareTripleChecker+Valid, 5372 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:07,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6876 Valid, 5372 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:22:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11119 states. [2024-11-07 00:22:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11119 to 5295. [2024-11-07 00:22:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5295 states, 5290 states have (on average 1.3586011342155009) internal successors, (7187), 5294 states have internal predecessors, (7187), 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:22:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 7187 transitions. [2024-11-07 00:22:07,345 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 7187 transitions. Word has length 57 [2024-11-07 00:22:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:07,345 INFO L471 AbstractCegarLoop]: Abstraction has 5295 states and 7187 transitions. [2024-11-07 00:22:07,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 7187 transitions. [2024-11-07 00:22:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:22:07,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:07,348 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] [2024-11-07 00:22:07,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:22:07,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:07,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash -677466950, now seen corresponding path program 1 times [2024-11-07 00:22:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:07,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100386516] [2024-11-07 00:22:07,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:07,401 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:22:07,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:07,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100386516] [2024-11-07 00:22:07,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100386516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:07,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:07,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:22:07,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298138638] [2024-11-07 00:22:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:07,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:22:07,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:07,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:22:07,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:22:07,403 INFO L87 Difference]: Start difference. First operand 5295 states and 7187 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:07,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:07,493 INFO L93 Difference]: Finished difference Result 9765 states and 13510 transitions. [2024-11-07 00:22:07,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:22:07,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-07 00:22:07,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:07,502 INFO L225 Difference]: With dead ends: 9765 [2024-11-07 00:22:07,503 INFO L226 Difference]: Without dead ends: 5599 [2024-11-07 00:22:07,507 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:22:07,508 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 820 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:07,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1221 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:22:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5599 states. [2024-11-07 00:22:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5599 to 4466. [2024-11-07 00:22:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4466 states, 4462 states have (on average 1.3798744957418199) internal successors, (6157), 4465 states have internal predecessors, (6157), 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:22:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 6157 transitions. [2024-11-07 00:22:07,560 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 6157 transitions. Word has length 57 [2024-11-07 00:22:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:07,560 INFO L471 AbstractCegarLoop]: Abstraction has 4466 states and 6157 transitions. [2024-11-07 00:22:07,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:07,561 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 6157 transitions. [2024-11-07 00:22:07,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:22:07,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:07,563 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] [2024-11-07 00:22:07,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:22:07,563 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:07,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:07,563 INFO L85 PathProgramCache]: Analyzing trace with hash -611117000, now seen corresponding path program 1 times [2024-11-07 00:22:07,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:07,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015837854] [2024-11-07 00:22:07,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:07,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:07,607 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:22:07,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:07,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015837854] [2024-11-07 00:22:07,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015837854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:07,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:07,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:22:07,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470002990] [2024-11-07 00:22:07,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:07,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:22:07,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:07,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:22:07,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:22:07,609 INFO L87 Difference]: Start difference. First operand 4466 states and 6157 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:07,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:07,685 INFO L93 Difference]: Finished difference Result 8537 states and 11996 transitions. [2024-11-07 00:22:07,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:22:07,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-07 00:22:07,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:07,694 INFO L225 Difference]: With dead ends: 8537 [2024-11-07 00:22:07,695 INFO L226 Difference]: Without dead ends: 4871 [2024-11-07 00:22:07,699 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:22:07,700 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 638 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:07,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1002 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:22:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2024-11-07 00:22:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 3897. [2024-11-07 00:22:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3897 states, 3894 states have (on average 1.3931689779147407) internal successors, (5425), 3896 states have internal predecessors, (5425), 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:22:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 5425 transitions. [2024-11-07 00:22:07,783 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 5425 transitions. Word has length 57 [2024-11-07 00:22:07,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:07,783 INFO L471 AbstractCegarLoop]: Abstraction has 3897 states and 5425 transitions. [2024-11-07 00:22:07,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 5425 transitions. [2024-11-07 00:22:07,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:22:07,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:07,785 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] [2024-11-07 00:22:07,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:22:07,785 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:07,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:07,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1274837938, now seen corresponding path program 1 times [2024-11-07 00:22:07,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:07,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261108880] [2024-11-07 00:22:07,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:07,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:07,830 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:22:07,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261108880] [2024-11-07 00:22:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261108880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:07,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:07,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:22:07,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368038018] [2024-11-07 00:22:07,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:07,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:22:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:07,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:22:07,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:22:07,831 INFO L87 Difference]: Start difference. First operand 3897 states and 5425 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:07,922 INFO L93 Difference]: Finished difference Result 7794 states and 11032 transitions. [2024-11-07 00:22:07,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:22:07,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-07 00:22:07,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:07,930 INFO L225 Difference]: With dead ends: 7794 [2024-11-07 00:22:07,930 INFO L226 Difference]: Without dead ends: 4239 [2024-11-07 00:22:07,934 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:22:07,935 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 453 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:07,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 828 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:22:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4239 states. [2024-11-07 00:22:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4239 to 3480. [2024-11-07 00:22:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3480 states, 3477 states have (on average 1.4075352315214265) internal successors, (4894), 3479 states have internal predecessors, (4894), 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:22:07,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 4894 transitions. [2024-11-07 00:22:07,973 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 4894 transitions. Word has length 57 [2024-11-07 00:22:07,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:07,973 INFO L471 AbstractCegarLoop]: Abstraction has 3480 states and 4894 transitions. [2024-11-07 00:22:07,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:22:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 4894 transitions. [2024-11-07 00:22:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 00:22:07,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:07,974 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] [2024-11-07 00:22:07,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:22:07,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:07,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:07,975 INFO L85 PathProgramCache]: Analyzing trace with hash -410378211, now seen corresponding path program 1 times [2024-11-07 00:22:07,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:07,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716443953] [2024-11-07 00:22:07,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:07,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:08,423 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:22:08,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:08,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716443953] [2024-11-07 00:22:08,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716443953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:08,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:08,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:22:08,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752163899] [2024-11-07 00:22:08,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:08,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:22:08,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:08,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:22:08,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:22:08,425 INFO L87 Difference]: Start difference. First operand 3480 states and 4894 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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:22:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:09,024 INFO L93 Difference]: Finished difference Result 7141 states and 10107 transitions. [2024-11-07 00:22:09,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:22:09,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 58 [2024-11-07 00:22:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:09,036 INFO L225 Difference]: With dead ends: 7141 [2024-11-07 00:22:09,036 INFO L226 Difference]: Without dead ends: 6989 [2024-11-07 00:22:09,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:22:09,039 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 3483 mSDsluCounter, 2537 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3483 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:09,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3483 Valid, 3118 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:22:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6989 states. [2024-11-07 00:22:09,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6989 to 3426. [2024-11-07 00:22:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3426 states, 3424 states have (on average 1.4082943925233644) internal successors, (4822), 3425 states have internal predecessors, (4822), 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:22:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3426 states to 3426 states and 4822 transitions. [2024-11-07 00:22:09,090 INFO L78 Accepts]: Start accepts. Automaton has 3426 states and 4822 transitions. Word has length 58 [2024-11-07 00:22:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:09,090 INFO L471 AbstractCegarLoop]: Abstraction has 3426 states and 4822 transitions. [2024-11-07 00:22:09,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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:22:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3426 states and 4822 transitions. [2024-11-07 00:22:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 00:22:09,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:09,092 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] [2024-11-07 00:22:09,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:22:09,092 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:09,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1645651769, now seen corresponding path program 1 times [2024-11-07 00:22:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:09,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930403091] [2024-11-07 00:22:09,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:09,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:09,521 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:22:09,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:09,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930403091] [2024-11-07 00:22:09,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930403091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:09,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:09,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:22:09,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433953731] [2024-11-07 00:22:09,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:09,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:22:09,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:09,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:22:09,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:22:09,523 INFO L87 Difference]: Start difference. First operand 3426 states and 4822 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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:22:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:10,099 INFO L93 Difference]: Finished difference Result 5650 states and 8015 transitions. [2024-11-07 00:22:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:22:10,099 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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 58 [2024-11-07 00:22:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:10,108 INFO L225 Difference]: With dead ends: 5650 [2024-11-07 00:22:10,108 INFO L226 Difference]: Without dead ends: 5646 [2024-11-07 00:22:10,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:22:10,111 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 2806 mSDsluCounter, 2814 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2806 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:10,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2806 Valid, 3339 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:22:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5646 states. [2024-11-07 00:22:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5646 to 3422. [2024-11-07 00:22:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3422 states, 3421 states have (on average 1.4083601286173633) internal successors, (4818), 3421 states have internal predecessors, (4818), 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:22:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4818 transitions. [2024-11-07 00:22:10,178 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4818 transitions. Word has length 58 [2024-11-07 00:22:10,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:10,178 INFO L471 AbstractCegarLoop]: Abstraction has 3422 states and 4818 transitions. [2024-11-07 00:22:10,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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:22:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4818 transitions. [2024-11-07 00:22:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 00:22:10,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:10,181 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] [2024-11-07 00:22:10,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:22:10,181 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:10,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1327663405, now seen corresponding path program 1 times [2024-11-07 00:22:10,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:10,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446992994] [2024-11-07 00:22:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:10,260 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:22:10,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446992994] [2024-11-07 00:22:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446992994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:10,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:10,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:22:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104647313] [2024-11-07 00:22:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:10,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:22:10,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:10,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:22:10,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:22:10,262 INFO L87 Difference]: Start difference. First operand 3422 states and 4818 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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:22:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:10,344 INFO L93 Difference]: Finished difference Result 10542 states and 15214 transitions. [2024-11-07 00:22:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:22:10,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-07 00:22:10,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:10,356 INFO L225 Difference]: With dead ends: 10542 [2024-11-07 00:22:10,356 INFO L226 Difference]: Without dead ends: 7756 [2024-11-07 00:22:10,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:22:10,361 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 1590 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:10,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 1115 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:22:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7756 states. [2024-11-07 00:22:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7756 to 5898. [2024-11-07 00:22:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5898 states, 5897 states have (on average 1.4098694251314228) internal successors, (8314), 5897 states have internal predecessors, (8314), 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:22:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5898 states to 5898 states and 8314 transitions. [2024-11-07 00:22:10,427 INFO L78 Accepts]: Start accepts. Automaton has 5898 states and 8314 transitions. Word has length 66 [2024-11-07 00:22:10,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:10,427 INFO L471 AbstractCegarLoop]: Abstraction has 5898 states and 8314 transitions. [2024-11-07 00:22:10,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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:22:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 5898 states and 8314 transitions. [2024-11-07 00:22:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 00:22:10,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:10,429 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] [2024-11-07 00:22:10,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:22:10,430 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:10,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:10,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2106166862, now seen corresponding path program 1 times [2024-11-07 00:22:10,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:10,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316308280] [2024-11-07 00:22:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:10,513 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:22:10,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:10,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316308280] [2024-11-07 00:22:10,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316308280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:10,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:10,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:22:10,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272022098] [2024-11-07 00:22:10,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:10,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:22:10,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:10,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:22:10,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:22:10,514 INFO L87 Difference]: Start difference. First operand 5898 states and 8314 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:22:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:10,585 INFO L93 Difference]: Finished difference Result 9996 states and 14191 transitions. [2024-11-07 00:22:10,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:22:10,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2024-11-07 00:22:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:10,593 INFO L225 Difference]: With dead ends: 9996 [2024-11-07 00:22:10,593 INFO L226 Difference]: Without dead ends: 4712 [2024-11-07 00:22:10,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:22:10,599 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 1109 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:10,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 913 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:22:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4712 states. [2024-11-07 00:22:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4712 to 4708. [2024-11-07 00:22:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4708 states, 4707 states have (on average 1.3964308476736775) internal successors, (6573), 4707 states have internal predecessors, (6573), 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:22:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4708 states to 4708 states and 6573 transitions. [2024-11-07 00:22:10,644 INFO L78 Accepts]: Start accepts. Automaton has 4708 states and 6573 transitions. Word has length 67 [2024-11-07 00:22:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:10,645 INFO L471 AbstractCegarLoop]: Abstraction has 4708 states and 6573 transitions. [2024-11-07 00:22:10,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:22:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 4708 states and 6573 transitions. [2024-11-07 00:22:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 00:22:10,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:10,647 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] [2024-11-07 00:22:10,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:22:10,647 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:10,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:10,648 INFO L85 PathProgramCache]: Analyzing trace with hash -565252104, now seen corresponding path program 1 times [2024-11-07 00:22:10,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:10,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313279694] [2024-11-07 00:22:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:10,728 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:22:10,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:10,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313279694] [2024-11-07 00:22:10,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313279694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:10,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:10,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:22:10,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81560781] [2024-11-07 00:22:10,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:10,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:22:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:10,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:22:10,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:22:10,730 INFO L87 Difference]: Start difference. First operand 4708 states and 6573 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:22:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:10,828 INFO L93 Difference]: Finished difference Result 12516 states and 17707 transitions. [2024-11-07 00:22:10,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:22:10,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2024-11-07 00:22:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:10,841 INFO L225 Difference]: With dead ends: 12516 [2024-11-07 00:22:10,841 INFO L226 Difference]: Without dead ends: 8422 [2024-11-07 00:22:10,846 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:22:10,846 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 280 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:10,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 868 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:22:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2024-11-07 00:22:10,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 7908. [2024-11-07 00:22:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7908 states, 7907 states have (on average 1.3981282407992919) internal successors, (11055), 7907 states have internal predecessors, (11055), 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:22:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7908 states to 7908 states and 11055 transitions. [2024-11-07 00:22:10,957 INFO L78 Accepts]: Start accepts. Automaton has 7908 states and 11055 transitions. Word has length 69 [2024-11-07 00:22:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:10,958 INFO L471 AbstractCegarLoop]: Abstraction has 7908 states and 11055 transitions. [2024-11-07 00:22:10,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:22:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 7908 states and 11055 transitions. [2024-11-07 00:22:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 00:22:10,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:10,961 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] [2024-11-07 00:22:10,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:22:10,961 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:10,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:10,962 INFO L85 PathProgramCache]: Analyzing trace with hash -195732182, now seen corresponding path program 1 times [2024-11-07 00:22:10,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:10,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106985334] [2024-11-07 00:22:10,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:10,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:11,073 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:22:11,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:11,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106985334] [2024-11-07 00:22:11,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106985334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:11,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:11,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:22:11,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293694397] [2024-11-07 00:22:11,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:11,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:22:11,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:22:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:22:11,074 INFO L87 Difference]: Start difference. First operand 7908 states and 11055 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:22:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:11,152 INFO L93 Difference]: Finished difference Result 21738 states and 30539 transitions. [2024-11-07 00:22:11,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:22:11,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2024-11-07 00:22:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:11,173 INFO L225 Difference]: With dead ends: 21738 [2024-11-07 00:22:11,173 INFO L226 Difference]: Without dead ends: 14428 [2024-11-07 00:22:11,183 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:22:11,183 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 325 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:11,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 828 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:22:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14428 states. [2024-11-07 00:22:11,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14428 to 13402. [2024-11-07 00:22:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13402 states, 13401 states have (on average 1.3883292291620029) internal successors, (18605), 13401 states have internal predecessors, (18605), 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:22:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13402 states to 13402 states and 18605 transitions. [2024-11-07 00:22:11,330 INFO L78 Accepts]: Start accepts. Automaton has 13402 states and 18605 transitions. Word has length 72 [2024-11-07 00:22:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:11,330 INFO L471 AbstractCegarLoop]: Abstraction has 13402 states and 18605 transitions. [2024-11-07 00:22:11,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:22:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 13402 states and 18605 transitions. [2024-11-07 00:22:11,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 00:22:11,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:11,334 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] [2024-11-07 00:22:11,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:22:11,334 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:11,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash 950824169, now seen corresponding path program 1 times [2024-11-07 00:22:11,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:11,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195495838] [2024-11-07 00:22:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:22:11,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:11,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195495838] [2024-11-07 00:22:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195495838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:11,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:11,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:22:11,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017906456] [2024-11-07 00:22:11,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:11,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:22:11,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:11,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:22:11,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:22:11,546 INFO L87 Difference]: Start difference. First operand 13402 states and 18605 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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:22:11,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:11,683 INFO L93 Difference]: Finished difference Result 14508 states and 20078 transitions. [2024-11-07 00:22:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:22:11,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 72 [2024-11-07 00:22:11,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:11,709 INFO L225 Difference]: With dead ends: 14508 [2024-11-07 00:22:11,709 INFO L226 Difference]: Without dead ends: 14506 [2024-11-07 00:22:11,714 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:22:11,714 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 0 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:11,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2580 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:22:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14506 states. [2024-11-07 00:22:11,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14506 to 14506. [2024-11-07 00:22:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14506 states, 14505 states have (on average 1.358772836952775) internal successors, (19709), 14505 states have internal predecessors, (19709), 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:22:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14506 states to 14506 states and 19709 transitions. [2024-11-07 00:22:11,869 INFO L78 Accepts]: Start accepts. Automaton has 14506 states and 19709 transitions. Word has length 72 [2024-11-07 00:22:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:11,869 INFO L471 AbstractCegarLoop]: Abstraction has 14506 states and 19709 transitions. [2024-11-07 00:22:11,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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:22:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 14506 states and 19709 transitions. [2024-11-07 00:22:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 00:22:11,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:11,871 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:22:11,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:22:11,871 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:11,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash -467379378, now seen corresponding path program 1 times [2024-11-07 00:22:11,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:11,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641362346] [2024-11-07 00:22:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:11,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:11,921 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:22:11,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641362346] [2024-11-07 00:22:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641362346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:22:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725667809] [2024-11-07 00:22:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:11,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:22:11,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:11,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:22:11,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:22:11,924 INFO L87 Difference]: Start difference. First operand 14506 states and 19709 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:22:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:12,027 INFO L93 Difference]: Finished difference Result 39233 states and 53330 transitions. [2024-11-07 00:22:12,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:22:12,028 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:22:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:12,064 INFO L225 Difference]: With dead ends: 39233 [2024-11-07 00:22:12,065 INFO L226 Difference]: Without dead ends: 25327 [2024-11-07 00:22:12,083 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:22:12,084 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 294 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:12,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 814 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:22:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25327 states. [2024-11-07 00:22:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25327 to 25325. [2024-11-07 00:22:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25325 states, 25324 states have (on average 1.3397567524877587) internal successors, (33928), 25324 states have internal predecessors, (33928), 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:22:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25325 states to 25325 states and 33928 transitions. [2024-11-07 00:22:12,494 INFO L78 Accepts]: Start accepts. Automaton has 25325 states and 33928 transitions. Word has length 73 [2024-11-07 00:22:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:12,494 INFO L471 AbstractCegarLoop]: Abstraction has 25325 states and 33928 transitions. [2024-11-07 00:22:12,494 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:22:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 25325 states and 33928 transitions. [2024-11-07 00:22:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:22:12,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:12,497 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:22:12,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:22:12,497 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:12,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1772479294, now seen corresponding path program 1 times [2024-11-07 00:22:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:12,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219472024] [2024-11-07 00:22:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:12,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:12,582 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:22:12,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:12,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219472024] [2024-11-07 00:22:12,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219472024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:12,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:12,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:22:12,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946308118] [2024-11-07 00:22:12,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:12,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:22:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:12,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:22:12,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:22:12,584 INFO L87 Difference]: Start difference. First operand 25325 states and 33928 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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:22:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:12,740 INFO L93 Difference]: Finished difference Result 43377 states and 58312 transitions. [2024-11-07 00:22:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:22:12,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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:22:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:12,793 INFO L225 Difference]: With dead ends: 43377 [2024-11-07 00:22:12,793 INFO L226 Difference]: Without dead ends: 35983 [2024-11-07 00:22:12,811 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:22:12,812 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 999 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:12,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 1408 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:22:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35983 states. [2024-11-07 00:22:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35983 to 31337. [2024-11-07 00:22:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31337 states, 31336 states have (on average 1.3353331631350522) internal successors, (41844), 31336 states have internal predecessors, (41844), 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:22:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31337 states to 31337 states and 41844 transitions. [2024-11-07 00:22:13,338 INFO L78 Accepts]: Start accepts. Automaton has 31337 states and 41844 transitions. Word has length 77 [2024-11-07 00:22:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:13,338 INFO L471 AbstractCegarLoop]: Abstraction has 31337 states and 41844 transitions. [2024-11-07 00:22:13,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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:22:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31337 states and 41844 transitions. [2024-11-07 00:22:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:22:13,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:13,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:22:13,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:22:13,341 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:13,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:13,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1856799535, now seen corresponding path program 1 times [2024-11-07 00:22:13,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:13,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735931664] [2024-11-07 00:22:13,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:13,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:13,430 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:22:13,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:13,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735931664] [2024-11-07 00:22:13,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735931664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:13,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:13,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:22:13,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143219981] [2024-11-07 00:22:13,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:13,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:22:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:22:13,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:22:13,431 INFO L87 Difference]: Start difference. First operand 31337 states and 41844 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:22:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:13,595 INFO L93 Difference]: Finished difference Result 47113 states and 63152 transitions. [2024-11-07 00:22:13,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:22:13,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2024-11-07 00:22:13,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:13,652 INFO L225 Difference]: With dead ends: 47113 [2024-11-07 00:22:13,653 INFO L226 Difference]: Without dead ends: 39719 [2024-11-07 00:22:13,672 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:22:13,673 INFO L432 NwaCegarLoop]: 602 mSDtfsCounter, 976 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:13,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1373 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:22:13,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39719 states. [2024-11-07 00:22:14,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39719 to 37345. [2024-11-07 00:22:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37345 states, 37344 states have (on average 1.3323693230505569) internal successors, (49756), 37344 states have internal predecessors, (49756), 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:22:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37345 states to 37345 states and 49756 transitions. [2024-11-07 00:22:14,310 INFO L78 Accepts]: Start accepts. Automaton has 37345 states and 49756 transitions. Word has length 78 [2024-11-07 00:22:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:14,310 INFO L471 AbstractCegarLoop]: Abstraction has 37345 states and 49756 transitions. [2024-11-07 00:22:14,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:22:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 37345 states and 49756 transitions. [2024-11-07 00:22:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:22:14,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:14,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:22:14,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:22:14,313 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:14,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2010164398, now seen corresponding path program 1 times [2024-11-07 00:22:14,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:14,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911232341] [2024-11-07 00:22:14,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:14,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:14,422 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:22:14,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:14,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911232341] [2024-11-07 00:22:14,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911232341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:14,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:14,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:22:14,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684959310] [2024-11-07 00:22:14,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:14,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:22:14,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:14,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:22:14,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:22:14,424 INFO L87 Difference]: Start difference. First operand 37345 states and 49756 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:22:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:14,714 INFO L93 Difference]: Finished difference Result 55337 states and 74016 transitions. [2024-11-07 00:22:14,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:22:14,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2024-11-07 00:22:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:14,782 INFO L225 Difference]: With dead ends: 55337 [2024-11-07 00:22:14,783 INFO L226 Difference]: Without dead ends: 46247 [2024-11-07 00:22:14,803 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:22:14,803 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 1059 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:14,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1309 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:22:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46247 states. [2024-11-07 00:22:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46247 to 43873. [2024-11-07 00:22:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43873 states, 43872 states have (on average 1.3288657913931436) internal successors, (58300), 43872 states have internal predecessors, (58300), 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:22:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43873 states to 43873 states and 58300 transitions. [2024-11-07 00:22:15,527 INFO L78 Accepts]: Start accepts. Automaton has 43873 states and 58300 transitions. Word has length 78 [2024-11-07 00:22:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:15,527 INFO L471 AbstractCegarLoop]: Abstraction has 43873 states and 58300 transitions. [2024-11-07 00:22:15,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:22:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 43873 states and 58300 transitions. [2024-11-07 00:22:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 00:22:15,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:15,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:22:15,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:22:15,531 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:15,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1003850221, now seen corresponding path program 1 times [2024-11-07 00:22:15,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:15,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217922029] [2024-11-07 00:22:15,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:15,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:15,661 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:22:15,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:15,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217922029] [2024-11-07 00:22:15,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217922029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:15,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:15,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:22:15,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040439574] [2024-11-07 00:22:15,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:15,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:22:15,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:15,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:22:15,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:22:15,663 INFO L87 Difference]: Start difference. First operand 43873 states and 58300 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:22:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:15,999 INFO L93 Difference]: Finished difference Result 67495 states and 89935 transitions. [2024-11-07 00:22:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:22:16,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 85 [2024-11-07 00:22:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:16,075 INFO L225 Difference]: With dead ends: 67495 [2024-11-07 00:22:16,076 INFO L226 Difference]: Without dead ends: 54093 [2024-11-07 00:22:16,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:22:16,094 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 1235 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:16,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 1285 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:22:16,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54093 states. [2024-11-07 00:22:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54093 to 50065. [2024-11-07 00:22:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50065 states, 50064 states have (on average 1.3297379354426335) internal successors, (66572), 50064 states have internal predecessors, (66572), 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:22:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50065 states to 50065 states and 66572 transitions. [2024-11-07 00:22:16,793 INFO L78 Accepts]: Start accepts. Automaton has 50065 states and 66572 transitions. Word has length 85 [2024-11-07 00:22:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:16,793 INFO L471 AbstractCegarLoop]: Abstraction has 50065 states and 66572 transitions. [2024-11-07 00:22:16,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:22:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 50065 states and 66572 transitions. [2024-11-07 00:22:16,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 00:22:16,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:16,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:22:16,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:22:16,797 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:16,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:16,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1764353414, now seen corresponding path program 1 times [2024-11-07 00:22:16,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:16,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927963765] [2024-11-07 00:22:16,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:16,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:16,930 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:22:16,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:16,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927963765] [2024-11-07 00:22:16,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927963765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:16,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:16,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:22:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869745277] [2024-11-07 00:22:16,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:16,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:22:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:16,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:22:16,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:22:16,932 INFO L87 Difference]: Start difference. First operand 50065 states and 66572 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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:22:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:17,356 INFO L93 Difference]: Finished difference Result 80279 states and 106783 transitions. [2024-11-07 00:22:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:22:17,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2024-11-07 00:22:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:17,426 INFO L225 Difference]: With dead ends: 80279 [2024-11-07 00:22:17,426 INFO L226 Difference]: Without dead ends: 55765 [2024-11-07 00:22:17,448 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:22:17,449 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 1095 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:17,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1245 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:22:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55765 states. [2024-11-07 00:22:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55765 to 49681. [2024-11-07 00:22:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49681 states, 49680 states have (on average 1.327133655394525) internal successors, (65932), 49680 states have internal predecessors, (65932), 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:22:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49681 states to 49681 states and 65932 transitions. [2024-11-07 00:22:18,043 INFO L78 Accepts]: Start accepts. Automaton has 49681 states and 65932 transitions. Word has length 85 [2024-11-07 00:22:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:18,043 INFO L471 AbstractCegarLoop]: Abstraction has 49681 states and 65932 transitions. [2024-11-07 00:22:18,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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:22:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 49681 states and 65932 transitions. [2024-11-07 00:22:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 00:22:18,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:18,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:22:18,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 00:22:18,047 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:18,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash 747174186, now seen corresponding path program 1 times [2024-11-07 00:22:18,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:18,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306435392] [2024-11-07 00:22:18,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:18,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:18,138 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:22:18,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306435392] [2024-11-07 00:22:18,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306435392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:18,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:18,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:22:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422038267] [2024-11-07 00:22:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:18,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:22:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:18,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:22:18,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:22:18,140 INFO L87 Difference]: Start difference. First operand 49681 states and 65932 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 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:22:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:18,712 INFO L93 Difference]: Finished difference Result 62087 states and 82358 transitions. [2024-11-07 00:22:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:22:18,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 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 86 [2024-11-07 00:22:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:18,790 INFO L225 Difference]: With dead ends: 62087 [2024-11-07 00:22:18,790 INFO L226 Difference]: Without dead ends: 59831 [2024-11-07 00:22:18,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:22:18,809 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 2138 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2138 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:18,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2138 Valid, 675 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:22:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59831 states. [2024-11-07 00:22:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59831 to 49674. [2024-11-07 00:22:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49674 states, 49673 states have (on average 1.3270992289573813) internal successors, (65921), 49673 states have internal predecessors, (65921), 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:22:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49674 states to 49674 states and 65921 transitions. [2024-11-07 00:22:19,554 INFO L78 Accepts]: Start accepts. Automaton has 49674 states and 65921 transitions. Word has length 86 [2024-11-07 00:22:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:19,554 INFO L471 AbstractCegarLoop]: Abstraction has 49674 states and 65921 transitions. [2024-11-07 00:22:19,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 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:22:19,554 INFO L276 IsEmpty]: Start isEmpty. Operand 49674 states and 65921 transitions. [2024-11-07 00:22:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 00:22:19,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:19,565 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:22:19,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 00:22:19,565 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:19,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1313750202, now seen corresponding path program 1 times [2024-11-07 00:22:19,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:19,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231534208] [2024-11-07 00:22:19,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:19,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 00:22:19,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:19,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231534208] [2024-11-07 00:22:19,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231534208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:19,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:19,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:22:19,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51968485] [2024-11-07 00:22:19,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:19,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:22:19,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:19,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:22:19,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:22:19,772 INFO L87 Difference]: Start difference. First operand 49674 states and 65921 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 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:22:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:20,558 INFO L93 Difference]: Finished difference Result 85997 states and 113980 transitions. [2024-11-07 00:22:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:22:20,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 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 93 [2024-11-07 00:22:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:20,641 INFO L225 Difference]: With dead ends: 85997 [2024-11-07 00:22:20,641 INFO L226 Difference]: Without dead ends: 67863 [2024-11-07 00:22:20,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:22:20,673 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 1933 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:20,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 990 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:22:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67863 states. [2024-11-07 00:22:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67863 to 49660. [2024-11-07 00:22:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49660 states, 49659 states have (on average 1.3271713083227612) internal successors, (65906), 49659 states have internal predecessors, (65906), 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:22:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49660 states to 49660 states and 65906 transitions. [2024-11-07 00:22:21,383 INFO L78 Accepts]: Start accepts. Automaton has 49660 states and 65906 transitions. Word has length 93 [2024-11-07 00:22:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:21,383 INFO L471 AbstractCegarLoop]: Abstraction has 49660 states and 65906 transitions. [2024-11-07 00:22:21,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 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:22:21,383 INFO L276 IsEmpty]: Start isEmpty. Operand 49660 states and 65906 transitions. [2024-11-07 00:22:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 00:22:21,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:21,391 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:22:21,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 00:22:21,392 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:21,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:21,392 INFO L85 PathProgramCache]: Analyzing trace with hash 648664286, now seen corresponding path program 1 times [2024-11-07 00:22:21,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:21,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519817400] [2024-11-07 00:22:21,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:21,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:22:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519817400] [2024-11-07 00:22:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519817400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:22:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131296539] [2024-11-07 00:22:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:21,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:22:21,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:22:21,817 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:22:21,818 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:22:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:22,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 00:22:22,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:22:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:22:22,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:22:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:22:23,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131296539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:22:23,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:22:23,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-11-07 00:22:23,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749996448] [2024-11-07 00:22:23,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:22:23,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 00:22:23,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:23,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 00:22:23,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2024-11-07 00:22:23,277 INFO L87 Difference]: Start difference. First operand 49660 states and 65906 transitions. Second operand has 26 states, 26 states have (on average 9.076923076923077) internal successors, (236), 25 states have internal predecessors, (236), 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:22:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:24,705 INFO L93 Difference]: Finished difference Result 114816 states and 152169 transitions. [2024-11-07 00:22:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 00:22:24,706 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.076923076923077) internal successors, (236), 25 states have internal predecessors, (236), 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 93 [2024-11-07 00:22:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:24,831 INFO L225 Difference]: With dead ends: 114816 [2024-11-07 00:22:24,831 INFO L226 Difference]: Without dead ends: 95470 [2024-11-07 00:22:24,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=450, Invalid=1530, Unknown=0, NotChecked=0, Total=1980 [2024-11-07 00:22:24,873 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 6836 mSDsluCounter, 2799 mSDsCounter, 0 mSdLazyCounter, 2771 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6836 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:24,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6836 Valid, 3127 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2771 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:22:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95470 states. [2024-11-07 00:22:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95470 to 50544. [2024-11-07 00:22:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50544 states, 50543 states have (on average 1.3265931978711196) internal successors, (67050), 50543 states have internal predecessors, (67050), 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:22:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50544 states to 50544 states and 67050 transitions. [2024-11-07 00:22:25,865 INFO L78 Accepts]: Start accepts. Automaton has 50544 states and 67050 transitions. Word has length 93 [2024-11-07 00:22:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:25,865 INFO L471 AbstractCegarLoop]: Abstraction has 50544 states and 67050 transitions. [2024-11-07 00:22:25,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.076923076923077) internal successors, (236), 25 states have internal predecessors, (236), 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:22:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 50544 states and 67050 transitions. [2024-11-07 00:22:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 00:22:25,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:25,876 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] [2024-11-07 00:22:25,893 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:22:26,077 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,SelfDestructingSolverStorable28 [2024-11-07 00:22:26,077 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:26,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:26,078 INFO L85 PathProgramCache]: Analyzing trace with hash -406895114, now seen corresponding path program 1 times [2024-11-07 00:22:26,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:26,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872518711] [2024-11-07 00:22:26,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:22:26,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:26,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872518711] [2024-11-07 00:22:26,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872518711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:22:26,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198528283] [2024-11-07 00:22:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:26,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:22:26,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:22:26,304 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:22:26,305 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:22:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:26,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 00:22:26,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:22:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:22:26,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:22:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:22:27,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198528283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:22:27,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:22:27,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 10] total 20 [2024-11-07 00:22:27,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574822104] [2024-11-07 00:22:27,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:22:27,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 00:22:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:27,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 00:22:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:22:27,473 INFO L87 Difference]: Start difference. First operand 50544 states and 67050 transitions. Second operand has 20 states, 20 states have (on average 12.6) internal successors, (252), 20 states have internal predecessors, (252), 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:22:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:29,939 INFO L93 Difference]: Finished difference Result 398161 states and 531046 transitions. [2024-11-07 00:22:29,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-07 00:22:29,939 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 12.6) internal successors, (252), 20 states have internal predecessors, (252), 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 94 [2024-11-07 00:22:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:30,547 INFO L225 Difference]: With dead ends: 398161 [2024-11-07 00:22:30,547 INFO L226 Difference]: Without dead ends: 348942 [2024-11-07 00:22:30,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=828, Invalid=2832, Unknown=0, NotChecked=0, Total=3660 [2024-11-07 00:22:30,694 INFO L432 NwaCegarLoop]: 877 mSDtfsCounter, 6924 mSDsluCounter, 3519 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6924 SdHoareTripleChecker+Valid, 4396 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:30,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6924 Valid, 4396 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:22:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348942 states. [2024-11-07 00:22:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348942 to 330457. [2024-11-07 00:22:35,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330457 states, 330456 states have (on average 1.3236890841745952) internal successors, (437421), 330456 states have internal predecessors, (437421), 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:22:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330457 states to 330457 states and 437421 transitions. [2024-11-07 00:22:36,579 INFO L78 Accepts]: Start accepts. Automaton has 330457 states and 437421 transitions. Word has length 94 [2024-11-07 00:22:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:36,579 INFO L471 AbstractCegarLoop]: Abstraction has 330457 states and 437421 transitions. [2024-11-07 00:22:36,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.6) internal successors, (252), 20 states have internal predecessors, (252), 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:22:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 330457 states and 437421 transitions. [2024-11-07 00:22:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:22:36,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:36,590 INFO L215 NwaCegarLoop]: trace histogram [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:22:36,609 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:22:36,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:22:36,793 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:36,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:36,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1428265138, now seen corresponding path program 1 times [2024-11-07 00:22:36,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:36,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779459602] [2024-11-07 00:22:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:36,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:22:36,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:36,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779459602] [2024-11-07 00:22:36,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779459602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:36,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:36,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:22:36,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582491798] [2024-11-07 00:22:36,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:36,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:22:36,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:36,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:22:36,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:22:36,872 INFO L87 Difference]: Start difference. First operand 330457 states and 437421 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:22:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:39,603 INFO L93 Difference]: Finished difference Result 721159 states and 954245 transitions. [2024-11-07 00:22:39,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:22:39,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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 97 [2024-11-07 00:22:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:40,770 INFO L225 Difference]: With dead ends: 721159 [2024-11-07 00:22:40,770 INFO L226 Difference]: Without dead ends: 391688 [2024-11-07 00:22:40,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:22:40,915 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 912 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:40,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 802 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:22:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391688 states. [2024-11-07 00:22:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391688 to 339393. [2024-11-07 00:22:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339393 states, 339392 states have (on average 1.2978974165566661) internal successors, (440496), 339392 states have internal predecessors, (440496), 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:22:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339393 states to 339393 states and 440496 transitions. [2024-11-07 00:22:45,999 INFO L78 Accepts]: Start accepts. Automaton has 339393 states and 440496 transitions. Word has length 97 [2024-11-07 00:22:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:45,999 INFO L471 AbstractCegarLoop]: Abstraction has 339393 states and 440496 transitions. [2024-11-07 00:22:45,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:22:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 339393 states and 440496 transitions. [2024-11-07 00:22:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:22:46,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:46,008 INFO L215 NwaCegarLoop]: trace histogram [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:22:46,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 00:22:46,009 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:46,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2003684455, now seen corresponding path program 1 times [2024-11-07 00:22:46,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:46,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273275492] [2024-11-07 00:22:46,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:46,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:22:46,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273275492] [2024-11-07 00:22:46,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273275492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:46,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:46,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:22:46,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079082056] [2024-11-07 00:22:46,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:46,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:22:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:46,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:22:46,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:22:46,074 INFO L87 Difference]: Start difference. First operand 339393 states and 440496 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:22:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:48,766 INFO L93 Difference]: Finished difference Result 683271 states and 884519 transitions. [2024-11-07 00:22:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:22:48,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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 97 [2024-11-07 00:22:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:49,384 INFO L225 Difference]: With dead ends: 683271 [2024-11-07 00:22:49,384 INFO L226 Difference]: Without dead ends: 344511 [2024-11-07 00:22:49,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:22:49,553 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 941 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:49,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 691 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:22:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344511 states. [2024-11-07 00:22:53,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344511 to 321749. [2024-11-07 00:22:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321749 states, 321748 states have (on average 1.2695183808446362) internal successors, (408465), 321748 states have internal predecessors, (408465), 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:22:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321749 states to 321749 states and 408465 transitions. [2024-11-07 00:22:54,874 INFO L78 Accepts]: Start accepts. Automaton has 321749 states and 408465 transitions. Word has length 97 [2024-11-07 00:22:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:54,875 INFO L471 AbstractCegarLoop]: Abstraction has 321749 states and 408465 transitions. [2024-11-07 00:22:54,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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:22:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 321749 states and 408465 transitions. [2024-11-07 00:22:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:22:54,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:54,882 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] [2024-11-07 00:22:54,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 00:22:54,883 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:54,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:54,885 INFO L85 PathProgramCache]: Analyzing trace with hash 321227878, now seen corresponding path program 1 times [2024-11-07 00:22:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:54,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973667086] [2024-11-07 00:22:54,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:54,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 00:22:54,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:54,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973667086] [2024-11-07 00:22:54,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973667086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:54,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:54,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:22:54,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267202315] [2024-11-07 00:22:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:54,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:22:54,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:54,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:22:54,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:22:54,985 INFO L87 Difference]: Start difference. First operand 321749 states and 408465 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:22:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:22:55,949 INFO L93 Difference]: Finished difference Result 421549 states and 534323 transitions. [2024-11-07 00:22:55,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:22:55,949 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 98 [2024-11-07 00:22:55,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:22:56,857 INFO L225 Difference]: With dead ends: 421549 [2024-11-07 00:22:56,857 INFO L226 Difference]: Without dead ends: 221955 [2024-11-07 00:22:56,925 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:22:56,926 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 156 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:22:56,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 881 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:22:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221955 states. [2024-11-07 00:22:59,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221955 to 221406. [2024-11-07 00:22:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221406 states, 221405 states have (on average 1.2545651633883608) internal successors, (277767), 221405 states have internal predecessors, (277767), 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:22:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221406 states to 221406 states and 277767 transitions. [2024-11-07 00:22:59,874 INFO L78 Accepts]: Start accepts. Automaton has 221406 states and 277767 transitions. Word has length 98 [2024-11-07 00:22:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:22:59,874 INFO L471 AbstractCegarLoop]: Abstraction has 221406 states and 277767 transitions. [2024-11-07 00:22:59,874 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:22:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 221406 states and 277767 transitions. [2024-11-07 00:22:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:22:59,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:22:59,883 INFO L215 NwaCegarLoop]: trace histogram [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:22:59,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 00:22:59,883 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-07 00:22:59,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:22:59,883 INFO L85 PathProgramCache]: Analyzing trace with hash 106277470, now seen corresponding path program 1 times [2024-11-07 00:22:59,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:22:59,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972249426] [2024-11-07 00:22:59,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:22:59,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:22:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:22:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:22:59,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:22:59,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972249426] [2024-11-07 00:22:59,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972249426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:22:59,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:22:59,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:22:59,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364601608] [2024-11-07 00:22:59,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:22:59,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:22:59,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:22:59,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:22:59,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:22:59,951 INFO L87 Difference]: Start difference. First operand 221406 states and 277767 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)