./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.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', 'f28b91143467a6885de009814531d324420ecf879f456eaa915411039fe43e58'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.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 f28b91143467a6885de009814531d324420ecf879f456eaa915411039fe43e58 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:25:43,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:25:43,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:25:43,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:25:43,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:25:43,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:25:43,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:25:43,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:25:43,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:25:43,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:25:43,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:25:43,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:25:43,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:25:43,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:25:43,628 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:25:43,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:25:43,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:25:43,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:25:43,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:25:43,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:25:43,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:25:43,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:25:43,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:25:43,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:25:43,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:25:43,630 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:25:43,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:25:43,630 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:25:43,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:25:43,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:25:43,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:25:43,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:25:43,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:25:43,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:25:43,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:25:43,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:25:43,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:25:43,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:25:43,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:25:43,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:25:43,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:25:43,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:25:43,632 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 -> f28b91143467a6885de009814531d324420ecf879f456eaa915411039fe43e58 [2024-11-07 01:25:43,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:25:43,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:25:43,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:25:43,955 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:25:43,955 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:25:43,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-07 01:25:45,234 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:25:45,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:25:45,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-07 01:25:45,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b59c0b7e2/61d6ab645f594532b59fd1ed54be751e/FLAGcc1e65728 [2024-11-07 01:25:45,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b59c0b7e2/61d6ab645f594532b59fd1ed54be751e [2024-11-07 01:25:45,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:25:45,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:25:45,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:25:45,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:25:45,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:25:45,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:25:45" (1/1) ... [2024-11-07 01:25:45,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1561677c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:45, skipping insertion in model container [2024-11-07 01:25:45,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:25:45" (1/1) ... [2024-11-07 01:25:45,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:25:46,320 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c[6450,6463] [2024-11-07 01:25:46,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c[13386,13399] [2024-11-07 01:25:46,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:25:46,905 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:25:46,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c[6450,6463] [2024-11-07 01:25:46,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c[13386,13399] [2024-11-07 01:25:47,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:25:47,315 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:25:47,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47 WrapperNode [2024-11-07 01:25:47,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:25:47,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:25:47,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:25:47,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:25:47,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (1/1) ... [2024-11-07 01:25:47,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (1/1) ... [2024-11-07 01:25:47,782 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4983 [2024-11-07 01:25:47,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:25:47,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:25:47,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:25:47,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:25:47,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (1/1) ... [2024-11-07 01:25:47,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (1/1) ... [2024-11-07 01:25:47,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (1/1) ... [2024-11-07 01:25:48,078 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:25:48,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (1/1) ... [2024-11-07 01:25:48,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (1/1) ... [2024-11-07 01:25:48,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (1/1) ... [2024-11-07 01:25:48,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (1/1) ... [2024-11-07 01:25:48,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (1/1) ... [2024-11-07 01:25:48,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (1/1) ... [2024-11-07 01:25:48,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:25:48,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:25:48,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:25:48,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:25:48,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (1/1) ... [2024-11-07 01:25:48,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:25:48,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:25:48,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:25:48,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:25:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:25:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:25:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:25:48,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:25:48,653 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:25:48,654 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:25:53,033 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-11-07 01:25:53,033 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:25:53,070 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:25:53,071 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 01:25:53,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:25:53 BoogieIcfgContainer [2024-11-07 01:25:53,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:25:53,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:25:53,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:25:53,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:25:53,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:25:45" (1/3) ... [2024-11-07 01:25:53,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7893188b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:25:53, skipping insertion in model container [2024-11-07 01:25:53,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:25:47" (2/3) ... [2024-11-07 01:25:53,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7893188b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:25:53, skipping insertion in model container [2024-11-07 01:25:53,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:25:53" (3/3) ... [2024-11-07 01:25:53,153 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-07 01:25:53,181 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:25:53,181 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:25:53,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:25:53,353 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;@10bd0d30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:25:53,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:25:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 874 states, 871 states have (on average 1.9058553386911596) internal successors, (1660), 873 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 01:25:53,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:53,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:25:53,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:53,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash -934405548, now seen corresponding path program 1 times [2024-11-07 01:25:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:53,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302800157] [2024-11-07 01:25:53,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:53,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:53,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:53,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302800157] [2024-11-07 01:25:53,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302800157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:53,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:53,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 01:25:53,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571677928] [2024-11-07 01:25:53,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:53,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 01:25:53,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:53,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 01:25:53,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 01:25:53,637 INFO L87 Difference]: Start difference. First operand has 874 states, 871 states have (on average 1.9058553386911596) internal successors, (1660), 873 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:53,727 INFO L93 Difference]: Finished difference Result 1724 states and 3278 transitions. [2024-11-07 01:25:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 01:25:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-07 01:25:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:53,754 INFO L225 Difference]: With dead ends: 1724 [2024-11-07 01:25:53,754 INFO L226 Difference]: Without dead ends: 808 [2024-11-07 01:25:53,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 01:25:53,771 INFO L432 NwaCegarLoop]: 1591 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:53,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-07 01:25:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-11-07 01:25:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8945409429280398) internal successors, (1527), 807 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1527 transitions. [2024-11-07 01:25:53,872 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1527 transitions. Word has length 20 [2024-11-07 01:25:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:53,872 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1527 transitions. [2024-11-07 01:25:53,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1527 transitions. [2024-11-07 01:25:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 01:25:53,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:53,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:25:53,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:25:53,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:53,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:53,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1945522798, now seen corresponding path program 1 times [2024-11-07 01:25:53,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:53,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132467072] [2024-11-07 01:25:53,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:54,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:54,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132467072] [2024-11-07 01:25:54,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132467072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:54,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:54,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:25:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746289580] [2024-11-07 01:25:54,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:54,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:25:54,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:54,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:25:54,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:25:54,154 INFO L87 Difference]: Start difference. First operand 808 states and 1527 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:54,263 INFO L93 Difference]: Finished difference Result 844 states and 1581 transitions. [2024-11-07 01:25:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:25:54,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-07 01:25:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:54,269 INFO L225 Difference]: With dead ends: 844 [2024-11-07 01:25:54,269 INFO L226 Difference]: Without dead ends: 808 [2024-11-07 01:25:54,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:25:54,272 INFO L432 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:54,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-07 01:25:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-11-07 01:25:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8746898263027296) internal successors, (1511), 807 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1511 transitions. [2024-11-07 01:25:54,312 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1511 transitions. Word has length 20 [2024-11-07 01:25:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:54,312 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1511 transitions. [2024-11-07 01:25:54,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1511 transitions. [2024-11-07 01:25:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 01:25:54,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:54,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:25:54,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:25:54,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:54,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:54,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1226597962, now seen corresponding path program 1 times [2024-11-07 01:25:54,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:54,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427422747] [2024-11-07 01:25:54,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:54,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:54,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427422747] [2024-11-07 01:25:54,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427422747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:54,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:54,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:25:54,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795828416] [2024-11-07 01:25:54,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:54,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:25:54,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:54,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:25:54,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:25:54,461 INFO L87 Difference]: Start difference. First operand 808 states and 1511 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:54,591 INFO L93 Difference]: Finished difference Result 1000 states and 1811 transitions. [2024-11-07 01:25:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:25:54,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-07 01:25:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:54,596 INFO L225 Difference]: With dead ends: 1000 [2024-11-07 01:25:54,596 INFO L226 Difference]: Without dead ends: 968 [2024-11-07 01:25:54,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:25:54,598 INFO L432 NwaCegarLoop]: 1505 mSDtfsCounter, 4682 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4682 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:54,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4682 Valid, 1758 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:25:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-11-07 01:25:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 838. [2024-11-07 01:25:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 1.8636363636363635) internal successors, (1558), 837 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1558 transitions. [2024-11-07 01:25:54,635 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1558 transitions. Word has length 35 [2024-11-07 01:25:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:54,635 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1558 transitions. [2024-11-07 01:25:54,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1558 transitions. [2024-11-07 01:25:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 01:25:54,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:54,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:25:54,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:25:54,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:54,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash 523901274, now seen corresponding path program 1 times [2024-11-07 01:25:54,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:54,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198553018] [2024-11-07 01:25:54,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:54,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:54,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:54,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198553018] [2024-11-07 01:25:54,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198553018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:54,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:54,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:25:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79737637] [2024-11-07 01:25:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:54,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:25:54,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:54,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:25:54,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:54,759 INFO L87 Difference]: Start difference. First operand 838 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:54,802 INFO L93 Difference]: Finished difference Result 951 states and 1733 transitions. [2024-11-07 01:25:54,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:25:54,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-07 01:25:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:54,808 INFO L225 Difference]: With dead ends: 951 [2024-11-07 01:25:54,808 INFO L226 Difference]: Without dead ends: 889 [2024-11-07 01:25:54,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:54,811 INFO L432 NwaCegarLoop]: 1507 mSDtfsCounter, 1468 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:54,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1550 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-07 01:25:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 885. [2024-11-07 01:25:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.8437146092865233) internal successors, (1628), 884 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1628 transitions. [2024-11-07 01:25:54,841 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1628 transitions. Word has length 37 [2024-11-07 01:25:54,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:54,842 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1628 transitions. [2024-11-07 01:25:54,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1628 transitions. [2024-11-07 01:25:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 01:25:54,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:54,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:25:54,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:25:54,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:54,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash 590394786, now seen corresponding path program 1 times [2024-11-07 01:25:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:54,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643022283] [2024-11-07 01:25:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:55,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:55,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643022283] [2024-11-07 01:25:55,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643022283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:55,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:55,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:25:55,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610319274] [2024-11-07 01:25:55,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:55,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:25:55,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:55,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:25:55,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:25:55,056 INFO L87 Difference]: Start difference. First operand 885 states and 1628 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:55,144 INFO L93 Difference]: Finished difference Result 996 states and 1796 transitions. [2024-11-07 01:25:55,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:25:55,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-07 01:25:55,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:55,149 INFO L225 Difference]: With dead ends: 996 [2024-11-07 01:25:55,149 INFO L226 Difference]: Without dead ends: 887 [2024-11-07 01:25:55,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:25:55,151 INFO L432 NwaCegarLoop]: 1506 mSDtfsCounter, 2952 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2952 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:55,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2952 Valid, 1598 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:55,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-07 01:25:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2024-11-07 01:25:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.8414496036240091) internal successors, (1626), 884 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1626 transitions. [2024-11-07 01:25:55,174 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1626 transitions. Word has length 37 [2024-11-07 01:25:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:55,174 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1626 transitions. [2024-11-07 01:25:55,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1626 transitions. [2024-11-07 01:25:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-07 01:25:55,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:55,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:25:55,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:25:55,176 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:55,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash 707645968, now seen corresponding path program 1 times [2024-11-07 01:25:55,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:55,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46209221] [2024-11-07 01:25:55,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:55,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:55,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46209221] [2024-11-07 01:25:55,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46209221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:55,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:55,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:25:55,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524088730] [2024-11-07 01:25:55,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:55,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:25:55,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:55,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:25:55,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:25:55,464 INFO L87 Difference]: Start difference. First operand 885 states and 1626 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:55,554 INFO L93 Difference]: Finished difference Result 893 states and 1635 transitions. [2024-11-07 01:25:55,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:25:55,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-07 01:25:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:55,562 INFO L225 Difference]: With dead ends: 893 [2024-11-07 01:25:55,562 INFO L226 Difference]: Without dead ends: 891 [2024-11-07 01:25:55,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:25:55,564 INFO L432 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 9017 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10522 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:55,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10522 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-11-07 01:25:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2024-11-07 01:25:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 889 states have (on average 1.8346456692913387) internal successors, (1631), 890 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1631 transitions. [2024-11-07 01:25:55,595 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1631 transitions. Word has length 38 [2024-11-07 01:25:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:55,596 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1631 transitions. [2024-11-07 01:25:55,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1631 transitions. [2024-11-07 01:25:55,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 01:25:55,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:55,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:25:55,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:25:55,598 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:55,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1903217474, now seen corresponding path program 1 times [2024-11-07 01:25:55,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:55,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636751244] [2024-11-07 01:25:55,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:55,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:55,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:55,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636751244] [2024-11-07 01:25:55,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636751244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:55,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:55,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:25:55,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121697191] [2024-11-07 01:25:55,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:55,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:25:55,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:55,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:25:55,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:55,663 INFO L87 Difference]: Start difference. First operand 891 states and 1631 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:55,694 INFO L93 Difference]: Finished difference Result 1105 states and 1943 transitions. [2024-11-07 01:25:55,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:25:55,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-07 01:25:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:55,699 INFO L225 Difference]: With dead ends: 1105 [2024-11-07 01:25:55,700 INFO L226 Difference]: Without dead ends: 990 [2024-11-07 01:25:55,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:55,701 INFO L432 NwaCegarLoop]: 1528 mSDtfsCounter, 1475 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:55,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1587 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-07 01:25:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2024-11-07 01:25:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 986 states have (on average 1.793103448275862) internal successors, (1768), 987 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1768 transitions. [2024-11-07 01:25:55,726 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1768 transitions. Word has length 39 [2024-11-07 01:25:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:55,727 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1768 transitions. [2024-11-07 01:25:55,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1768 transitions. [2024-11-07 01:25:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 01:25:55,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:55,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:25:55,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:25:55,728 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:55,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash 122284610, now seen corresponding path program 1 times [2024-11-07 01:25:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:55,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886447637] [2024-11-07 01:25:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:55,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:55,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:55,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886447637] [2024-11-07 01:25:55,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886447637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:55,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:55,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:25:55,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730604966] [2024-11-07 01:25:55,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:55,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:25:55,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:55,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:25:55,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:55,793 INFO L87 Difference]: Start difference. First operand 988 states and 1768 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:55,823 INFO L93 Difference]: Finished difference Result 1380 states and 2326 transitions. [2024-11-07 01:25:55,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:25:55,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-07 01:25:55,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:55,830 INFO L225 Difference]: With dead ends: 1380 [2024-11-07 01:25:55,830 INFO L226 Difference]: Without dead ends: 1168 [2024-11-07 01:25:55,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:55,832 INFO L432 NwaCegarLoop]: 1538 mSDtfsCounter, 1477 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:55,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1593 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:55,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-11-07 01:25:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1166. [2024-11-07 01:25:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1164 states have (on average 1.7268041237113403) internal successors, (2010), 1165 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 2010 transitions. [2024-11-07 01:25:55,861 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 2010 transitions. Word has length 39 [2024-11-07 01:25:55,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:55,861 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 2010 transitions. [2024-11-07 01:25:55,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 2010 transitions. [2024-11-07 01:25:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 01:25:55,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:55,862 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] [2024-11-07 01:25:55,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:25:55,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:55,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:55,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1688735299, now seen corresponding path program 1 times [2024-11-07 01:25:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:55,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940185307] [2024-11-07 01:25:55,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:55,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:55,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940185307] [2024-11-07 01:25:55,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940185307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:55,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:55,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:25:55,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536747628] [2024-11-07 01:25:55,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:55,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:25:55,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:55,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:25:55,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:55,914 INFO L87 Difference]: Start difference. First operand 1166 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:55,947 INFO L93 Difference]: Finished difference Result 1589 states and 2616 transitions. [2024-11-07 01:25:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:25:55,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-07 01:25:55,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:55,954 INFO L225 Difference]: With dead ends: 1589 [2024-11-07 01:25:55,954 INFO L226 Difference]: Without dead ends: 1354 [2024-11-07 01:25:55,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:55,956 INFO L432 NwaCegarLoop]: 1543 mSDtfsCounter, 1476 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:55,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-11-07 01:25:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2024-11-07 01:25:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1350 states have (on average 1.677037037037037) internal successors, (2264), 1351 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2264 transitions. [2024-11-07 01:25:55,993 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2264 transitions. Word has length 41 [2024-11-07 01:25:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:55,994 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 2264 transitions. [2024-11-07 01:25:55,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2264 transitions. [2024-11-07 01:25:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 01:25:55,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:55,996 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:25:55,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:25:55,996 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:55,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash 923003988, now seen corresponding path program 1 times [2024-11-07 01:25:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:55,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781901973] [2024-11-07 01:25:55,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:55,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 01:25:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:56,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781901973] [2024-11-07 01:25:56,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781901973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:56,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:56,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:25:56,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526605947] [2024-11-07 01:25:56,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:56,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:25:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:56,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:25:56,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:25:56,115 INFO L87 Difference]: Start difference. First operand 1352 states and 2264 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:56,231 INFO L93 Difference]: Finished difference Result 3208 states and 4844 transitions. [2024-11-07 01:25:56,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:25:56,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 01:25:56,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:56,245 INFO L225 Difference]: With dead ends: 3208 [2024-11-07 01:25:56,245 INFO L226 Difference]: Without dead ends: 2634 [2024-11-07 01:25:56,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:25:56,247 INFO L432 NwaCegarLoop]: 1551 mSDtfsCounter, 3057 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3057 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:56,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3057 Valid, 3155 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:56,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2024-11-07 01:25:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1924. [2024-11-07 01:25:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1922 states have (on average 1.5879292403746097) internal successors, (3052), 1923 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3052 transitions. [2024-11-07 01:25:56,311 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3052 transitions. Word has length 54 [2024-11-07 01:25:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:56,312 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 3052 transitions. [2024-11-07 01:25:56,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3052 transitions. [2024-11-07 01:25:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 01:25:56,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:56,313 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:25:56,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:25:56,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:56,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:56,317 INFO L85 PathProgramCache]: Analyzing trace with hash -857928876, now seen corresponding path program 1 times [2024-11-07 01:25:56,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:56,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277557981] [2024-11-07 01:25:56,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:56,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:25:56,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:56,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277557981] [2024-11-07 01:25:56,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277557981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:56,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:56,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:25:56,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579513270] [2024-11-07 01:25:56,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:56,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:25:56,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:56,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:25:56,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:25:56,454 INFO L87 Difference]: Start difference. First operand 1924 states and 3052 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:56,643 INFO L93 Difference]: Finished difference Result 3780 states and 5632 transitions. [2024-11-07 01:25:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:25:56,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 01:25:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:56,656 INFO L225 Difference]: With dead ends: 3780 [2024-11-07 01:25:56,657 INFO L226 Difference]: Without dead ends: 3206 [2024-11-07 01:25:56,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:25:56,659 INFO L432 NwaCegarLoop]: 1552 mSDtfsCounter, 3049 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3049 SdHoareTripleChecker+Valid, 3170 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:56,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3049 Valid, 3170 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:25:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2024-11-07 01:25:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2784. [2024-11-07 01:25:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2782 states have (on average 1.518332135154565) internal successors, (4224), 2783 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4224 transitions. [2024-11-07 01:25:56,736 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4224 transitions. Word has length 54 [2024-11-07 01:25:56,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:56,736 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 4224 transitions. [2024-11-07 01:25:56,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4224 transitions. [2024-11-07 01:25:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 01:25:56,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:56,738 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:25:56,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:25:56,738 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:56,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash 894361900, now seen corresponding path program 1 times [2024-11-07 01:25:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:56,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655444696] [2024-11-07 01:25:56,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:56,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:56,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:56,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655444696] [2024-11-07 01:25:56,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655444696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:56,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:56,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:25:56,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364966980] [2024-11-07 01:25:56,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:56,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:25:56,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:56,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:25:56,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:56,839 INFO L87 Difference]: Start difference. First operand 2784 states and 4224 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:56,891 INFO L93 Difference]: Finished difference Result 4260 states and 6287 transitions. [2024-11-07 01:25:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:25:56,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-07 01:25:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:56,901 INFO L225 Difference]: With dead ends: 4260 [2024-11-07 01:25:56,901 INFO L226 Difference]: Without dead ends: 2254 [2024-11-07 01:25:56,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:56,905 INFO L432 NwaCegarLoop]: 1535 mSDtfsCounter, 34 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3031 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:56,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3031 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2024-11-07 01:25:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2252. [2024-11-07 01:25:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2250 states have (on average 1.5537777777777777) internal successors, (3496), 2251 states have internal predecessors, (3496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3496 transitions. [2024-11-07 01:25:56,967 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3496 transitions. Word has length 56 [2024-11-07 01:25:56,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:56,968 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3496 transitions. [2024-11-07 01:25:56,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3496 transitions. [2024-11-07 01:25:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 01:25:56,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:56,971 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] [2024-11-07 01:25:56,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:25:56,972 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:56,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:56,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1218909775, now seen corresponding path program 1 times [2024-11-07 01:25:56,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:56,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179563069] [2024-11-07 01:25:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:56,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:25:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179563069] [2024-11-07 01:25:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179563069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:57,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:57,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:25:57,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978227031] [2024-11-07 01:25:57,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:57,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:25:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:57,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:25:57,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:25:57,076 INFO L87 Difference]: Start difference. First operand 2252 states and 3496 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:57,175 INFO L93 Difference]: Finished difference Result 3508 states and 5252 transitions. [2024-11-07 01:25:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:25:57,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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 56 [2024-11-07 01:25:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:57,187 INFO L225 Difference]: With dead ends: 3508 [2024-11-07 01:25:57,188 INFO L226 Difference]: Without dead ends: 3090 [2024-11-07 01:25:57,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:25:57,190 INFO L432 NwaCegarLoop]: 1549 mSDtfsCounter, 3051 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:57,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 3147 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2024-11-07 01:25:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 2668. [2024-11-07 01:25:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2666 states have (on average 1.5273818454613652) internal successors, (4072), 2667 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4072 transitions. [2024-11-07 01:25:57,264 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4072 transitions. Word has length 56 [2024-11-07 01:25:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:57,265 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4072 transitions. [2024-11-07 01:25:57,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4072 transitions. [2024-11-07 01:25:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 01:25:57,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:57,266 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:25:57,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:25:57,266 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:57,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:57,267 INFO L85 PathProgramCache]: Analyzing trace with hash -877348108, now seen corresponding path program 1 times [2024-11-07 01:25:57,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:57,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33642775] [2024-11-07 01:25:57,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:57,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:57,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:57,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33642775] [2024-11-07 01:25:57,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33642775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:57,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:57,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:25:57,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309302161] [2024-11-07 01:25:57,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:57,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:25:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:57,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:25:57,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:57,353 INFO L87 Difference]: Start difference. First operand 2668 states and 4072 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:57,436 INFO L93 Difference]: Finished difference Result 3608 states and 5370 transitions. [2024-11-07 01:25:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:25:57,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-07 01:25:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:57,450 INFO L225 Difference]: With dead ends: 3608 [2024-11-07 01:25:57,454 INFO L226 Difference]: Without dead ends: 1734 [2024-11-07 01:25:57,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:57,457 INFO L432 NwaCegarLoop]: 1528 mSDtfsCounter, 29 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:57,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2024-11-07 01:25:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2024-11-07 01:25:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.5942196531791908) internal successors, (2758), 1731 states have internal predecessors, (2758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2758 transitions. [2024-11-07 01:25:57,507 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2758 transitions. Word has length 57 [2024-11-07 01:25:57,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:57,508 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2758 transitions. [2024-11-07 01:25:57,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2758 transitions. [2024-11-07 01:25:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 01:25:57,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:57,513 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] [2024-11-07 01:25:57,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:25:57,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:57,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:57,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1226511174, now seen corresponding path program 1 times [2024-11-07 01:25:57,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:57,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32628510] [2024-11-07 01:25:57,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:57,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:57,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:57,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32628510] [2024-11-07 01:25:57,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32628510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:57,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:57,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:25:57,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672423545] [2024-11-07 01:25:57,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:57,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:25:57,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:57,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:25:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:57,670 INFO L87 Difference]: Start difference. First operand 1732 states and 2758 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:25:57,734 INFO L93 Difference]: Finished difference Result 2204 states and 3399 transitions. [2024-11-07 01:25:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:25:57,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-07 01:25:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:25:57,750 INFO L225 Difference]: With dead ends: 2204 [2024-11-07 01:25:57,750 INFO L226 Difference]: Without dead ends: 1266 [2024-11-07 01:25:57,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:25:57,758 INFO L432 NwaCegarLoop]: 1521 mSDtfsCounter, 26 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:25:57,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3001 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:25:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-11-07 01:25:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1264. [2024-11-07 01:25:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1262 states have (on average 1.6719492868462758) internal successors, (2110), 1263 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 2110 transitions. [2024-11-07 01:25:57,798 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 2110 transitions. Word has length 59 [2024-11-07 01:25:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:25:57,798 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 2110 transitions. [2024-11-07 01:25:57,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:25:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 2110 transitions. [2024-11-07 01:25:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 01:25:57,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:25:57,799 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] [2024-11-07 01:25:57,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:25:57,800 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:25:57,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:25:57,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1918634021, now seen corresponding path program 1 times [2024-11-07 01:25:57,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:25:57,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287562985] [2024-11-07 01:25:57,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:25:57,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:25:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:25:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:25:57,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:25:57,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287562985] [2024-11-07 01:25:57,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287562985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:25:57,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:25:57,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:25:57,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529751900] [2024-11-07 01:25:57,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:25:57,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:25:57,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:25:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:25:57,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:25:57,934 INFO L87 Difference]: Start difference. First operand 1264 states and 2110 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:04,001 INFO L93 Difference]: Finished difference Result 3519 states and 6419 transitions. [2024-11-07 01:26:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:26:04,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-07 01:26:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:04,012 INFO L225 Difference]: With dead ends: 3519 [2024-11-07 01:26:04,012 INFO L226 Difference]: Without dead ends: 2766 [2024-11-07 01:26:04,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:26:04,014 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 2325 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2325 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:04,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2325 Valid, 783 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-07 01:26:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2024-11-07 01:26:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2766. [2024-11-07 01:26:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 2764 states have (on average 1.5325615050651231) internal successors, (4236), 2765 states have internal predecessors, (4236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 4236 transitions. [2024-11-07 01:26:04,074 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 4236 transitions. Word has length 60 [2024-11-07 01:26:04,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:04,074 INFO L471 AbstractCegarLoop]: Abstraction has 2766 states and 4236 transitions. [2024-11-07 01:26:04,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:04,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 4236 transitions. [2024-11-07 01:26:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 01:26:04,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:04,076 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] [2024-11-07 01:26:04,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:26:04,076 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:04,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:04,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1826022888, now seen corresponding path program 1 times [2024-11-07 01:26:04,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:04,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731093366] [2024-11-07 01:26:04,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:05,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:05,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731093366] [2024-11-07 01:26:05,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731093366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:26:05,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515914958] [2024-11-07 01:26:05,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:05,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:05,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:26:05,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:26:05,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 01:26:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:05,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 01:26:05,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:26:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:26:05,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:26:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:26:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515914958] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:26:06,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:26:06,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2024-11-07 01:26:06,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438242711] [2024-11-07 01:26:06,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:26:06,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 01:26:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:06,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 01:26:06,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:26:06,114 INFO L87 Difference]: Start difference. First operand 2766 states and 4236 transitions. Second operand has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:08,238 INFO L93 Difference]: Finished difference Result 5167 states and 7410 transitions. [2024-11-07 01:26:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-07 01:26:08,239 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-07 01:26:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:08,250 INFO L225 Difference]: With dead ends: 5167 [2024-11-07 01:26:08,250 INFO L226 Difference]: Without dead ends: 4697 [2024-11-07 01:26:08,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=545, Invalid=2535, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 01:26:08,254 INFO L432 NwaCegarLoop]: 1499 mSDtfsCounter, 15751 mSDsluCounter, 7677 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15751 SdHoareTripleChecker+Valid, 9176 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:08,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15751 Valid, 9176 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:26:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2024-11-07 01:26:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 4663. [2024-11-07 01:26:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4663 states, 4661 states have (on average 1.4119287706500752) internal successors, (6581), 4662 states have internal predecessors, (6581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 6581 transitions. [2024-11-07 01:26:08,382 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 6581 transitions. Word has length 61 [2024-11-07 01:26:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:08,383 INFO L471 AbstractCegarLoop]: Abstraction has 4663 states and 6581 transitions. [2024-11-07 01:26:08,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 6581 transitions. [2024-11-07 01:26:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 01:26:08,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:08,385 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:26:08,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 01:26:08,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 01:26:08,590 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:08,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:08,591 INFO L85 PathProgramCache]: Analyzing trace with hash 459765187, now seen corresponding path program 1 times [2024-11-07 01:26:08,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:08,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937121698] [2024-11-07 01:26:08,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:08,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:10,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:10,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937121698] [2024-11-07 01:26:10,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937121698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:26:10,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660520] [2024-11-07 01:26:10,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:10,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:10,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:26:10,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:26:10,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 01:26:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:10,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 01:26:10,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:26:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:10,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:26:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:11,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:26:11,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:26:11,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-11-07 01:26:11,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059443745] [2024-11-07 01:26:11,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:26:11,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 01:26:11,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:11,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 01:26:11,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-11-07 01:26:11,260 INFO L87 Difference]: Start difference. First operand 4663 states and 6581 transitions. Second operand has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 25 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:11,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:11,838 INFO L93 Difference]: Finished difference Result 8932 states and 11996 transitions. [2024-11-07 01:26:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:26:11,839 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 25 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-07 01:26:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:11,851 INFO L225 Difference]: With dead ends: 8932 [2024-11-07 01:26:11,851 INFO L226 Difference]: Without dead ends: 6973 [2024-11-07 01:26:11,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 01:26:11,855 INFO L432 NwaCegarLoop]: 1495 mSDtfsCounter, 11999 mSDsluCounter, 4808 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11999 SdHoareTripleChecker+Valid, 6303 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:11,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11999 Valid, 6303 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:26:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6973 states. [2024-11-07 01:26:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6973 to 6907. [2024-11-07 01:26:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6907 states, 6905 states have (on average 1.3497465604634322) internal successors, (9320), 6906 states have internal predecessors, (9320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6907 states to 6907 states and 9320 transitions. [2024-11-07 01:26:12,091 INFO L78 Accepts]: Start accepts. Automaton has 6907 states and 9320 transitions. Word has length 62 [2024-11-07 01:26:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:12,091 INFO L471 AbstractCegarLoop]: Abstraction has 6907 states and 9320 transitions. [2024-11-07 01:26:12,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 25 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6907 states and 9320 transitions. [2024-11-07 01:26:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 01:26:12,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:12,093 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:26:12,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 01:26:12,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 01:26:12,297 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:12,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:12,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1147902773, now seen corresponding path program 1 times [2024-11-07 01:26:12,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:12,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919584935] [2024-11-07 01:26:12,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:12,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:12,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919584935] [2024-11-07 01:26:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919584935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:26:12,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73328597] [2024-11-07 01:26:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:12,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:26:12,611 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:26:12,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 01:26:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:12,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 01:26:12,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:26:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:13,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:26:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:14,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73328597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:26:14,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:26:14,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-11-07 01:26:14,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924347668] [2024-11-07 01:26:14,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:26:14,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-07 01:26:14,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:14,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-07 01:26:14,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-11-07 01:26:14,210 INFO L87 Difference]: Start difference. First operand 6907 states and 9320 transitions. Second operand has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:16,854 INFO L93 Difference]: Finished difference Result 17154 states and 22116 transitions. [2024-11-07 01:26:16,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-07 01:26:16,855 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-07 01:26:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:16,886 INFO L225 Difference]: With dead ends: 17154 [2024-11-07 01:26:16,887 INFO L226 Difference]: Without dead ends: 13056 [2024-11-07 01:26:16,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1214, Invalid=5592, Unknown=0, NotChecked=0, Total=6806 [2024-11-07 01:26:16,898 INFO L432 NwaCegarLoop]: 1508 mSDtfsCounter, 15195 mSDsluCounter, 18322 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15195 SdHoareTripleChecker+Valid, 19830 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:16,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15195 Valid, 19830 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:26:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13056 states. [2024-11-07 01:26:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13056 to 9106. [2024-11-07 01:26:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9106 states, 9104 states have (on average 1.3146968365553602) internal successors, (11969), 9105 states have internal predecessors, (11969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9106 states to 9106 states and 11969 transitions. [2024-11-07 01:26:17,208 INFO L78 Accepts]: Start accepts. Automaton has 9106 states and 11969 transitions. Word has length 62 [2024-11-07 01:26:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:17,208 INFO L471 AbstractCegarLoop]: Abstraction has 9106 states and 11969 transitions. [2024-11-07 01:26:17,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.9375) internal successors, (158), 32 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 9106 states and 11969 transitions. [2024-11-07 01:26:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 01:26:17,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:17,210 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] [2024-11-07 01:26:17,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 01:26:17,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:17,414 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:17,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:17,414 INFO L85 PathProgramCache]: Analyzing trace with hash 807603108, now seen corresponding path program 1 times [2024-11-07 01:26:17,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:17,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443347249] [2024-11-07 01:26:17,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:17,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:17,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:17,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443347249] [2024-11-07 01:26:17,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443347249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:26:17,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481759702] [2024-11-07 01:26:17,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:17,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:17,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:26:17,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:26:17,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 01:26:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:17,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 01:26:17,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:26:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:19,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:26:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:19,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481759702] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:26:19,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:26:19,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-11-07 01:26:19,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56204129] [2024-11-07 01:26:19,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:26:19,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 01:26:19,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:19,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 01:26:19,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2024-11-07 01:26:19,844 INFO L87 Difference]: Start difference. First operand 9106 states and 11969 transitions. Second operand has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 26 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:21,204 INFO L93 Difference]: Finished difference Result 17832 states and 22811 transitions. [2024-11-07 01:26:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 01:26:21,204 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 26 states have internal predecessors, (165), 0 states have call successors, (0), 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 63 [2024-11-07 01:26:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:21,227 INFO L225 Difference]: With dead ends: 17832 [2024-11-07 01:26:21,228 INFO L226 Difference]: Without dead ends: 12188 [2024-11-07 01:26:21,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=637, Invalid=2015, Unknown=0, NotChecked=0, Total=2652 [2024-11-07 01:26:21,237 INFO L432 NwaCegarLoop]: 1514 mSDtfsCounter, 18641 mSDsluCounter, 6519 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18641 SdHoareTripleChecker+Valid, 8033 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:21,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18641 Valid, 8033 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:26:21,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12188 states. [2024-11-07 01:26:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12188 to 11582. [2024-11-07 01:26:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11582 states, 11580 states have (on average 1.2876511226252159) internal successors, (14911), 11581 states have internal predecessors, (14911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11582 states to 11582 states and 14911 transitions. [2024-11-07 01:26:21,640 INFO L78 Accepts]: Start accepts. Automaton has 11582 states and 14911 transitions. Word has length 63 [2024-11-07 01:26:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:21,641 INFO L471 AbstractCegarLoop]: Abstraction has 11582 states and 14911 transitions. [2024-11-07 01:26:21,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.111111111111111) internal successors, (165), 26 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:21,641 INFO L276 IsEmpty]: Start isEmpty. Operand 11582 states and 14911 transitions. [2024-11-07 01:26:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 01:26:21,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:21,642 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:26:21,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 01:26:21,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:21,843 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:21,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1786741782, now seen corresponding path program 1 times [2024-11-07 01:26:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:21,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427817212] [2024-11-07 01:26:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:21,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:23,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:23,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427817212] [2024-11-07 01:26:23,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427817212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:26:23,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272553824] [2024-11-07 01:26:23,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:23,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:23,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:26:23,200 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:26:23,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 01:26:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:23,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 01:26:23,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:26:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:25,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:26:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:27,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272553824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:26:27,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:26:27,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 15] total 51 [2024-11-07 01:26:27,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290379438] [2024-11-07 01:26:27,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:26:27,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-07 01:26:27,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:27,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-07 01:26:27,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2308, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 01:26:27,269 INFO L87 Difference]: Start difference. First operand 11582 states and 14911 transitions. Second operand has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:45,234 INFO L93 Difference]: Finished difference Result 21889 states and 27494 transitions. [2024-11-07 01:26:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-07 01:26:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 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 63 [2024-11-07 01:26:45,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:45,266 INFO L225 Difference]: With dead ends: 21889 [2024-11-07 01:26:45,266 INFO L226 Difference]: Without dead ends: 18145 [2024-11-07 01:26:45,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6022 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=4194, Invalid=16398, Unknown=0, NotChecked=0, Total=20592 [2024-11-07 01:26:45,277 INFO L432 NwaCegarLoop]: 1542 mSDtfsCounter, 26255 mSDsluCounter, 26954 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26255 SdHoareTripleChecker+Valid, 28496 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:45,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26255 Valid, 28496 Invalid, 2676 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [134 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:26:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18145 states. [2024-11-07 01:26:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18145 to 14698. [2024-11-07 01:26:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14698 states, 14696 states have (on average 1.2773543821448012) internal successors, (18772), 14697 states have internal predecessors, (18772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14698 states to 14698 states and 18772 transitions. [2024-11-07 01:26:45,901 INFO L78 Accepts]: Start accepts. Automaton has 14698 states and 18772 transitions. Word has length 63 [2024-11-07 01:26:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:45,902 INFO L471 AbstractCegarLoop]: Abstraction has 14698 states and 18772 transitions. [2024-11-07 01:26:45,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 14698 states and 18772 transitions. [2024-11-07 01:26:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-07 01:26:45,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:45,903 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:26:45,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 01:26:46,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:46,104 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:46,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash 532152701, now seen corresponding path program 1 times [2024-11-07 01:26:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:46,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480141999] [2024-11-07 01:26:46,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:47,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480141999] [2024-11-07 01:26:47,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480141999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:26:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755936100] [2024-11-07 01:26:47,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:47,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:47,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:26:47,006 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:26:47,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 01:26:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:47,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 01:26:47,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:26:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:48,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:26:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:48,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755936100] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:26:48,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:26:48,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 34 [2024-11-07 01:26:48,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146820840] [2024-11-07 01:26:48,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:26:48,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-07 01:26:48,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:48,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-07 01:26:48,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 01:26:48,558 INFO L87 Difference]: Start difference. First operand 14698 states and 18772 transitions. Second operand has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:26:51,038 INFO L93 Difference]: Finished difference Result 19558 states and 24698 transitions. [2024-11-07 01:26:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 01:26:51,039 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 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 64 [2024-11-07 01:26:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:26:51,064 INFO L225 Difference]: With dead ends: 19558 [2024-11-07 01:26:51,064 INFO L226 Difference]: Without dead ends: 13811 [2024-11-07 01:26:51,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=822, Invalid=2960, Unknown=0, NotChecked=0, Total=3782 [2024-11-07 01:26:51,076 INFO L432 NwaCegarLoop]: 1517 mSDtfsCounter, 12754 mSDsluCounter, 15702 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12754 SdHoareTripleChecker+Valid, 17219 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:26:51,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12754 Valid, 17219 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:26:51,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13811 states. [2024-11-07 01:26:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13811 to 11693. [2024-11-07 01:26:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11693 states, 11691 states have (on average 1.2872294927722179) internal successors, (15049), 11692 states have internal predecessors, (15049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11693 states to 11693 states and 15049 transitions. [2024-11-07 01:26:51,558 INFO L78 Accepts]: Start accepts. Automaton has 11693 states and 15049 transitions. Word has length 64 [2024-11-07 01:26:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:26:51,559 INFO L471 AbstractCegarLoop]: Abstraction has 11693 states and 15049 transitions. [2024-11-07 01:26:51,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:26:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 11693 states and 15049 transitions. [2024-11-07 01:26:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:26:51,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:26:51,560 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] [2024-11-07 01:26:51,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 01:26:51,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-07 01:26:51,764 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:26:51,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:26:51,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1624666796, now seen corresponding path program 1 times [2024-11-07 01:26:51,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:26:51,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655143486] [2024-11-07 01:26:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:51,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:26:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:53,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:26:53,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655143486] [2024-11-07 01:26:53,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655143486] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:26:53,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625929166] [2024-11-07 01:26:53,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:26:53,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:26:53,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:26:53,385 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:26:53,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 01:26:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:26:53,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 01:26:53,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:26:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:54,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:26:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:26:55,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625929166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:26:55,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:26:55,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 42 [2024-11-07 01:26:55,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932603616] [2024-11-07 01:26:55,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:26:55,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-07 01:26:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:26:55,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-07 01:26:55,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1593, Unknown=0, NotChecked=0, Total=1722 [2024-11-07 01:26:55,010 INFO L87 Difference]: Start difference. First operand 11693 states and 15049 transitions. Second operand has 42 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)