./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-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', '561889d92df45f99e756a59f568aff549bcbf1af3442520c3f6faf4dbc996ed6'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-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 561889d92df45f99e756a59f568aff549bcbf1af3442520c3f6faf4dbc996ed6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:29:15,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:29:15,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:29:15,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:29:15,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:29:15,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:29:15,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:29:15,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:29:15,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:29:15,889 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:29:15,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:29:15,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:29:15,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:29:15,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:29:15,890 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:29:15,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:29:15,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:29:15,890 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:29:15,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:29:15,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:29:15,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:29:15,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:29:15,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:29:15,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:29:15,890 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:29:15,890 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:29:15,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:29:15,891 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:29:15,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:29:15,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:29:15,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:29:15,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:29:15,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:29:15,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:29:15,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:29:15,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:29:15,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:29:15,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:29:15,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:29:15,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:29:15,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:29:15,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:29:15,895 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 -> 561889d92df45f99e756a59f568aff549bcbf1af3442520c3f6faf4dbc996ed6 [2024-11-07 00:29:16,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:29:16,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:29:16,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:29:16,262 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:29:16,263 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:29:16,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-07 00:29:17,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:29:18,179 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:29:18,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-07 00:29:18,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87e84ac34/57e0dffdf2824ed4ad901d578ecc170b/FLAG9ed836dbc [2024-11-07 00:29:18,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87e84ac34/57e0dffdf2824ed4ad901d578ecc170b [2024-11-07 00:29:18,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:29:18,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:29:18,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:29:18,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:29:18,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:29:18,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@228aae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18, skipping insertion in model container [2024-11-07 00:29:18,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:29:18,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7180,7193] [2024-11-07 00:29:18,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9491,9504] [2024-11-07 00:29:18,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:29:18,518 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:29:18,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7180,7193] [2024-11-07 00:29:18,583 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9491,9504] [2024-11-07 00:29:18,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:29:18,616 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:29:18,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18 WrapperNode [2024-11-07 00:29:18,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:29:18,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:29:18,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:29:18,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:29:18,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,685 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 505 [2024-11-07 00:29:18,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:29:18,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:29:18,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:29:18,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:29:18,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,728 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 00:29:18,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:29:18,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:29:18,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:29:18,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:29:18,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:29:18,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:18,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:29:18,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:29:18,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:29:18,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:29:18,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:29:18,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:29:18,945 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:29:18,947 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:29:19,372 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-07 00:29:19,372 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:29:19,381 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:29:19,386 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:29:19,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:29:19 BoogieIcfgContainer [2024-11-07 00:29:19,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:29:19,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:29:19,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:29:19,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:29:19,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:29:18" (1/3) ... [2024-11-07 00:29:19,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc642b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:29:19, skipping insertion in model container [2024-11-07 00:29:19,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18" (2/3) ... [2024-11-07 00:29:19,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc642b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:29:19, skipping insertion in model container [2024-11-07 00:29:19,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:29:19" (3/3) ... [2024-11-07 00:29:19,423 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-11-07 00:29:19,437 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:29:19,437 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:29:19,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:29:19,511 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;@3b8146fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:29:19,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:29:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 105 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 00:29:19,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:19,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:19,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:19,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:19,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1038847250, now seen corresponding path program 1 times [2024-11-07 00:29:19,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:19,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019298845] [2024-11-07 00:29:19,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:19,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:19,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019298845] [2024-11-07 00:29:19,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019298845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:19,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:19,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:19,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676618750] [2024-11-07 00:29:19,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:19,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:19,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:19,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:19,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:19,962 INFO L87 Difference]: Start difference. First operand has 106 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 105 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:20,202 INFO L93 Difference]: Finished difference Result 416 states and 663 transitions. [2024-11-07 00:29:20,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:29:20,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-07 00:29:20,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:20,217 INFO L225 Difference]: With dead ends: 416 [2024-11-07 00:29:20,217 INFO L226 Difference]: Without dead ends: 353 [2024-11-07 00:29:20,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:29:20,223 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 596 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:20,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 768 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-07 00:29:20,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 155. [2024-11-07 00:29:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 219 transitions. [2024-11-07 00:29:20,264 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 219 transitions. Word has length 48 [2024-11-07 00:29:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:20,265 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 219 transitions. [2024-11-07 00:29:20,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 219 transitions. [2024-11-07 00:29:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 00:29:20,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:20,266 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] [2024-11-07 00:29:20,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:29:20,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:20,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:20,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1964840261, now seen corresponding path program 1 times [2024-11-07 00:29:20,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:20,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2977191] [2024-11-07 00:29:20,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:20,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:20,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2977191] [2024-11-07 00:29:20,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2977191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:20,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:20,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:20,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422925223] [2024-11-07 00:29:20,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:20,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:20,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:20,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:20,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:20,431 INFO L87 Difference]: Start difference. First operand 155 states and 219 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:20,489 INFO L93 Difference]: Finished difference Result 244 states and 352 transitions. [2024-11-07 00:29:20,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:20,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-07 00:29:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:20,490 INFO L225 Difference]: With dead ends: 244 [2024-11-07 00:29:20,490 INFO L226 Difference]: Without dead ends: 159 [2024-11-07 00:29:20,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:20,495 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:20,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 301 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-07 00:29:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-07 00:29:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 220 transitions. [2024-11-07 00:29:20,510 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 220 transitions. Word has length 49 [2024-11-07 00:29:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:20,511 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 220 transitions. [2024-11-07 00:29:20,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 220 transitions. [2024-11-07 00:29:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 00:29:20,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:20,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:20,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:29:20,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:20,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:20,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1398279763, now seen corresponding path program 1 times [2024-11-07 00:29:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:20,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944129502] [2024-11-07 00:29:20,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:20,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:20,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:20,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944129502] [2024-11-07 00:29:20,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944129502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:20,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:20,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:20,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497489660] [2024-11-07 00:29:20,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:20,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:20,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:20,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:20,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:20,773 INFO L87 Difference]: Start difference. First operand 157 states and 220 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:20,885 INFO L93 Difference]: Finished difference Result 470 states and 690 transitions. [2024-11-07 00:29:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:20,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-07 00:29:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:20,888 INFO L225 Difference]: With dead ends: 470 [2024-11-07 00:29:20,889 INFO L226 Difference]: Without dead ends: 388 [2024-11-07 00:29:20,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:20,892 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 298 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:20,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 532 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-07 00:29:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 248. [2024-11-07 00:29:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 359 transitions. [2024-11-07 00:29:20,921 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 359 transitions. Word has length 50 [2024-11-07 00:29:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:20,922 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 359 transitions. [2024-11-07 00:29:20,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 359 transitions. [2024-11-07 00:29:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 00:29:20,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:20,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:20,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:29:20,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:20,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:20,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1526101883, now seen corresponding path program 1 times [2024-11-07 00:29:20,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:20,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421444534] [2024-11-07 00:29:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:21,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:21,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421444534] [2024-11-07 00:29:21,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421444534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:21,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:21,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:21,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074819386] [2024-11-07 00:29:21,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:21,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:21,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:21,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:21,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:21,113 INFO L87 Difference]: Start difference. First operand 248 states and 359 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:21,209 INFO L93 Difference]: Finished difference Result 556 states and 821 transitions. [2024-11-07 00:29:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:21,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-07 00:29:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:21,212 INFO L225 Difference]: With dead ends: 556 [2024-11-07 00:29:21,212 INFO L226 Difference]: Without dead ends: 474 [2024-11-07 00:29:21,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:21,215 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 356 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:21,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 537 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-07 00:29:21,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 376. [2024-11-07 00:29:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 553 transitions. [2024-11-07 00:29:21,242 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 553 transitions. Word has length 50 [2024-11-07 00:29:21,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:21,242 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 553 transitions. [2024-11-07 00:29:21,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 553 transitions. [2024-11-07 00:29:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 00:29:21,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:21,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:21,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:29:21,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:21,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:21,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2031133031, now seen corresponding path program 1 times [2024-11-07 00:29:21,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:21,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852048052] [2024-11-07 00:29:21,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:21,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:21,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:21,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852048052] [2024-11-07 00:29:21,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852048052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:21,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:21,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:21,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238402016] [2024-11-07 00:29:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:21,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:21,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:21,414 INFO L87 Difference]: Start difference. First operand 376 states and 553 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:21,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:21,505 INFO L93 Difference]: Finished difference Result 647 states and 960 transitions. [2024-11-07 00:29:21,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:21,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-07 00:29:21,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:21,510 INFO L225 Difference]: With dead ends: 647 [2024-11-07 00:29:21,510 INFO L226 Difference]: Without dead ends: 565 [2024-11-07 00:29:21,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:21,511 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 361 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:21,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 550 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-07 00:29:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 467. [2024-11-07 00:29:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 692 transitions. [2024-11-07 00:29:21,526 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 692 transitions. Word has length 50 [2024-11-07 00:29:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:21,526 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 692 transitions. [2024-11-07 00:29:21,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 692 transitions. [2024-11-07 00:29:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 00:29:21,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:21,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:21,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:29:21,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:21,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash 222346276, now seen corresponding path program 1 times [2024-11-07 00:29:21,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:21,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697175190] [2024-11-07 00:29:21,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:21,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:21,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:21,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697175190] [2024-11-07 00:29:21,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697175190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:21,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:21,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:21,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037854202] [2024-11-07 00:29:21,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:21,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:21,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:21,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:21,614 INFO L87 Difference]: Start difference. First operand 467 states and 692 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:21,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:21,723 INFO L93 Difference]: Finished difference Result 911 states and 1360 transitions. [2024-11-07 00:29:21,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:21,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-07 00:29:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:21,725 INFO L225 Difference]: With dead ends: 911 [2024-11-07 00:29:21,726 INFO L226 Difference]: Without dead ends: 467 [2024-11-07 00:29:21,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:21,727 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 380 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:21,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 80 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-07 00:29:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2024-11-07 00:29:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4666666666666666) internal successors, (682), 466 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 682 transitions. [2024-11-07 00:29:21,739 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 682 transitions. Word has length 51 [2024-11-07 00:29:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:21,739 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 682 transitions. [2024-11-07 00:29:21,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 682 transitions. [2024-11-07 00:29:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:29:21,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:21,740 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:29:21,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:29:21,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:21,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash 323435980, now seen corresponding path program 1 times [2024-11-07 00:29:21,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228490452] [2024-11-07 00:29:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:21,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228490452] [2024-11-07 00:29:21,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228490452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:21,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:21,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:21,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819655989] [2024-11-07 00:29:21,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:21,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:21,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:21,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:21,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:21,840 INFO L87 Difference]: Start difference. First operand 467 states and 682 transitions. 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:29:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:21,923 INFO L93 Difference]: Finished difference Result 907 states and 1336 transitions. [2024-11-07 00:29:21,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:21,924 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:29:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:21,926 INFO L225 Difference]: With dead ends: 907 [2024-11-07 00:29:21,926 INFO L226 Difference]: Without dead ends: 467 [2024-11-07 00:29:21,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:21,927 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 362 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:21,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 88 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-07 00:29:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2024-11-07 00:29:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4451612903225806) internal successors, (672), 466 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 672 transitions. [2024-11-07 00:29:21,939 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 672 transitions. Word has length 52 [2024-11-07 00:29:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:21,942 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 672 transitions. [2024-11-07 00:29:21,943 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:29:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 672 transitions. [2024-11-07 00:29:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:29:21,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:21,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:21,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:29:21,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:21,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:21,944 INFO L85 PathProgramCache]: Analyzing trace with hash 549255064, now seen corresponding path program 1 times [2024-11-07 00:29:21,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:21,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815307190] [2024-11-07 00:29:21,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:21,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:22,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:22,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815307190] [2024-11-07 00:29:22,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815307190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:22,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:22,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:22,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864353325] [2024-11-07 00:29:22,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:22,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:22,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:22,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:22,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:22,034 INFO L87 Difference]: Start difference. First operand 467 states and 672 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:29:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:22,138 INFO L93 Difference]: Finished difference Result 903 states and 1312 transitions. [2024-11-07 00:29:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:22,138 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:29:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:22,140 INFO L225 Difference]: With dead ends: 903 [2024-11-07 00:29:22,140 INFO L226 Difference]: Without dead ends: 467 [2024-11-07 00:29:22,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:22,141 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 344 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:22,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 96 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:22,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-07 00:29:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2024-11-07 00:29:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4236559139784946) internal successors, (662), 466 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 662 transitions. [2024-11-07 00:29:22,153 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 662 transitions. Word has length 53 [2024-11-07 00:29:22,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:22,153 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 662 transitions. [2024-11-07 00:29:22,153 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:29:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 662 transitions. [2024-11-07 00:29:22,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:29:22,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:22,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:22,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:29:22,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:22,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash -680909608, now seen corresponding path program 1 times [2024-11-07 00:29:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:22,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656336638] [2024-11-07 00:29:22,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:22,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:22,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656336638] [2024-11-07 00:29:22,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656336638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:22,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:22,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:22,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048919051] [2024-11-07 00:29:22,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:22,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:22,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:22,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:22,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:22,490 INFO L87 Difference]: Start difference. First operand 467 states and 662 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:22,774 INFO L93 Difference]: Finished difference Result 1260 states and 1810 transitions. [2024-11-07 00:29:22,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:29:22,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 00:29:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:22,778 INFO L225 Difference]: With dead ends: 1260 [2024-11-07 00:29:22,778 INFO L226 Difference]: Without dead ends: 856 [2024-11-07 00:29:22,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:29:22,780 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 706 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:22,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 324 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2024-11-07 00:29:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 467. [2024-11-07 00:29:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.421505376344086) internal successors, (661), 466 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 661 transitions. [2024-11-07 00:29:22,796 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 661 transitions. Word has length 54 [2024-11-07 00:29:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:22,796 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 661 transitions. [2024-11-07 00:29:22,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 661 transitions. [2024-11-07 00:29:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:29:22,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:22,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] [2024-11-07 00:29:22,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:29:22,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:22,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:22,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1757672516, now seen corresponding path program 1 times [2024-11-07 00:29:22,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:22,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636367704] [2024-11-07 00:29:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:22,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:23,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:23,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636367704] [2024-11-07 00:29:23,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636367704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:23,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:23,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 00:29:23,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994553114] [2024-11-07 00:29:23,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:23,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 00:29:23,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:23,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 00:29:23,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:29:23,197 INFO L87 Difference]: Start difference. First operand 467 states and 661 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:23,708 INFO L93 Difference]: Finished difference Result 1288 states and 1843 transitions. [2024-11-07 00:29:23,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:29:23,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 00:29:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:23,711 INFO L225 Difference]: With dead ends: 1288 [2024-11-07 00:29:23,711 INFO L226 Difference]: Without dead ends: 889 [2024-11-07 00:29:23,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:29:23,713 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 593 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:23,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 511 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:29:23,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-07 00:29:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 467. [2024-11-07 00:29:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4172043010752688) internal successors, (659), 466 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 659 transitions. [2024-11-07 00:29:23,730 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 659 transitions. Word has length 54 [2024-11-07 00:29:23,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:23,730 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 659 transitions. [2024-11-07 00:29:23,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 659 transitions. [2024-11-07 00:29:23,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:29:23,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:23,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:23,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:29:23,731 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:23,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash -728953036, now seen corresponding path program 1 times [2024-11-07 00:29:23,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:23,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165389120] [2024-11-07 00:29:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:23,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:24,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:24,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165389120] [2024-11-07 00:29:24,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165389120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:24,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:24,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 00:29:24,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427660929] [2024-11-07 00:29:24,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:24,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 00:29:24,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:24,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 00:29:24,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:29:24,024 INFO L87 Difference]: Start difference. First operand 467 states and 659 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 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:29:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:24,421 INFO L93 Difference]: Finished difference Result 1273 states and 1817 transitions. [2024-11-07 00:29:24,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:29:24,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 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:29:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:24,425 INFO L225 Difference]: With dead ends: 1273 [2024-11-07 00:29:24,426 INFO L226 Difference]: Without dead ends: 884 [2024-11-07 00:29:24,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-07 00:29:24,427 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 706 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:24,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 406 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-11-07 00:29:24,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 467. [2024-11-07 00:29:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4086021505376345) internal successors, (655), 466 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 655 transitions. [2024-11-07 00:29:24,443 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 655 transitions. Word has length 55 [2024-11-07 00:29:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:24,444 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 655 transitions. [2024-11-07 00:29:24,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 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:29:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 655 transitions. [2024-11-07 00:29:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:29:24,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:24,445 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:29:24,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:29:24,445 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:24,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:24,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2014195720, now seen corresponding path program 1 times [2024-11-07 00:29:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:24,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174276336] [2024-11-07 00:29:24,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:24,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:25,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:25,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174276336] [2024-11-07 00:29:25,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174276336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:25,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:25,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-07 00:29:25,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044193701] [2024-11-07 00:29:25,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:25,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 00:29:25,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:25,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 00:29:25,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2024-11-07 00:29:25,625 INFO L87 Difference]: Start difference. First operand 467 states and 655 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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:29:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:27,761 INFO L93 Difference]: Finished difference Result 1744 states and 2498 transitions. [2024-11-07 00:29:27,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 00:29:27,762 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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:29:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:27,768 INFO L225 Difference]: With dead ends: 1744 [2024-11-07 00:29:27,768 INFO L226 Difference]: Without dead ends: 1653 [2024-11-07 00:29:27,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=356, Invalid=1450, Unknown=0, NotChecked=0, Total=1806 [2024-11-07 00:29:27,770 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 819 mSDsluCounter, 2345 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:27,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 2523 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:29:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-11-07 00:29:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 467. [2024-11-07 00:29:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4064516129032258) internal successors, (654), 466 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 654 transitions. [2024-11-07 00:29:27,791 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 654 transitions. Word has length 56 [2024-11-07 00:29:27,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:27,791 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 654 transitions. [2024-11-07 00:29:27,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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:29:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 654 transitions. [2024-11-07 00:29:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:29:27,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:27,792 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:29:27,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:29:27,792 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:27,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:27,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1797287643, now seen corresponding path program 1 times [2024-11-07 00:29:27,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:27,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808847145] [2024-11-07 00:29:27,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:27,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:28,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:28,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808847145] [2024-11-07 00:29:28,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808847145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:28,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:28,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:29:28,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936495060] [2024-11-07 00:29:28,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:28,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:29:28,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:28,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:29:28,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:29:28,260 INFO L87 Difference]: Start difference. First operand 467 states and 654 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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:29:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:28,755 INFO L93 Difference]: Finished difference Result 1796 states and 2579 transitions. [2024-11-07 00:29:28,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:29:28,756 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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:29:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:28,761 INFO L225 Difference]: With dead ends: 1796 [2024-11-07 00:29:28,761 INFO L226 Difference]: Without dead ends: 1604 [2024-11-07 00:29:28,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2024-11-07 00:29:28,763 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 630 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:28,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 1020 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2024-11-07 00:29:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 446. [2024-11-07 00:29:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 444 states have (on average 1.40990990990991) internal successors, (626), 445 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 626 transitions. [2024-11-07 00:29:28,782 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 626 transitions. Word has length 56 [2024-11-07 00:29:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:28,782 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 626 transitions. [2024-11-07 00:29:28,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 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:29:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 626 transitions. [2024-11-07 00:29:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:29:28,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:28,782 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:29:28,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:29:28,782 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:28,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash 929811098, now seen corresponding path program 1 times [2024-11-07 00:29:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119410074] [2024-11-07 00:29:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:29,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:29,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119410074] [2024-11-07 00:29:29,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119410074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:29,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:29,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-07 00:29:29,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20775482] [2024-11-07 00:29:29,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:29,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 00:29:29,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:29,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 00:29:29,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:29:29,637 INFO L87 Difference]: Start difference. First operand 446 states and 626 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 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:29:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:31,072 INFO L93 Difference]: Finished difference Result 1780 states and 2557 transitions. [2024-11-07 00:29:31,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 00:29:31,073 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 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:29:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:31,079 INFO L225 Difference]: With dead ends: 1780 [2024-11-07 00:29:31,079 INFO L226 Difference]: Without dead ends: 1603 [2024-11-07 00:29:31,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=288, Invalid=1272, Unknown=0, NotChecked=0, Total=1560 [2024-11-07 00:29:31,081 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 739 mSDsluCounter, 2070 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:31,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 2238 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:29:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2024-11-07 00:29:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 456. [2024-11-07 00:29:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 454 states have (on average 1.4052863436123348) internal successors, (638), 455 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 638 transitions. [2024-11-07 00:29:31,099 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 638 transitions. Word has length 56 [2024-11-07 00:29:31,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:31,100 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 638 transitions. [2024-11-07 00:29:31,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 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:29:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 638 transitions. [2024-11-07 00:29:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:29:31,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:31,101 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:29:31,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:29:31,102 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:31,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1026982439, now seen corresponding path program 1 times [2024-11-07 00:29:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080787430] [2024-11-07 00:29:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080787430] [2024-11-07 00:29:31,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080787430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:31,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:31,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 00:29:31,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112020669] [2024-11-07 00:29:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:31,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 00:29:31,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:31,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 00:29:31,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:29:31,582 INFO L87 Difference]: Start difference. First operand 456 states and 638 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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:29:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:32,187 INFO L93 Difference]: Finished difference Result 994 states and 1423 transitions. [2024-11-07 00:29:32,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:29:32,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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:29:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:32,190 INFO L225 Difference]: With dead ends: 994 [2024-11-07 00:29:32,190 INFO L226 Difference]: Without dead ends: 817 [2024-11-07 00:29:32,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-11-07 00:29:32,194 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 460 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:32,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1074 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2024-11-07 00:29:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 443. [2024-11-07 00:29:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 441 states have (on average 1.4058956916099774) internal successors, (620), 442 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 620 transitions. [2024-11-07 00:29:32,205 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 620 transitions. Word has length 56 [2024-11-07 00:29:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:32,206 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 620 transitions. [2024-11-07 00:29:32,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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:29:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 620 transitions. [2024-11-07 00:29:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:29:32,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:32,206 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:29:32,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:29:32,207 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:32,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 788720349, now seen corresponding path program 1 times [2024-11-07 00:29:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:32,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239205476] [2024-11-07 00:29:32,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:32,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:32,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:32,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239205476] [2024-11-07 00:29:32,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239205476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:32,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:32,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 00:29:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437008869] [2024-11-07 00:29:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:32,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 00:29:32,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:32,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 00:29:32,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:29:32,680 INFO L87 Difference]: Start difference. First operand 443 states and 620 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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:29:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:33,287 INFO L93 Difference]: Finished difference Result 978 states and 1402 transitions. [2024-11-07 00:29:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:29:33,288 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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:29:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:33,290 INFO L225 Difference]: With dead ends: 978 [2024-11-07 00:29:33,290 INFO L226 Difference]: Without dead ends: 798 [2024-11-07 00:29:33,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-11-07 00:29:33,292 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 454 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:33,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1112 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2024-11-07 00:29:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 420. [2024-11-07 00:29:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4152744630071599) internal successors, (593), 419 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 593 transitions. [2024-11-07 00:29:33,302 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 593 transitions. Word has length 57 [2024-11-07 00:29:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:33,303 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 593 transitions. [2024-11-07 00:29:33,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 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:29:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 593 transitions. [2024-11-07 00:29:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:29:33,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:33,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:33,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:29:33,304 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:33,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash -773234718, now seen corresponding path program 1 times [2024-11-07 00:29:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:33,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550538263] [2024-11-07 00:29:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:33,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550538263] [2024-11-07 00:29:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550538263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:33,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:33,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:33,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752227639] [2024-11-07 00:29:33,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:33,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:33,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:33,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:33,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:33,351 INFO L87 Difference]: Start difference. First operand 420 states and 593 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:33,372 INFO L93 Difference]: Finished difference Result 1086 states and 1560 transitions. [2024-11-07 00:29:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:33,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-07 00:29:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:33,375 INFO L225 Difference]: With dead ends: 1086 [2024-11-07 00:29:33,375 INFO L226 Difference]: Without dead ends: 724 [2024-11-07 00:29:33,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:33,376 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 49 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:33,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 276 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-07 00:29:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 722. [2024-11-07 00:29:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 1.3994452149791956) internal successors, (1009), 721 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1009 transitions. [2024-11-07 00:29:33,388 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1009 transitions. Word has length 76 [2024-11-07 00:29:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:33,388 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1009 transitions. [2024-11-07 00:29:33,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1009 transitions. [2024-11-07 00:29:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:29:33,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:33,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:33,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:29:33,391 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:33,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:33,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2013626748, now seen corresponding path program 1 times [2024-11-07 00:29:33,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:33,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893670993] [2024-11-07 00:29:33,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:33,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:33,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:33,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893670993] [2024-11-07 00:29:33,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893670993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:33,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:33,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932448033] [2024-11-07 00:29:33,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:33,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:33,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:33,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:33,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:33,473 INFO L87 Difference]: Start difference. First operand 722 states and 1009 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:33,492 INFO L93 Difference]: Finished difference Result 1807 states and 2544 transitions. [2024-11-07 00:29:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:33,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-07 00:29:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:33,496 INFO L225 Difference]: With dead ends: 1807 [2024-11-07 00:29:33,496 INFO L226 Difference]: Without dead ends: 1143 [2024-11-07 00:29:33,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:33,497 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 55 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:33,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 263 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2024-11-07 00:29:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1069. [2024-11-07 00:29:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1068 states have (on average 1.392322097378277) internal successors, (1487), 1068 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1487 transitions. [2024-11-07 00:29:33,514 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1487 transitions. Word has length 77 [2024-11-07 00:29:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:33,515 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1487 transitions. [2024-11-07 00:29:33,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1487 transitions. [2024-11-07 00:29:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:29:33,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:33,517 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:29:33,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:29:33,518 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:33,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:33,518 INFO L85 PathProgramCache]: Analyzing trace with hash 31132410, now seen corresponding path program 1 times [2024-11-07 00:29:33,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:33,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289231570] [2024-11-07 00:29:33,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:33,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:33,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:33,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:33,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289231570] [2024-11-07 00:29:33,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289231570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:33,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:33,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:33,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798893631] [2024-11-07 00:29:33,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:33,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:33,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:33,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:33,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:33,597 INFO L87 Difference]: Start difference. First operand 1069 states and 1487 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:29:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:33,619 INFO L93 Difference]: Finished difference Result 2983 states and 4150 transitions. [2024-11-07 00:29:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:33,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:29:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:33,625 INFO L225 Difference]: With dead ends: 2983 [2024-11-07 00:29:33,625 INFO L226 Difference]: Without dead ends: 1972 [2024-11-07 00:29:33,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:33,627 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 48 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:33,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:33,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2024-11-07 00:29:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1862. [2024-11-07 00:29:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1861 states have (on average 1.3761418592154755) internal successors, (2561), 1861 states have internal predecessors, (2561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2561 transitions. [2024-11-07 00:29:33,656 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2561 transitions. Word has length 78 [2024-11-07 00:29:33,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:33,656 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2561 transitions. [2024-11-07 00:29:33,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:29:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2561 transitions. [2024-11-07 00:29:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:29:33,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:33,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:33,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:29:33,658 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:33,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:33,659 INFO L85 PathProgramCache]: Analyzing trace with hash 769651115, now seen corresponding path program 1 times [2024-11-07 00:29:33,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:33,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508309074] [2024-11-07 00:29:33,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:33,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:33,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:33,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:33,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508309074] [2024-11-07 00:29:33,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508309074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:33,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:33,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:33,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980060825] [2024-11-07 00:29:33,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:33,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:33,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:33,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:33,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:33,737 INFO L87 Difference]: Start difference. First operand 1862 states and 2561 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:33,762 INFO L93 Difference]: Finished difference Result 5254 states and 7183 transitions. [2024-11-07 00:29:33,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:33,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-07 00:29:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:33,795 INFO L225 Difference]: With dead ends: 5254 [2024-11-07 00:29:33,795 INFO L226 Difference]: Without dead ends: 3450 [2024-11-07 00:29:33,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:33,797 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 41 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:33,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2024-11-07 00:29:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3232. [2024-11-07 00:29:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 3231 states have (on average 1.3488084184463014) internal successors, (4358), 3231 states have internal predecessors, (4358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4358 transitions. [2024-11-07 00:29:33,860 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4358 transitions. Word has length 79 [2024-11-07 00:29:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:33,860 INFO L471 AbstractCegarLoop]: Abstraction has 3232 states and 4358 transitions. [2024-11-07 00:29:33,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4358 transitions. [2024-11-07 00:29:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:29:33,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:33,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:33,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:29:33,864 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:33,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1757386099, now seen corresponding path program 1 times [2024-11-07 00:29:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416709597] [2024-11-07 00:29:33,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:33,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:34,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:34,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416709597] [2024-11-07 00:29:34,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416709597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:34,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:34,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:29:34,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743522213] [2024-11-07 00:29:34,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:34,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:29:34,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:34,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:29:34,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:29:34,058 INFO L87 Difference]: Start difference. First operand 3232 states and 4358 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:34,091 INFO L93 Difference]: Finished difference Result 3330 states and 4487 transitions. [2024-11-07 00:29:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:29:34,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:29:34,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:34,101 INFO L225 Difference]: With dead ends: 3330 [2024-11-07 00:29:34,101 INFO L226 Difference]: Without dead ends: 3328 [2024-11-07 00:29:34,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:29:34,102 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:34,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 579 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2024-11-07 00:29:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3328. [2024-11-07 00:29:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3328 states, 3327 states have (on average 1.3267207694619778) internal successors, (4414), 3327 states have internal predecessors, (4414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 4414 transitions. [2024-11-07 00:29:34,161 INFO L78 Accepts]: Start accepts. Automaton has 3328 states and 4414 transitions. Word has length 80 [2024-11-07 00:29:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:34,161 INFO L471 AbstractCegarLoop]: Abstraction has 3328 states and 4414 transitions. [2024-11-07 00:29:34,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 4414 transitions. [2024-11-07 00:29:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:29:34,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:34,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:34,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:29:34,163 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:34,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1852306095, now seen corresponding path program 1 times [2024-11-07 00:29:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976311707] [2024-11-07 00:29:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:34,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:34,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:34,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976311707] [2024-11-07 00:29:34,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976311707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:34,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:34,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:34,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710295078] [2024-11-07 00:29:34,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:34,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:34,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:34,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:34,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:34,205 INFO L87 Difference]: Start difference. First operand 3328 states and 4414 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:34,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:34,239 INFO L93 Difference]: Finished difference Result 6724 states and 8936 transitions. [2024-11-07 00:29:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:34,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:29:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:34,255 INFO L225 Difference]: With dead ends: 6724 [2024-11-07 00:29:34,255 INFO L226 Difference]: Without dead ends: 3454 [2024-11-07 00:29:34,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:34,262 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 67 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:34,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:34,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2024-11-07 00:29:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3452. [2024-11-07 00:29:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3451 states have (on average 1.3057084902926688) internal successors, (4506), 3451 states have internal predecessors, (4506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4506 transitions. [2024-11-07 00:29:34,345 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 4506 transitions. Word has length 80 [2024-11-07 00:29:34,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:34,345 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 4506 transitions. [2024-11-07 00:29:34,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 4506 transitions. [2024-11-07 00:29:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:29:34,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:34,348 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:34,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:29:34,348 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:34,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1815794868, now seen corresponding path program 1 times [2024-11-07 00:29:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:34,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672562756] [2024-11-07 00:29:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:34,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:34,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672562756] [2024-11-07 00:29:34,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672562756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:29:34,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137336645] [2024-11-07 00:29:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:34,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:29:34,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:34,771 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:29:34,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 00:29:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:34,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 00:29:34,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:29:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 00:29:35,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:29:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 00:29:35,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137336645] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:29:35,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:29:35,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 18 [2024-11-07 00:29:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230968679] [2024-11-07 00:29:35,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:29:35,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 00:29:35,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:35,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 00:29:35,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:29:35,568 INFO L87 Difference]: Start difference. First operand 3452 states and 4506 transitions. Second operand has 18 states, 18 states have (on average 15.833333333333334) internal successors, (285), 18 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:38,469 INFO L93 Difference]: Finished difference Result 21661 states and 28405 transitions. [2024-11-07 00:29:38,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-07 00:29:38,469 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 15.833333333333334) internal successors, (285), 18 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-07 00:29:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:38,512 INFO L225 Difference]: With dead ends: 21661 [2024-11-07 00:29:38,513 INFO L226 Difference]: Without dead ends: 18267 [2024-11-07 00:29:38,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=920, Invalid=4192, Unknown=0, NotChecked=0, Total=5112 [2024-11-07 00:29:38,523 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1809 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:38,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1809 Valid, 1150 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:29:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18267 states. [2024-11-07 00:29:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18267 to 11627. [2024-11-07 00:29:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11627 states, 11626 states have (on average 1.31747806640289) internal successors, (15317), 11626 states have internal predecessors, (15317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11627 states to 11627 states and 15317 transitions. [2024-11-07 00:29:38,802 INFO L78 Accepts]: Start accepts. Automaton has 11627 states and 15317 transitions. Word has length 101 [2024-11-07 00:29:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:38,803 INFO L471 AbstractCegarLoop]: Abstraction has 11627 states and 15317 transitions. [2024-11-07 00:29:38,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 15.833333333333334) internal successors, (285), 18 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 11627 states and 15317 transitions. [2024-11-07 00:29:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 00:29:38,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:38,806 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:38,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 00:29:39,006 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,SelfDestructingSolverStorable22 [2024-11-07 00:29:39,007 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:29:39,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1635937356, now seen corresponding path program 1 times [2024-11-07 00:29:39,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:39,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439538133] [2024-11-07 00:29:39,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:39,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:39,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:39,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439538133] [2024-11-07 00:29:39,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439538133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:29:39,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026584130] [2024-11-07 00:29:39,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:39,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:29:39,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:39,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:29:39,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 00:29:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:39,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 00:29:39,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:29:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:41,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:29:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:43,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026584130] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:29:43,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:29:43,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 21] total 56 [2024-11-07 00:29:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571106079] [2024-11-07 00:29:43,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:29:43,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-07 00:29:43,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:43,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-07 00:29:43,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2851, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 00:29:43,763 INFO L87 Difference]: Start difference. First operand 11627 states and 15317 transitions. Second operand has 56 states, 56 states have (on average 5.196428571428571) internal successors, (291), 56 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:39,870 INFO L93 Difference]: Finished difference Result 149837 states and 197613 transitions. [2024-11-07 00:30:39,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 481 states. [2024-11-07 00:30:39,871 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 5.196428571428571) internal successors, (291), 56 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-07 00:30:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:40,583 INFO L225 Difference]: With dead ends: 149837 [2024-11-07 00:30:40,583 INFO L226 Difference]: Without dead ends: 138285 [2024-11-07 00:30:40,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 533 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119136 ImplicationChecksByTransitivity, 46.9s TimeCoverageRelationStatistics Valid=19060, Invalid=266630, Unknown=0, NotChecked=0, Total=285690 [2024-11-07 00:30:40,715 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 11325 mSDsluCounter, 8665 mSDsCounter, 0 mSdLazyCounter, 13669 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11325 SdHoareTripleChecker+Valid, 8934 SdHoareTripleChecker+Invalid, 13919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 13669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:40,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11325 Valid, 8934 Invalid, 13919 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [250 Valid, 13669 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-07 00:30:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138285 states. [2024-11-07 00:30:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138285 to 39267. [2024-11-07 00:30:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39267 states, 39266 states have (on average 1.3178576885855446) internal successors, (51747), 39266 states have internal predecessors, (51747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39267 states to 39267 states and 51747 transitions. [2024-11-07 00:30:43,712 INFO L78 Accepts]: Start accepts. Automaton has 39267 states and 51747 transitions. Word has length 102 [2024-11-07 00:30:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:43,715 INFO L471 AbstractCegarLoop]: Abstraction has 39267 states and 51747 transitions. [2024-11-07 00:30:43,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 5.196428571428571) internal successors, (291), 56 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 39267 states and 51747 transitions. [2024-11-07 00:30:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 00:30:43,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:43,726 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:43,768 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:30:43,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:30:43,927 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:30:43,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1399222449, now seen corresponding path program 1 times [2024-11-07 00:30:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:43,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989329269] [2024-11-07 00:30:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:44,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:44,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989329269] [2024-11-07 00:30:44,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989329269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:30:44,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127722180] [2024-11-07 00:30:44,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:44,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:30:44,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:30:44,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:30:44,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 00:30:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:44,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 25 conjuncts are in the unsatisfiable core