./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.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/bitvector/soft_float_4-2a.c.cil.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', '2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b'] 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/bitvector/soft_float_4-2a.c.cil.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:50:07,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:50:07,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:50:07,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:50:07,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:50:07,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:50:07,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:50:07,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:50:07,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:50:07,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:50:07,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:50:07,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:50:07,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:50:07,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:50:07,984 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:50:07,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:50:07,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:50:07,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:50:07,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:50:07,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:50:07,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:50:07,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:50:07,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:50:07,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:50:07,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:50:07,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:50:07,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:50:07,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:50:07,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:50:07,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:50:07,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:50:07,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:50:07,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:50:07,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:50:07,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:50:07,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:50:07,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:50:07,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:50:07,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:50:07,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:50:07,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:50:07,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:50:07,988 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2024-11-06 18:50:08,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:50:08,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:50:08,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:50:08,220 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:50:08,220 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:50:08,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-06 18:50:09,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:50:09,653 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:50:09,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-06 18:50:09,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56656ab6a/ebcc74ba692c4a188d7988848618eea4/FLAGe838f2496 [2024-11-06 18:50:09,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56656ab6a/ebcc74ba692c4a188d7988848618eea4 [2024-11-06 18:50:09,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:50:09,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:50:09,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:50:09,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:50:09,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:50:09,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:50:09" (1/1) ... [2024-11-06 18:50:09,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc87159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:09, skipping insertion in model container [2024-11-06 18:50:09,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:50:09" (1/1) ... [2024-11-06 18:50:10,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:50:10,134 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/bitvector/soft_float_4-2a.c.cil.c[755,768] [2024-11-06 18:50:10,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:50:10,199 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:50:10,206 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/bitvector/soft_float_4-2a.c.cil.c[755,768] [2024-11-06 18:50:10,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:50:10,243 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:50:10,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10 WrapperNode [2024-11-06 18:50:10,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:50:10,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:50:10,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:50:10,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:50:10,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (1/1) ... [2024-11-06 18:50:10,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (1/1) ... [2024-11-06 18:50:10,271 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-06 18:50:10,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:50:10,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:50:10,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:50:10,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:50:10,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (1/1) ... [2024-11-06 18:50:10,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (1/1) ... [2024-11-06 18:50:10,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (1/1) ... [2024-11-06 18:50:10,293 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-06 18:50:10,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (1/1) ... [2024-11-06 18:50:10,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (1/1) ... [2024-11-06 18:50:10,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (1/1) ... [2024-11-06 18:50:10,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (1/1) ... [2024-11-06 18:50:10,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (1/1) ... [2024-11-06 18:50:10,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (1/1) ... [2024-11-06 18:50:10,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:50:10,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:50:10,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:50:10,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:50:10,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (1/1) ... [2024-11-06 18:50:10,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:50:10,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:10,322 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-06 18:50:10,324 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-06 18:50:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:50:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:50:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-06 18:50:10,339 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-06 18:50:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:50:10,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:50:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-06 18:50:10,339 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-06 18:50:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 18:50:10,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 18:50:10,391 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:50:10,392 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:50:10,617 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-06 18:50:10,617 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:50:10,623 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:50:10,623 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 18:50:10,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:10 BoogieIcfgContainer [2024-11-06 18:50:10,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:50:10,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:50:10,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:50:10,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:50:10,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:50:09" (1/3) ... [2024-11-06 18:50:10,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af3dc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:50:10, skipping insertion in model container [2024-11-06 18:50:10,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:10" (2/3) ... [2024-11-06 18:50:10,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af3dc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:50:10, skipping insertion in model container [2024-11-06 18:50:10,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:10" (3/3) ... [2024-11-06 18:50:10,630 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2024-11-06 18:50:10,639 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:50:10,639 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:50:10,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:50:10,677 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;@77eb3222, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:50:10,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:50:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 66 states have internal predecessors, (98), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 18:50:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-06 18:50:10,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:10,690 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-06 18:50:10,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:10,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:10,694 INFO L85 PathProgramCache]: Analyzing trace with hash 548859888, now seen corresponding path program 1 times [2024-11-06 18:50:10,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:10,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656648835] [2024-11-06 18:50:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:10,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:11,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:11,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656648835] [2024-11-06 18:50:11,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656648835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:11,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657893537] [2024-11-06 18:50:11,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:11,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:11,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:11,153 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-06 18:50:11,154 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-06 18:50:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-06 18:50:11,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:11,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:11,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657893537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:11,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:11,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-06 18:50:11,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632327607] [2024-11-06 18:50:11,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:11,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-06 18:50:11,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:11,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-06 18:50:11,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-06 18:50:11,404 INFO L87 Difference]: Start difference. First operand has 78 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 66 states have internal predecessors, (98), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:11,567 INFO L93 Difference]: Finished difference Result 176 states and 270 transitions. [2024-11-06 18:50:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 18:50:11,569 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2024-11-06 18:50:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:11,573 INFO L225 Difference]: With dead ends: 176 [2024-11-06 18:50:11,574 INFO L226 Difference]: Without dead ends: 95 [2024-11-06 18:50:11,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-06 18:50:11,577 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 25 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:11,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1268 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-06 18:50:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2024-11-06 18:50:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 73 states have internal predecessors, (97), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-06 18:50:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 120 transitions. [2024-11-06 18:50:11,602 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 120 transitions. Word has length 35 [2024-11-06 18:50:11,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:11,603 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 120 transitions. [2024-11-06 18:50:11,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 120 transitions. [2024-11-06 18:50:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 18:50:11,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:11,605 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:11,617 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-06 18:50:11,805 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,SelfDestructingSolverStorable0 [2024-11-06 18:50:11,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:11,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1587358369, now seen corresponding path program 1 times [2024-11-06 18:50:11,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:11,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127035459] [2024-11-06 18:50:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:11,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:11,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127035459] [2024-11-06 18:50:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127035459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:11,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:11,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 18:50:11,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625724394] [2024-11-06 18:50:11,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:11,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:11,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:11,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:11,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:50:11,929 INFO L87 Difference]: Start difference. First operand 87 states and 120 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:11,976 INFO L93 Difference]: Finished difference Result 159 states and 214 transitions. [2024-11-06 18:50:11,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:11,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-06 18:50:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:11,977 INFO L225 Difference]: With dead ends: 159 [2024-11-06 18:50:11,977 INFO L226 Difference]: Without dead ends: 110 [2024-11-06 18:50:11,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:11,978 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 13 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 663 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-06 18:50:11,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 663 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-06 18:50:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-11-06 18:50:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 79 states have internal predecessors, (103), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-06 18:50:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2024-11-06 18:50:11,986 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 39 [2024-11-06 18:50:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:11,986 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2024-11-06 18:50:11,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2024-11-06 18:50:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-06 18:50:11,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:11,988 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-06 18:50:11,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:50:11,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:11,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:11,988 INFO L85 PathProgramCache]: Analyzing trace with hash -831428749, now seen corresponding path program 1 times [2024-11-06 18:50:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:11,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438971175] [2024-11-06 18:50:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:11,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 18:50:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:12,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438971175] [2024-11-06 18:50:12,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438971175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:12,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:12,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 18:50:12,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454422330] [2024-11-06 18:50:12,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:12,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 18:50:12,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:12,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 18:50:12,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:12,139 INFO L87 Difference]: Start difference. First operand 95 states and 128 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:12,220 INFO L93 Difference]: Finished difference Result 178 states and 241 transitions. [2024-11-06 18:50:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:50:12,221 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-11-06 18:50:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:12,222 INFO L225 Difference]: With dead ends: 178 [2024-11-06 18:50:12,222 INFO L226 Difference]: Without dead ends: 138 [2024-11-06 18:50:12,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:50:12,223 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 85 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:12,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 781 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-06 18:50:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2024-11-06 18:50:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 110 states have internal predecessors, (146), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-06 18:50:12,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2024-11-06 18:50:12,232 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 43 [2024-11-06 18:50:12,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:12,233 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2024-11-06 18:50:12,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:12,233 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2024-11-06 18:50:12,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-06 18:50:12,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:12,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-06 18:50:12,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:50:12,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:12,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:12,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1224455759, now seen corresponding path program 1 times [2024-11-06 18:50:12,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:12,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806078346] [2024-11-06 18:50:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:12,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 18:50:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:12,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:12,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806078346] [2024-11-06 18:50:12,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806078346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:12,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519740546] [2024-11-06 18:50:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:12,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:12,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:12,346 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-06 18:50:12,347 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-06 18:50:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 18:50:12,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:12,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:12,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519740546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:12,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:12,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-06 18:50:12,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875504223] [2024-11-06 18:50:12,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:12,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 18:50:12,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:12,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 18:50:12,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:12,534 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 18:50:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:12,603 INFO L93 Difference]: Finished difference Result 224 states and 304 transitions. [2024-11-06 18:50:12,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:12,604 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2024-11-06 18:50:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:12,605 INFO L225 Difference]: With dead ends: 224 [2024-11-06 18:50:12,605 INFO L226 Difference]: Without dead ends: 153 [2024-11-06 18:50:12,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:50:12,606 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 17 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:12,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 982 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-06 18:50:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2024-11-06 18:50:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 117 states have internal predecessors, (153), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2024-11-06 18:50:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 188 transitions. [2024-11-06 18:50:12,622 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 188 transitions. Word has length 43 [2024-11-06 18:50:12,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:12,622 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 188 transitions. [2024-11-06 18:50:12,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 18:50:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 188 transitions. [2024-11-06 18:50:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:12,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:12,627 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-06 18:50:12,644 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-06 18:50:12,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:12,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:12,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash 651525582, now seen corresponding path program 1 times [2024-11-06 18:50:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:12,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039308225] [2024-11-06 18:50:12,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 18:50:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 18:50:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:13,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:13,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039308225] [2024-11-06 18:50:13,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039308225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:13,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:13,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-06 18:50:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220484731] [2024-11-06 18:50:13,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:13,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-06 18:50:13,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:13,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-06 18:50:13,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:50:13,218 INFO L87 Difference]: Start difference. First operand 140 states and 188 transitions. Second operand has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-06 18:50:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:13,412 INFO L93 Difference]: Finished difference Result 203 states and 270 transitions. [2024-11-06 18:50:13,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 18:50:13,412 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2024-11-06 18:50:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:13,413 INFO L225 Difference]: With dead ends: 203 [2024-11-06 18:50:13,413 INFO L226 Difference]: Without dead ends: 195 [2024-11-06 18:50:13,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-06 18:50:13,414 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 52 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:13,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1479 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-06 18:50:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2024-11-06 18:50:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.319327731092437) internal successors, (157), 120 states have internal predecessors, (157), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (20), 17 states have call predecessors, (20), 16 states have call successors, (20) [2024-11-06 18:50:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 194 transitions. [2024-11-06 18:50:13,433 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 194 transitions. Word has length 44 [2024-11-06 18:50:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:13,433 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 194 transitions. [2024-11-06 18:50:13,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-06 18:50:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 194 transitions. [2024-11-06 18:50:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-06 18:50:13,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:13,436 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:13,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:50:13,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:13,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash 35658448, now seen corresponding path program 2 times [2024-11-06 18:50:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:13,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013681300] [2024-11-06 18:50:13,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:13,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:13,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013681300] [2024-11-06 18:50:13,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013681300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:13,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168589579] [2024-11-06 18:50:13,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:50:13,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:13,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:13,577 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-06 18:50:13,582 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-06 18:50:13,627 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 18:50:13,628 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:50:13,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-06 18:50:13,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:13,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:13,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168589579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:13,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:13,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2024-11-06 18:50:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021139186] [2024-11-06 18:50:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:13,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 18:50:13,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 18:50:13,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-06 18:50:13,737 INFO L87 Difference]: Start difference. First operand 145 states and 194 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:13,917 INFO L93 Difference]: Finished difference Result 286 states and 386 transitions. [2024-11-06 18:50:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 18:50:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-06 18:50:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:13,919 INFO L225 Difference]: With dead ends: 286 [2024-11-06 18:50:13,919 INFO L226 Difference]: Without dead ends: 229 [2024-11-06 18:50:13,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-06 18:50:13,920 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 113 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:13,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1294 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-06 18:50:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 192. [2024-11-06 18:50:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 159 states have (on average 1.3144654088050314) internal successors, (209), 161 states have internal predecessors, (209), 21 states have call successors, (21), 9 states have call predecessors, (21), 11 states have return successors, (28), 21 states have call predecessors, (28), 20 states have call successors, (28) [2024-11-06 18:50:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 258 transitions. [2024-11-06 18:50:13,930 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 258 transitions. Word has length 43 [2024-11-06 18:50:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:13,930 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 258 transitions. [2024-11-06 18:50:13,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 258 transitions. [2024-11-06 18:50:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-06 18:50:13,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:13,932 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:13,944 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-06 18:50:14,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:14,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:14,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash -357368562, now seen corresponding path program 1 times [2024-11-06 18:50:14,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:14,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522296245] [2024-11-06 18:50:14,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:14,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:14,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522296245] [2024-11-06 18:50:14,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522296245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:14,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546527713] [2024-11-06 18:50:14,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:14,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:14,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:14,280 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-06 18:50:14,281 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-06 18:50:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-06 18:50:14,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:14,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:14,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546527713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:14,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:14,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 17 [2024-11-06 18:50:14,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245920787] [2024-11-06 18:50:14,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:14,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 18:50:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:14,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 18:50:14,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:50:14,456 INFO L87 Difference]: Start difference. First operand 192 states and 258 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:14,621 INFO L93 Difference]: Finished difference Result 359 states and 491 transitions. [2024-11-06 18:50:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 18:50:14,621 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-06 18:50:14,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:14,623 INFO L225 Difference]: With dead ends: 359 [2024-11-06 18:50:14,623 INFO L226 Difference]: Without dead ends: 284 [2024-11-06 18:50:14,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-06 18:50:14,624 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 68 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:14,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1576 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-06 18:50:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 266. [2024-11-06 18:50:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 223 states have (on average 1.3139013452914798) internal successors, (293), 225 states have internal predecessors, (293), 28 states have call successors, (28), 12 states have call predecessors, (28), 14 states have return successors, (37), 28 states have call predecessors, (37), 27 states have call successors, (37) [2024-11-06 18:50:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 358 transitions. [2024-11-06 18:50:14,637 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 358 transitions. Word has length 43 [2024-11-06 18:50:14,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:14,637 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 358 transitions. [2024-11-06 18:50:14,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 358 transitions. [2024-11-06 18:50:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-06 18:50:14,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:14,638 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-06 18:50:14,651 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-06 18:50:14,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-06 18:50:14,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:14,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:14,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1300765906, now seen corresponding path program 1 times [2024-11-06 18:50:14,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:14,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820125440] [2024-11-06 18:50:14,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:14,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 18:50:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 18:50:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-06 18:50:14,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820125440] [2024-11-06 18:50:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820125440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:14,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:14,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:14,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541001499] [2024-11-06 18:50:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:14,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:14,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:14,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:14,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:14,890 INFO L87 Difference]: Start difference. First operand 266 states and 358 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 18:50:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:14,914 INFO L93 Difference]: Finished difference Result 274 states and 365 transitions. [2024-11-06 18:50:14,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:14,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2024-11-06 18:50:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:14,916 INFO L225 Difference]: With dead ends: 274 [2024-11-06 18:50:14,916 INFO L226 Difference]: Without dead ends: 259 [2024-11-06 18:50:14,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:14,917 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 3 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:14,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 487 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-06 18:50:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-11-06 18:50:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 218 states have (on average 1.31651376146789) internal successors, (287), 221 states have internal predecessors, (287), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (34), 25 states have call predecessors, (34), 25 states have call successors, (34) [2024-11-06 18:50:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 347 transitions. [2024-11-06 18:50:14,927 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 347 transitions. Word has length 46 [2024-11-06 18:50:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:14,927 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 347 transitions. [2024-11-06 18:50:14,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 18:50:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 347 transitions. [2024-11-06 18:50:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-06 18:50:14,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:14,928 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:14,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 18:50:14,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:14,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1312921885, now seen corresponding path program 1 times [2024-11-06 18:50:14,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:14,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920224634] [2024-11-06 18:50:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 18:50:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:14,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:14,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920224634] [2024-11-06 18:50:14,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920224634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:14,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562718658] [2024-11-06 18:50:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:14,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:14,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:14,965 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-06 18:50:14,966 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-06 18:50:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:50:15,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 18:50:15,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:15,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562718658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:15,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:15,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-06 18:50:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147965348] [2024-11-06 18:50:15,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:15,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:50:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:50:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:15,018 INFO L87 Difference]: Start difference. First operand 259 states and 347 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:15,051 INFO L93 Difference]: Finished difference Result 520 states and 701 transitions. [2024-11-06 18:50:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:50:15,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-06 18:50:15,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:15,053 INFO L225 Difference]: With dead ends: 520 [2024-11-06 18:50:15,053 INFO L226 Difference]: Without dead ends: 264 [2024-11-06 18:50:15,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:15,054 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:15,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 179 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-06 18:50:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2024-11-06 18:50:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 221 states have (on average 1.3167420814479638) internal successors, (291), 224 states have internal predecessors, (291), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (34), 25 states have call predecessors, (34), 25 states have call successors, (34) [2024-11-06 18:50:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 351 transitions. [2024-11-06 18:50:15,066 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 351 transitions. Word has length 46 [2024-11-06 18:50:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:15,066 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 351 transitions. [2024-11-06 18:50:15,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 351 transitions. [2024-11-06 18:50:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 18:50:15,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:15,068 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:15,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:15,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:15,268 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:15,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:15,269 INFO L85 PathProgramCache]: Analyzing trace with hash -576237536, now seen corresponding path program 1 times [2024-11-06 18:50:15,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:15,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276262090] [2024-11-06 18:50:15,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:15,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-06 18:50:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:15,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276262090] [2024-11-06 18:50:15,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276262090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:15,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:15,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 18:50:15,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769850340] [2024-11-06 18:50:15,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:15,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 18:50:15,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:15,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 18:50:15,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:15,377 INFO L87 Difference]: Start difference. First operand 262 states and 351 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:15,426 INFO L93 Difference]: Finished difference Result 281 states and 371 transitions. [2024-11-06 18:50:15,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:50:15,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2024-11-06 18:50:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:15,428 INFO L225 Difference]: With dead ends: 281 [2024-11-06 18:50:15,428 INFO L226 Difference]: Without dead ends: 241 [2024-11-06 18:50:15,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:50:15,429 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 11 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:15,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 766 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-06 18:50:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2024-11-06 18:50:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 196 states have (on average 1.3010204081632653) internal successors, (255), 199 states have internal predecessors, (255), 24 states have call successors, (24), 12 states have call predecessors, (24), 14 states have return successors, (32), 23 states have call predecessors, (32), 23 states have call successors, (32) [2024-11-06 18:50:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 311 transitions. [2024-11-06 18:50:15,437 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 311 transitions. Word has length 47 [2024-11-06 18:50:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:15,437 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 311 transitions. [2024-11-06 18:50:15,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 311 transitions. [2024-11-06 18:50:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:15,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:15,438 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:15,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 18:50:15,439 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:15,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:15,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2068784251, now seen corresponding path program 1 times [2024-11-06 18:50:15,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:15,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680291402] [2024-11-06 18:50:15,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:15,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-06 18:50:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-06 18:50:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:15,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680291402] [2024-11-06 18:50:15,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680291402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074206355] [2024-11-06 18:50:15,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:15,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:15,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:15,584 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-06 18:50:15,588 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-06 18:50:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-06 18:50:15,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-06 18:50:15,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:16,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074206355] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:16,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:16,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-06 18:50:16,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125592370] [2024-11-06 18:50:16,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:16,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-06 18:50:16,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:16,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-06 18:50:16,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-06 18:50:16,047 INFO L87 Difference]: Start difference. First operand 235 states and 311 transitions. Second operand has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-06 18:50:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:17,380 INFO L93 Difference]: Finished difference Result 456 states and 636 transitions. [2024-11-06 18:50:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-06 18:50:17,381 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2024-11-06 18:50:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:17,383 INFO L225 Difference]: With dead ends: 456 [2024-11-06 18:50:17,383 INFO L226 Difference]: Without dead ends: 431 [2024-11-06 18:50:17,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2024-11-06 18:50:17,386 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 241 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 4380 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:17,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 4380 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 18:50:17,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-06 18:50:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 286. [2024-11-06 18:50:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 245 states have internal predecessors, (304), 29 states have call successors, (29), 11 states have call predecessors, (29), 19 states have return successors, (49), 29 states have call predecessors, (49), 28 states have call successors, (49) [2024-11-06 18:50:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 382 transitions. [2024-11-06 18:50:17,416 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 382 transitions. Word has length 48 [2024-11-06 18:50:17,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:17,416 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 382 transitions. [2024-11-06 18:50:17,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-06 18:50:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 382 transitions. [2024-11-06 18:50:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 18:50:17,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:17,418 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:17,430 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-06 18:50:17,619 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,SelfDestructingSolverStorable10 [2024-11-06 18:50:17,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:17,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:17,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2092939753, now seen corresponding path program 1 times [2024-11-06 18:50:17,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:17,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030081394] [2024-11-06 18:50:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:17,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 18:50:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:17,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030081394] [2024-11-06 18:50:17,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030081394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778965609] [2024-11-06 18:50:17,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:17,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:17,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:17,695 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-06 18:50:17,697 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-06 18:50:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:50:17,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 18:50:17,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:17,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778965609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:17,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:17,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-06 18:50:17,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624283590] [2024-11-06 18:50:17,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:17,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:50:17,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:17,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:50:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:50:17,743 INFO L87 Difference]: Start difference. First operand 286 states and 382 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:17,775 INFO L93 Difference]: Finished difference Result 575 states and 773 transitions. [2024-11-06 18:50:17,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:50:17,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-11-06 18:50:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:17,777 INFO L225 Difference]: With dead ends: 575 [2024-11-06 18:50:17,777 INFO L226 Difference]: Without dead ends: 292 [2024-11-06 18:50:17,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:50:17,778 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 5 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:17,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 182 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-06 18:50:17,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2024-11-06 18:50:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 239 states have (on average 1.2803347280334727) internal successors, (306), 247 states have internal predecessors, (306), 29 states have call successors, (29), 11 states have call predecessors, (29), 19 states have return successors, (49), 29 states have call predecessors, (49), 28 states have call successors, (49) [2024-11-06 18:50:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2024-11-06 18:50:17,789 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 47 [2024-11-06 18:50:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:17,789 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2024-11-06 18:50:17,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2024-11-06 18:50:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:17,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:17,790 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:17,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-06 18:50:17,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:17,991 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:17,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:17,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1429610563, now seen corresponding path program 2 times [2024-11-06 18:50:17,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:17,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992924491] [2024-11-06 18:50:17,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:17,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-06 18:50:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-06 18:50:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:18,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992924491] [2024-11-06 18:50:18,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992924491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582322882] [2024-11-06 18:50:18,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:50:18,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:18,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:18,141 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:18,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-06 18:50:18,185 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 18:50:18,185 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:50:18,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-06 18:50:18,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-06 18:50:18,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:18,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582322882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:18,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:18,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-06 18:50:18,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804638835] [2024-11-06 18:50:18,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:18,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-06 18:50:18,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:18,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-06 18:50:18,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-06 18:50:18,634 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand has 32 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 25 states have internal predecessors, (51), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-06 18:50:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:19,733 INFO L93 Difference]: Finished difference Result 472 states and 674 transitions. [2024-11-06 18:50:19,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-06 18:50:19,733 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 25 states have internal predecessors, (51), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 48 [2024-11-06 18:50:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:19,736 INFO L225 Difference]: With dead ends: 472 [2024-11-06 18:50:19,736 INFO L226 Difference]: Without dead ends: 459 [2024-11-06 18:50:19,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=295, Invalid=3245, Unknown=0, NotChecked=0, Total=3540 [2024-11-06 18:50:19,738 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 278 mSDsluCounter, 3492 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 3697 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:19,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 3697 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:50:19,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-06 18:50:19,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 301. [2024-11-06 18:50:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 247 states have (on average 1.271255060728745) internal successors, (314), 255 states have internal predecessors, (314), 33 states have call successors, (33), 12 states have call predecessors, (33), 20 states have return successors, (63), 33 states have call predecessors, (63), 32 states have call successors, (63) [2024-11-06 18:50:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 410 transitions. [2024-11-06 18:50:19,757 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 410 transitions. Word has length 48 [2024-11-06 18:50:19,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:19,757 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 410 transitions. [2024-11-06 18:50:19,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 25 states have internal predecessors, (51), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-06 18:50:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 410 transitions. [2024-11-06 18:50:19,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:19,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:19,758 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:19,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-06 18:50:19,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:19,962 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:19,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:19,963 INFO L85 PathProgramCache]: Analyzing trace with hash 548709926, now seen corresponding path program 1 times [2024-11-06 18:50:19,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:19,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051951018] [2024-11-06 18:50:19,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:19,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:20,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:20,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051951018] [2024-11-06 18:50:20,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051951018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:20,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:20,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 18:50:20,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233128593] [2024-11-06 18:50:20,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:20,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 18:50:20,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:20,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 18:50:20,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:20,112 INFO L87 Difference]: Start difference. First operand 301 states and 410 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:20,198 INFO L93 Difference]: Finished difference Result 476 states and 650 transitions. [2024-11-06 18:50:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:50:20,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-06 18:50:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:20,201 INFO L225 Difference]: With dead ends: 476 [2024-11-06 18:50:20,201 INFO L226 Difference]: Without dead ends: 312 [2024-11-06 18:50:20,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:50:20,204 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 60 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:20,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 878 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-06 18:50:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 301. [2024-11-06 18:50:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 247 states have (on average 1.263157894736842) internal successors, (312), 255 states have internal predecessors, (312), 33 states have call successors, (33), 12 states have call predecessors, (33), 20 states have return successors, (63), 33 states have call predecessors, (63), 32 states have call successors, (63) [2024-11-06 18:50:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 408 transitions. [2024-11-06 18:50:20,224 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 408 transitions. Word has length 48 [2024-11-06 18:50:20,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:20,224 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 408 transitions. [2024-11-06 18:50:20,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 408 transitions. [2024-11-06 18:50:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:20,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:20,225 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:20,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 18:50:20,225 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:20,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash 317586600, now seen corresponding path program 1 times [2024-11-06 18:50:20,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:20,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336305402] [2024-11-06 18:50:20,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:20,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:20,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:20,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336305402] [2024-11-06 18:50:20,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336305402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:20,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110119303] [2024-11-06 18:50:20,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:20,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:20,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:20,321 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:20,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-06 18:50:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-06 18:50:20,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:20,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:20,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110119303] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:20,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:20,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2024-11-06 18:50:20,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979442987] [2024-11-06 18:50:20,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:20,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-06 18:50:20,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:20,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-06 18:50:20,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:50:20,541 INFO L87 Difference]: Start difference. First operand 301 states and 408 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:20,714 INFO L93 Difference]: Finished difference Result 439 states and 591 transitions. [2024-11-06 18:50:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 18:50:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2024-11-06 18:50:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:20,718 INFO L225 Difference]: With dead ends: 439 [2024-11-06 18:50:20,718 INFO L226 Difference]: Without dead ends: 365 [2024-11-06 18:50:20,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-06 18:50:20,720 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 96 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:20,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1288 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-06 18:50:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 345. [2024-11-06 18:50:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 285 states have (on average 1.2666666666666666) internal successors, (361), 295 states have internal predecessors, (361), 35 states have call successors, (35), 14 states have call predecessors, (35), 24 states have return successors, (64), 35 states have call predecessors, (64), 34 states have call successors, (64) [2024-11-06 18:50:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 460 transitions. [2024-11-06 18:50:20,742 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 460 transitions. Word has length 48 [2024-11-06 18:50:20,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:20,742 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 460 transitions. [2024-11-06 18:50:20,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 460 transitions. [2024-11-06 18:50:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:20,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:20,743 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:20,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:20,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:20,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:20,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash -75440410, now seen corresponding path program 2 times [2024-11-06 18:50:20,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:20,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133395450] [2024-11-06 18:50:20,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:20,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:21,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:21,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133395450] [2024-11-06 18:50:21,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133395450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:21,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117917274] [2024-11-06 18:50:21,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:50:21,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:21,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:21,064 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:21,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-06 18:50:21,115 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 18:50:21,116 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:50:21,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 18:50:21,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:22,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:22,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117917274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:22,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:22,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 21 [2024-11-06 18:50:22,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254159934] [2024-11-06 18:50:22,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:22,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 18:50:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:22,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 18:50:22,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2024-11-06 18:50:22,165 INFO L87 Difference]: Start difference. First operand 345 states and 460 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:22,674 INFO L93 Difference]: Finished difference Result 480 states and 649 transitions. [2024-11-06 18:50:22,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 18:50:22,675 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-06 18:50:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:22,676 INFO L225 Difference]: With dead ends: 480 [2024-11-06 18:50:22,677 INFO L226 Difference]: Without dead ends: 478 [2024-11-06 18:50:22,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-11-06 18:50:22,677 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 74 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:22,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1463 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:50:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-06 18:50:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 440. [2024-11-06 18:50:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 366 states have (on average 1.278688524590164) internal successors, (468), 381 states have internal predecessors, (468), 42 states have call successors, (42), 17 states have call predecessors, (42), 31 states have return successors, (79), 41 states have call predecessors, (79), 41 states have call successors, (79) [2024-11-06 18:50:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 589 transitions. [2024-11-06 18:50:22,703 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 589 transitions. Word has length 48 [2024-11-06 18:50:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:22,703 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 589 transitions. [2024-11-06 18:50:22,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2024-11-06 18:50:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:22,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:22,704 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:22,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:22,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-06 18:50:22,905 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:22,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2139626181, now seen corresponding path program 1 times [2024-11-06 18:50:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305314689] [2024-11-06 18:50:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-06 18:50:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-06 18:50:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-06 18:50:23,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:23,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305314689] [2024-11-06 18:50:23,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305314689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:23,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561802851] [2024-11-06 18:50:23,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:23,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:23,042 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:23,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-06 18:50:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:23,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-06 18:50:23,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-06 18:50:23,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:23,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561802851] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:23,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:23,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 21 [2024-11-06 18:50:23,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952716540] [2024-11-06 18:50:23,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:23,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-06 18:50:23,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:23,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-06 18:50:23,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-06 18:50:23,409 INFO L87 Difference]: Start difference. First operand 440 states and 589 transitions. Second operand has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-06 18:50:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:24,012 INFO L93 Difference]: Finished difference Result 570 states and 790 transitions. [2024-11-06 18:50:24,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-06 18:50:24,013 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 50 [2024-11-06 18:50:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:24,015 INFO L225 Difference]: With dead ends: 570 [2024-11-06 18:50:24,015 INFO L226 Difference]: Without dead ends: 532 [2024-11-06 18:50:24,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2024-11-06 18:50:24,016 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 208 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:24,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1390 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:50:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-06 18:50:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 445. [2024-11-06 18:50:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 369 states have (on average 1.2764227642276422) internal successors, (471), 386 states have internal predecessors, (471), 43 states have call successors, (43), 15 states have call predecessors, (43), 32 states have return successors, (93), 43 states have call predecessors, (93), 42 states have call successors, (93) [2024-11-06 18:50:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 607 transitions. [2024-11-06 18:50:24,056 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 607 transitions. Word has length 50 [2024-11-06 18:50:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:24,056 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 607 transitions. [2024-11-06 18:50:24,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-06 18:50:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 607 transitions. [2024-11-06 18:50:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 18:50:24,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:24,057 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:24,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-06 18:50:24,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-06 18:50:24,259 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:24,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:24,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1494153441, now seen corresponding path program 1 times [2024-11-06 18:50:24,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:24,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825891610] [2024-11-06 18:50:24,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:24,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:24,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:24,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:50:24,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:24,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825891610] [2024-11-06 18:50:24,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825891610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:24,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:24,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 18:50:24,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447068003] [2024-11-06 18:50:24,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:24,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 18:50:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:24,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 18:50:24,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:24,392 INFO L87 Difference]: Start difference. First operand 445 states and 607 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:24,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:24,452 INFO L93 Difference]: Finished difference Result 451 states and 612 transitions. [2024-11-06 18:50:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 18:50:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-06 18:50:24,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:24,456 INFO L225 Difference]: With dead ends: 451 [2024-11-06 18:50:24,457 INFO L226 Difference]: Without dead ends: 449 [2024-11-06 18:50:24,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:24,457 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:24,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 526 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-06 18:50:24,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2024-11-06 18:50:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 372 states have (on average 1.2741935483870968) internal successors, (474), 389 states have internal predecessors, (474), 43 states have call successors, (43), 16 states have call predecessors, (43), 33 states have return successors, (93), 43 states have call predecessors, (93), 42 states have call successors, (93) [2024-11-06 18:50:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 610 transitions. [2024-11-06 18:50:24,498 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 610 transitions. Word has length 49 [2024-11-06 18:50:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:24,498 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 610 transitions. [2024-11-06 18:50:24,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 610 transitions. [2024-11-06 18:50:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 18:50:24,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:24,500 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-06 18:50:24,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 18:50:24,500 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:24,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:24,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1700071189, now seen corresponding path program 1 times [2024-11-06 18:50:24,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:24,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117339312] [2024-11-06 18:50:24,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:24,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:24,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:24,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:24,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 18:50:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:24,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 18:50:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:24,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:24,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117339312] [2024-11-06 18:50:24,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117339312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:24,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437792287] [2024-11-06 18:50:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:24,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:24,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:24,708 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:24,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-06 18:50:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:24,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-06 18:50:24,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:24,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:25,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437792287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:25,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:25,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-06 18:50:25,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914374551] [2024-11-06 18:50:25,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:25,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-06 18:50:25,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:25,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-06 18:50:25,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2024-11-06 18:50:25,047 INFO L87 Difference]: Start difference. First operand 449 states and 610 transitions. Second operand has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 18:50:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:25,516 INFO L93 Difference]: Finished difference Result 535 states and 743 transitions. [2024-11-06 18:50:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-06 18:50:25,516 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2024-11-06 18:50:25,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:25,518 INFO L225 Difference]: With dead ends: 535 [2024-11-06 18:50:25,518 INFO L226 Difference]: Without dead ends: 503 [2024-11-06 18:50:25,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-11-06 18:50:25,519 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 207 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:25,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 2021 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:50:25,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-06 18:50:25,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 438. [2024-11-06 18:50:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 364 states have (on average 1.2802197802197801) internal successors, (466), 381 states have internal predecessors, (466), 41 states have call successors, (41), 14 states have call predecessors, (41), 32 states have return successors, (89), 42 states have call predecessors, (89), 40 states have call successors, (89) [2024-11-06 18:50:25,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 596 transitions. [2024-11-06 18:50:25,538 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 596 transitions. Word has length 55 [2024-11-06 18:50:25,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:25,539 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 596 transitions. [2024-11-06 18:50:25,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 18:50:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 596 transitions. [2024-11-06 18:50:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 18:50:25,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:25,540 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-06 18:50:25,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-06 18:50:25,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:25,743 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:25,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1025276331, now seen corresponding path program 2 times [2024-11-06 18:50:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:25,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937799559] [2024-11-06 18:50:25,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:25,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:25,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:25,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:25,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-06 18:50:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 18:50:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:25,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:25,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937799559] [2024-11-06 18:50:25,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937799559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:25,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569836339] [2024-11-06 18:50:25,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:50:25,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:25,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:25,888 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:25,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-06 18:50:25,941 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 18:50:25,941 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:50:25,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-06 18:50:25,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:26,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:26,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569836339] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:26,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:26,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2024-11-06 18:50:26,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016741537] [2024-11-06 18:50:26,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:26,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-06 18:50:26,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:26,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-06 18:50:26,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2024-11-06 18:50:26,361 INFO L87 Difference]: Start difference. First operand 438 states and 596 transitions. Second operand has 29 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 24 states have internal predecessors, (58), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 18:50:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:26,840 INFO L93 Difference]: Finished difference Result 523 states and 731 transitions. [2024-11-06 18:50:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-06 18:50:26,840 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 24 states have internal predecessors, (58), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) Word has length 55 [2024-11-06 18:50:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:26,842 INFO L225 Difference]: With dead ends: 523 [2024-11-06 18:50:26,842 INFO L226 Difference]: Without dead ends: 493 [2024-11-06 18:50:26,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2024-11-06 18:50:26,843 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 128 mSDsluCounter, 2559 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:26,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2687 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:50:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-06 18:50:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 430. [2024-11-06 18:50:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 357 states have (on average 1.2857142857142858) internal successors, (459), 376 states have internal predecessors, (459), 40 states have call successors, (40), 12 states have call predecessors, (40), 32 states have return successors, (88), 41 states have call predecessors, (88), 39 states have call successors, (88) [2024-11-06 18:50:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 587 transitions. [2024-11-06 18:50:26,887 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 587 transitions. Word has length 55 [2024-11-06 18:50:26,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:26,888 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 587 transitions. [2024-11-06 18:50:26,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 24 states have internal predecessors, (58), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 18:50:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 587 transitions. [2024-11-06 18:50:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 18:50:26,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:26,889 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-06 18:50:26,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-06 18:50:27,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:27,090 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:27,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:27,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1682588005, now seen corresponding path program 1 times [2024-11-06 18:50:27,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:27,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175969584] [2024-11-06 18:50:27,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:27,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-06 18:50:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:27,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:27,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175969584] [2024-11-06 18:50:27,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175969584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:27,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:27,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 18:50:27,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754956333] [2024-11-06 18:50:27,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:27,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:50:27,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:27,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:50:27,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:27,187 INFO L87 Difference]: Start difference. First operand 430 states and 587 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:27,268 INFO L93 Difference]: Finished difference Result 485 states and 670 transitions. [2024-11-06 18:50:27,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:50:27,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2024-11-06 18:50:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:27,274 INFO L225 Difference]: With dead ends: 485 [2024-11-06 18:50:27,274 INFO L226 Difference]: Without dead ends: 483 [2024-11-06 18:50:27,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:27,275 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 11 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:27,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 364 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-06 18:50:27,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 455. [2024-11-06 18:50:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 374 states have (on average 1.3101604278074865) internal successors, (490), 400 states have internal predecessors, (490), 47 states have call successors, (47), 13 states have call predecessors, (47), 33 states have return successors, (95), 41 states have call predecessors, (95), 46 states have call successors, (95) [2024-11-06 18:50:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 632 transitions. [2024-11-06 18:50:27,321 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 632 transitions. Word has length 57 [2024-11-06 18:50:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:27,321 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 632 transitions. [2024-11-06 18:50:27,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 632 transitions. [2024-11-06 18:50:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 18:50:27,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:27,322 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:27,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 18:50:27,322 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:27,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:27,322 INFO L85 PathProgramCache]: Analyzing trace with hash 712762254, now seen corresponding path program 1 times [2024-11-06 18:50:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:27,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952397686] [2024-11-06 18:50:27,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-06 18:50:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:27,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:27,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952397686] [2024-11-06 18:50:27,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952397686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:27,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231628966] [2024-11-06 18:50:27,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:27,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:27,423 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:27,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-06 18:50:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 18:50:27,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:27,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231628966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:27,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:27,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-11-06 18:50:27,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705321017] [2024-11-06 18:50:27,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:27,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-06 18:50:27,509 INFO L87 Difference]: Start difference. First operand 455 states and 632 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:27,586 INFO L93 Difference]: Finished difference Result 809 states and 1123 transitions. [2024-11-06 18:50:27,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:27,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2024-11-06 18:50:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:27,589 INFO L225 Difference]: With dead ends: 809 [2024-11-06 18:50:27,589 INFO L226 Difference]: Without dead ends: 632 [2024-11-06 18:50:27,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:27,590 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 17 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:27,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 456 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-06 18:50:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 462. [2024-11-06 18:50:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 381 states have (on average 1.304461942257218) internal successors, (497), 407 states have internal predecessors, (497), 47 states have call successors, (47), 13 states have call predecessors, (47), 33 states have return successors, (95), 41 states have call predecessors, (95), 46 states have call successors, (95) [2024-11-06 18:50:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 639 transitions. [2024-11-06 18:50:27,623 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 639 transitions. Word has length 58 [2024-11-06 18:50:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:27,623 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 639 transitions. [2024-11-06 18:50:27,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 639 transitions. [2024-11-06 18:50:27,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-06 18:50:27,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:27,625 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-06 18:50:27,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-06 18:50:27,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-06 18:50:27,826 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:27,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash 377725904, now seen corresponding path program 1 times [2024-11-06 18:50:27,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:27,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43259419] [2024-11-06 18:50:27,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:27,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-06 18:50:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:27,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43259419] [2024-11-06 18:50:27,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43259419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:27,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:27,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582008353] [2024-11-06 18:50:27,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:27,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:27,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:27,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:27,906 INFO L87 Difference]: Start difference. First operand 462 states and 639 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:27,969 INFO L93 Difference]: Finished difference Result 510 states and 708 transitions. [2024-11-06 18:50:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:27,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 59 [2024-11-06 18:50:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:27,972 INFO L225 Difference]: With dead ends: 510 [2024-11-06 18:50:27,972 INFO L226 Difference]: Without dead ends: 508 [2024-11-06 18:50:27,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:27,972 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 10 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:27,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 473 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-06 18:50:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 462. [2024-11-06 18:50:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 381 states have (on average 1.304461942257218) internal successors, (497), 407 states have internal predecessors, (497), 47 states have call successors, (47), 13 states have call predecessors, (47), 33 states have return successors, (95), 41 states have call predecessors, (95), 46 states have call successors, (95) [2024-11-06 18:50:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 639 transitions. [2024-11-06 18:50:27,993 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 639 transitions. Word has length 59 [2024-11-06 18:50:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:27,993 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 639 transitions. [2024-11-06 18:50:27,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 639 transitions. [2024-11-06 18:50:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-06 18:50:27,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:27,994 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-06 18:50:27,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-06 18:50:27,994 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:27,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2040063704, now seen corresponding path program 1 times [2024-11-06 18:50:27,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:27,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912443233] [2024-11-06 18:50:27,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:27,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:28,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:28,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:28,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-06 18:50:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:28,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912443233] [2024-11-06 18:50:28,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912443233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:28,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815557473] [2024-11-06 18:50:28,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:28,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:28,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:28,106 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:28,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-06 18:50:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:28,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-06 18:50:28,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:28,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:28,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815557473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:28,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:28,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 14 [2024-11-06 18:50:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360367524] [2024-11-06 18:50:28,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:28,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 18:50:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:28,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 18:50:28,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:28,211 INFO L87 Difference]: Start difference. First operand 462 states and 639 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-06 18:50:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:28,308 INFO L93 Difference]: Finished difference Result 580 states and 795 transitions. [2024-11-06 18:50:28,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 18:50:28,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2024-11-06 18:50:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:28,310 INFO L225 Difference]: With dead ends: 580 [2024-11-06 18:50:28,310 INFO L226 Difference]: Without dead ends: 478 [2024-11-06 18:50:28,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-06 18:50:28,310 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 62 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:28,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 751 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:28,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-06 18:50:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 462. [2024-11-06 18:50:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 381 states have (on average 1.2992125984251968) internal successors, (495), 407 states have internal predecessors, (495), 47 states have call successors, (47), 13 states have call predecessors, (47), 33 states have return successors, (95), 41 states have call predecessors, (95), 46 states have call successors, (95) [2024-11-06 18:50:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 637 transitions. [2024-11-06 18:50:28,331 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 637 transitions. Word has length 59 [2024-11-06 18:50:28,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:28,331 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 637 transitions. [2024-11-06 18:50:28,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-06 18:50:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 637 transitions. [2024-11-06 18:50:28,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-06 18:50:28,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:28,332 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-06 18:50:28,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-06 18:50:28,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-06 18:50:28,536 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:28,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1200934901, now seen corresponding path program 1 times [2024-11-06 18:50:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:28,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052841348] [2024-11-06 18:50:28,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:28,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 18:50:28,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 18:50:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 18:50:28,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 18:50:28,583 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 18:50:28,584 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:50:28,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-06 18:50:28,587 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:28,610 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:50:28,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:50:28 BoogieIcfgContainer [2024-11-06 18:50:28,613 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:50:28,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:50:28,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:50:28,614 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:50:28,614 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:10" (3/4) ... [2024-11-06 18:50:28,615 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-06 18:50:28,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:50:28,617 INFO L158 Benchmark]: Toolchain (without parser) took 18623.62ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 92.6MB in the beginning and 84.6MB in the end (delta: 7.9MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. [2024-11-06 18:50:28,617 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:28,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.15ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.0MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:50:28,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.61ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:50:28,619 INFO L158 Benchmark]: Boogie Preprocessor took 28.94ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 76.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:28,619 INFO L158 Benchmark]: RCFGBuilder took 322.58ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 57.5MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:50:28,619 INFO L158 Benchmark]: TraceAbstraction took 17988.17ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 56.9MB in the beginning and 84.7MB in the end (delta: -27.8MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2024-11-06 18:50:28,619 INFO L158 Benchmark]: Witness Printer took 2.17ms. Allocated memory is still 243.3MB. Free memory was 84.7MB in the beginning and 84.6MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:28,620 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.15ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.0MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.61ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.94ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 76.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 322.58ms. Allocated memory is still 117.4MB. Free memory was 76.0MB in the beginning and 57.5MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17988.17ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 56.9MB in the beginning and 84.7MB in the end (delta: -27.8MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. * Witness Printer took 2.17ms. Allocated memory is still 243.3MB. Free memory was 84.7MB in the beginning and 84.6MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 114, overapproximation of bitwiseAnd at line 127. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add1 ; [L234] unsigned int r_add2 ; [L235] unsigned int zero ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int __retres14 ; VAL [ea=127, eb=127] [L242] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L242] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=127] [L242] zero = base2flt(0, 0) [L243] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=4328521728] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=4328521728, __retres4=4294967295, m=4328521728] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=4328521728, \result=4294967295, m=4328521728] [L243] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=127, ma=4328521728] [L243] a = base2flt(ma, ea) [L244] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L244] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432] [L244] b = base2flt(mb, eb) [L245] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=4294967295] [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L95] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=127, ma=16777215] [L111] EXPR ma | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=127] [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217, mb=16777215] [L114] EXPR mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217] [L114] mb = mb | (1U << 24U) [L115] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L115] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217, mb=-4278190080] [L116] delta = ea - eb VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, delta=0, ea=127, ma=16777217, mb=-4278190080] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, delta=0, ea=127, ma=16777217, mb=-4278190080] [L118] EXPR mb >> delta VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=16777217] [L118] mb = mb >> delta [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=-4261412863] [L127] ma & (1U << 25U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=-4261412863] [L127] COND FALSE !(ma & (1U << 25U)) [L140] CALL __VERIFIER_assert(ma < 1U << 25U) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L18] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1942 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1804 mSDsluCounter, 30031 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27231 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5890 IncrementalHoareTripleChecker+Invalid, 6135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 2800 mSDtfsCounter, 5890 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1620 GetRequests, 1193 SyntacticMatches, 4 SemanticMatches, 423 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=462occurred in iteration=22, InterpolantAutomatonStates: 322, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 1008 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1945 NumberOfCodeBlocks, 1909 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2219 ConstructedInterpolants, 1 QuantifiedInterpolants, 4985 SizeOfPredicates, 24 NumberOfNonLiveVariables, 2156 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 47 InterpolantComputations, 16 PerfectInterpolantSequences, 777/907 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-06 18:50:28,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/soft_float_4-2a.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:50:30,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:50:30,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 18:50:30,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:50:30,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:50:30,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:50:30,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:50:30,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:50:30,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:50:30,549 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:50:30,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:50:30,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:50:30,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:50:30,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:50:30,549 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:50:30,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:50:30,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:50:30,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:50:30,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:50:30,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:50:30,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:50:30,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:50:30,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:50:30,551 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 18:50:30,551 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 18:50:30,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:50:30,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:50:30,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:50:30,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:50:30,551 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2024-11-06 18:50:30,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:50:30,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:50:30,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:50:30,780 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:50:30,781 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:50:30,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-06 18:50:31,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:50:32,225 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:50:32,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-06 18:50:32,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68fba6d64/614a881f5e5c4754ae464ef8b55d46b0/FLAG9fb23e648 [2024-11-06 18:50:32,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68fba6d64/614a881f5e5c4754ae464ef8b55d46b0 [2024-11-06 18:50:32,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:50:32,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:50:32,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:50:32,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:50:32,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:50:32,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4310bb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32, skipping insertion in model container [2024-11-06 18:50:32,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:50:32,365 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/bitvector/soft_float_4-2a.c.cil.c[755,768] [2024-11-06 18:50:32,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:50:32,431 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:50:32,438 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/bitvector/soft_float_4-2a.c.cil.c[755,768] [2024-11-06 18:50:32,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:50:32,480 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:50:32,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32 WrapperNode [2024-11-06 18:50:32,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:50:32,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:50:32,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:50:32,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:50:32,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,511 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-06 18:50:32,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:50:32,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:50:32,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:50:32,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:50:32,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,535 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-06 18:50:32,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:50:32,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:50:32,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:50:32,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:50:32,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (1/1) ... [2024-11-06 18:50:32,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:50:32,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:32,592 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-06 18:50:32,594 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-06 18:50:32,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:50:32,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 18:50:32,610 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-06 18:50:32,610 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-06 18:50:32,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:50:32,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:50:32,610 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-06 18:50:32,610 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-06 18:50:32,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 18:50:32,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 18:50:32,661 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:50:32,662 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:50:32,809 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-06 18:50:32,810 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:50:32,817 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:50:32,817 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 18:50:32,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:32 BoogieIcfgContainer [2024-11-06 18:50:32,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:50:32,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:50:32,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:50:32,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:50:32,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:50:32" (1/3) ... [2024-11-06 18:50:32,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20351c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:50:32, skipping insertion in model container [2024-11-06 18:50:32,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:32" (2/3) ... [2024-11-06 18:50:32,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20351c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:50:32, skipping insertion in model container [2024-11-06 18:50:32,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:32" (3/3) ... [2024-11-06 18:50:32,825 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2024-11-06 18:50:32,835 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:50:32,835 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:50:32,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:50:32,875 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;@2c0616d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:50:32,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:50:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 42 states have internal predecessors, (61), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 18:50:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 18:50:32,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:32,885 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:32,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:32,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:32,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2030319843, now seen corresponding path program 1 times [2024-11-06 18:50:32,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:32,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147618393] [2024-11-06 18:50:32,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:32,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:32,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:32,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:32,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 18:50:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:32,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 18:50:32,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:33,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:33,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:33,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147618393] [2024-11-06 18:50:33,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147618393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:33,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:33,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 18:50:33,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969257439] [2024-11-06 18:50:33,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:33,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:33,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:33,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:33,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:50:33,141 INFO L87 Difference]: Start difference. First operand has 54 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 42 states have internal predecessors, (61), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:33,252 INFO L93 Difference]: Finished difference Result 125 states and 189 transitions. [2024-11-06 18:50:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:33,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2024-11-06 18:50:33,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:33,258 INFO L225 Difference]: With dead ends: 125 [2024-11-06 18:50:33,258 INFO L226 Difference]: Without dead ends: 68 [2024-11-06 18:50:33,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:33,262 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 14 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:33,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 445 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-06 18:50:33,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2024-11-06 18:50:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 48 states have internal predecessors, (60), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-06 18:50:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2024-11-06 18:50:33,286 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 31 [2024-11-06 18:50:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:33,287 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2024-11-06 18:50:33,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-11-06 18:50:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-06 18:50:33,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:33,288 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:33,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-06 18:50:33,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:33,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:33,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:33,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1468368814, now seen corresponding path program 1 times [2024-11-06 18:50:33,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:33,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029594201] [2024-11-06 18:50:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:33,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:33,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:33,497 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:33,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 18:50:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:33,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 18:50:33,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:33,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:33,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:33,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029594201] [2024-11-06 18:50:33,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029594201] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:33,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:33,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-06 18:50:33,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077321814] [2024-11-06 18:50:33,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:33,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 18:50:33,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:33,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 18:50:33,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:33,637 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:33,720 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2024-11-06 18:50:33,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 18:50:33,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-06 18:50:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:33,722 INFO L225 Difference]: With dead ends: 115 [2024-11-06 18:50:33,722 INFO L226 Difference]: Without dead ends: 87 [2024-11-06 18:50:33,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:50:33,723 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:33,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 477 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:33,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-06 18:50:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2024-11-06 18:50:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 55 states have internal predecessors, (68), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-06 18:50:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2024-11-06 18:50:33,729 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 35 [2024-11-06 18:50:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:33,729 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2024-11-06 18:50:33,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2024-11-06 18:50:33,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 18:50:33,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:33,730 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-06 18:50:33,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-06 18:50:33,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:33,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:33,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:33,933 INFO L85 PathProgramCache]: Analyzing trace with hash -686479404, now seen corresponding path program 1 times [2024-11-06 18:50:33,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:33,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301534762] [2024-11-06 18:50:33,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:33,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:33,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:33,936 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:33,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 18:50:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:33,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 18:50:33,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:34,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:34,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:34,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301534762] [2024-11-06 18:50:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301534762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:34,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:34,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-06 18:50:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327223178] [2024-11-06 18:50:34,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:34,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:34,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:34,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:34,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:50:34,054 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:34,120 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2024-11-06 18:50:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:34,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2024-11-06 18:50:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:34,121 INFO L225 Difference]: With dead ends: 110 [2024-11-06 18:50:34,121 INFO L226 Difference]: Without dead ends: 86 [2024-11-06 18:50:34,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:34,122 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 12 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 446 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-06 18:50:34,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 446 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-06 18:50:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-06 18:50:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.25) internal successors, (75), 62 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-06 18:50:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-11-06 18:50:34,128 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 39 [2024-11-06 18:50:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:34,128 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-11-06 18:50:34,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-11-06 18:50:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 18:50:34,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:34,129 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:34,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-06 18:50:34,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:34,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:34,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:34,332 INFO L85 PathProgramCache]: Analyzing trace with hash 461161469, now seen corresponding path program 2 times [2024-11-06 18:50:34,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:34,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555162751] [2024-11-06 18:50:34,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:50:34,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:34,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:34,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:34,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-06 18:50:34,364 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 18:50:34,364 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:50:34,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 18:50:34,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:34,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:34,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:34,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555162751] [2024-11-06 18:50:34,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555162751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:34,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:34,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:34,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42623414] [2024-11-06 18:50:34,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:34,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:34,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:34,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:34,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:34,443 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:34,504 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2024-11-06 18:50:34,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:34,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-06 18:50:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:34,505 INFO L225 Difference]: With dead ends: 91 [2024-11-06 18:50:34,505 INFO L226 Difference]: Without dead ends: 89 [2024-11-06 18:50:34,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:34,506 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:34,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 309 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-06 18:50:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-06 18:50:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.25) internal successors, (80), 67 states have internal predecessors, (80), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (17), 12 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-06 18:50:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2024-11-06 18:50:34,513 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 39 [2024-11-06 18:50:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:34,513 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2024-11-06 18:50:34,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2024-11-06 18:50:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 18:50:34,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:34,514 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:34,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-06 18:50:34,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:34,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:34,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:34,715 INFO L85 PathProgramCache]: Analyzing trace with hash 518419771, now seen corresponding path program 1 times [2024-11-06 18:50:34,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:34,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167682992] [2024-11-06 18:50:34,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:34,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:34,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:34,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:34,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 18:50:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:34,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 18:50:34,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:34,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:34,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:34,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167682992] [2024-11-06 18:50:34,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167682992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:34,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:34,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522009046] [2024-11-06 18:50:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:34,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:34,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:34,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:34,809 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:34,863 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2024-11-06 18:50:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:34,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-06 18:50:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:34,865 INFO L225 Difference]: With dead ends: 93 [2024-11-06 18:50:34,865 INFO L226 Difference]: Without dead ends: 91 [2024-11-06 18:50:34,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:34,869 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:34,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 304 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:34,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-06 18:50:34,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-11-06 18:50:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 65 states have internal predecessors, (78), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-06 18:50:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2024-11-06 18:50:34,876 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 39 [2024-11-06 18:50:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:34,876 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2024-11-06 18:50:34,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2024-11-06 18:50:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:34,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:34,877 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-06 18:50:34,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-06 18:50:35,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:35,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:35,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:35,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1162622522, now seen corresponding path program 1 times [2024-11-06 18:50:35,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:35,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961204044] [2024-11-06 18:50:35,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:35,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:35,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:35,086 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:35,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 18:50:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:35,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 18:50:35,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-06 18:50:35,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:35,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961204044] [2024-11-06 18:50:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961204044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:35,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:35,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 18:50:35,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769115548] [2024-11-06 18:50:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:35,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 18:50:35,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:35,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 18:50:35,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:50:35,370 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 18:50:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:35,638 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2024-11-06 18:50:35,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 18:50:35,638 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2024-11-06 18:50:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:35,639 INFO L225 Difference]: With dead ends: 124 [2024-11-06 18:50:35,639 INFO L226 Difference]: Without dead ends: 117 [2024-11-06 18:50:35,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-06 18:50:35,640 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:35,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 652 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:50:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-06 18:50:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2024-11-06 18:50:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 76 states have internal predecessors, (91), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2024-11-06 18:50:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2024-11-06 18:50:35,656 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 44 [2024-11-06 18:50:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:35,656 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2024-11-06 18:50:35,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 18:50:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2024-11-06 18:50:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-06 18:50:35,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:35,662 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-06 18:50:35,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:35,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:35,862 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:35,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash -977013140, now seen corresponding path program 1 times [2024-11-06 18:50:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:35,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631853127] [2024-11-06 18:50:35,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:35,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:35,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:35,867 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:35,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-06 18:50:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:35,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 18:50:35,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-06 18:50:35,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-06 18:50:36,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631853127] [2024-11-06 18:50:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631853127] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:36,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2024-11-06 18:50:36,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378817175] [2024-11-06 18:50:36,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:36,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 18:50:36,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:36,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 18:50:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:36,084 INFO L87 Difference]: Start difference. First operand 100 states and 129 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 18:50:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:36,241 INFO L93 Difference]: Finished difference Result 131 states and 169 transitions. [2024-11-06 18:50:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 18:50:36,241 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2024-11-06 18:50:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:36,242 INFO L225 Difference]: With dead ends: 131 [2024-11-06 18:50:36,242 INFO L226 Difference]: Without dead ends: 123 [2024-11-06 18:50:36,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-06 18:50:36,243 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 24 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:36,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 665 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-06 18:50:36,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2024-11-06 18:50:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.216867469879518) internal successors, (101), 84 states have internal predecessors, (101), 17 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (24), 19 states have call predecessors, (24), 16 states have call successors, (24) [2024-11-06 18:50:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 142 transitions. [2024-11-06 18:50:36,253 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 142 transitions. Word has length 46 [2024-11-06 18:50:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:36,253 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 142 transitions. [2024-11-06 18:50:36,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 18:50:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 142 transitions. [2024-11-06 18:50:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-06 18:50:36,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:36,254 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-06 18:50:36,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-06 18:50:36,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:36,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:36,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:36,457 INFO L85 PathProgramCache]: Analyzing trace with hash -919754838, now seen corresponding path program 1 times [2024-11-06 18:50:36,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:36,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553756799] [2024-11-06 18:50:36,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:36,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:36,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:36,461 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:36,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-06 18:50:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:36,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 18:50:36,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-06 18:50:36,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:36,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:36,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553756799] [2024-11-06 18:50:36,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553756799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:36,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:36,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:36,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382879323] [2024-11-06 18:50:36,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:36,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:36,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:36,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:36,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:36,529 INFO L87 Difference]: Start difference. First operand 111 states and 142 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 18:50:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:36,560 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2024-11-06 18:50:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:36,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2024-11-06 18:50:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:36,562 INFO L225 Difference]: With dead ends: 119 [2024-11-06 18:50:36,562 INFO L226 Difference]: Without dead ends: 104 [2024-11-06 18:50:36,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:36,562 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:36,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 312 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-06 18:50:36,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-06 18:50:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (21), 16 states have call predecessors, (21), 14 states have call successors, (21) [2024-11-06 18:50:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2024-11-06 18:50:36,578 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 46 [2024-11-06 18:50:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:36,578 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2024-11-06 18:50:36,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 18:50:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2024-11-06 18:50:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:36,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:36,581 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:36,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:36,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:36,782 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:36,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:36,782 INFO L85 PathProgramCache]: Analyzing trace with hash -168643793, now seen corresponding path program 1 times [2024-11-06 18:50:36,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:36,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558972436] [2024-11-06 18:50:36,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:36,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:36,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:36,784 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:36,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-06 18:50:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:36,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 18:50:36,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:36,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:37,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:37,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558972436] [2024-11-06 18:50:37,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558972436] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:37,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:37,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-06 18:50:37,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599340818] [2024-11-06 18:50:37,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:37,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-06 18:50:37,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:37,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-06 18:50:37,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2024-11-06 18:50:37,206 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 18:50:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:37,949 INFO L93 Difference]: Finished difference Result 146 states and 202 transitions. [2024-11-06 18:50:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-06 18:50:37,950 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 48 [2024-11-06 18:50:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:37,950 INFO L225 Difference]: With dead ends: 146 [2024-11-06 18:50:37,950 INFO L226 Difference]: Without dead ends: 109 [2024-11-06 18:50:37,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=1404, Unknown=0, NotChecked=0, Total=1560 [2024-11-06 18:50:37,952 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 70 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:37,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1102 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:50:37,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-06 18:50:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 86. [2024-11-06 18:50:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (24), 12 states have call predecessors, (24), 11 states have call successors, (24) [2024-11-06 18:50:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2024-11-06 18:50:37,963 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 48 [2024-11-06 18:50:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:37,963 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2024-11-06 18:50:37,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 18:50:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2024-11-06 18:50:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:37,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:37,964 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:37,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-06 18:50:38,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:38,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:38,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash 291178745, now seen corresponding path program 2 times [2024-11-06 18:50:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:38,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068911415] [2024-11-06 18:50:38,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:50:38,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:38,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:38,169 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:38,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-06 18:50:38,215 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 18:50:38,215 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:50:38,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 18:50:38,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:38,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:38,629 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:38,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:38,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068911415] [2024-11-06 18:50:38,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068911415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:38,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:38,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-06 18:50:38,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520498137] [2024-11-06 18:50:38,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:38,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-06 18:50:38,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:38,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-06 18:50:38,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2024-11-06 18:50:38,632 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 18:50:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:39,334 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2024-11-06 18:50:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-06 18:50:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 48 [2024-11-06 18:50:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:39,336 INFO L225 Difference]: With dead ends: 119 [2024-11-06 18:50:39,338 INFO L226 Difference]: Without dead ends: 108 [2024-11-06 18:50:39,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-11-06 18:50:39,339 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 81 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:39,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1207 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:50:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-06 18:50:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2024-11-06 18:50:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 69 states have internal predecessors, (80), 13 states have call successors, (13), 5 states have call predecessors, (13), 9 states have return successors, (27), 13 states have call predecessors, (27), 12 states have call successors, (27) [2024-11-06 18:50:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2024-11-06 18:50:39,352 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 48 [2024-11-06 18:50:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:39,352 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2024-11-06 18:50:39,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 18:50:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-11-06 18:50:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 18:50:39,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:39,353 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:39,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-06 18:50:39,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:39,556 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:39,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash -744862915, now seen corresponding path program 1 times [2024-11-06 18:50:39,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:39,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593534630] [2024-11-06 18:50:39,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:39,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:39,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:39,559 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:39,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-06 18:50:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:39,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 18:50:39,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:43,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:43,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:43,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593534630] [2024-11-06 18:50:43,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593534630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:43,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:43,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 18:50:43,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655973330] [2024-11-06 18:50:43,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:43,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:43,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:43,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:43,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=36, Unknown=1, NotChecked=0, Total=56 [2024-11-06 18:50:43,104 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:43,201 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2024-11-06 18:50:43,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:43,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2024-11-06 18:50:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:43,202 INFO L225 Difference]: With dead ends: 102 [2024-11-06 18:50:43,202 INFO L226 Difference]: Without dead ends: 100 [2024-11-06 18:50:43,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=23, Invalid=48, Unknown=1, NotChecked=0, Total=72 [2024-11-06 18:50:43,203 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 10 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:43,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 354 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-06 18:50:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-11-06 18:50:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 73 states have internal predecessors, (83), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (28), 13 states have call predecessors, (28), 13 states have call successors, (28) [2024-11-06 18:50:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2024-11-06 18:50:43,216 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 49 [2024-11-06 18:50:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:43,216 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2024-11-06 18:50:43,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2024-11-06 18:50:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:43,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:43,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:43,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-06 18:50:43,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:43,417 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:43,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:43,418 INFO L85 PathProgramCache]: Analyzing trace with hash -325172767, now seen corresponding path program 1 times [2024-11-06 18:50:43,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:43,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303341090] [2024-11-06 18:50:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:43,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:43,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:43,421 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:43,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-06 18:50:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:43,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 18:50:43,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:43,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 18:50:43,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:43,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303341090] [2024-11-06 18:50:43,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303341090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:43,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:43,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-06 18:50:43,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167797661] [2024-11-06 18:50:43,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:43,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-06 18:50:43,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-06 18:50:43,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-06 18:50:43,782 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 18:50:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:43,987 INFO L93 Difference]: Finished difference Result 125 states and 172 transitions. [2024-11-06 18:50:43,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 18:50:43,988 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 50 [2024-11-06 18:50:43,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:43,988 INFO L225 Difference]: With dead ends: 125 [2024-11-06 18:50:43,989 INFO L226 Difference]: Without dead ends: 114 [2024-11-06 18:50:43,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-06 18:50:43,989 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 18 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:43,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 714 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-06 18:50:43,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2024-11-06 18:50:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 76 states have internal predecessors, (85), 14 states have call successors, (14), 6 states have call predecessors, (14), 11 states have return successors, (31), 13 states have call predecessors, (31), 13 states have call successors, (31) [2024-11-06 18:50:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2024-11-06 18:50:43,997 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 50 [2024-11-06 18:50:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:43,997 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2024-11-06 18:50:43,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 18:50:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2024-11-06 18:50:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-06 18:50:43,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:43,998 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-06 18:50:44,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:44,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:44,201 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:44,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:44,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1583051783, now seen corresponding path program 1 times [2024-11-06 18:50:44,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:44,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220832564] [2024-11-06 18:50:44,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:44,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:44,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:44,205 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:44,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-06 18:50:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:44,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 18:50:44,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-06 18:50:44,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:44,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:44,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220832564] [2024-11-06 18:50:44,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220832564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:44,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:44,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 18:50:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074023569] [2024-11-06 18:50:44,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:44,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 18:50:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:44,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 18:50:44,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:44,307 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:44,391 INFO L93 Difference]: Finished difference Result 156 states and 196 transitions. [2024-11-06 18:50:44,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 18:50:44,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2024-11-06 18:50:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:44,394 INFO L225 Difference]: With dead ends: 156 [2024-11-06 18:50:44,394 INFO L226 Difference]: Without dead ends: 88 [2024-11-06 18:50:44,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:50:44,395 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:44,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 500 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-06 18:50:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-06 18:50:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.234375) internal successors, (79), 70 states have internal predecessors, (79), 13 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (29), 12 states have call predecessors, (29), 12 states have call successors, (29) [2024-11-06 18:50:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2024-11-06 18:50:44,405 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 54 [2024-11-06 18:50:44,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:44,405 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2024-11-06 18:50:44,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2024-11-06 18:50:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:44,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:44,406 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:50:44,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:44,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:44,606 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:44,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:44,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1846975685, now seen corresponding path program 1 times [2024-11-06 18:50:44,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:44,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734267118] [2024-11-06 18:50:44,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:44,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:44,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:44,610 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:44,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-06 18:50:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:44,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 18:50:44,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:54,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:54,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:54,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734267118] [2024-11-06 18:50:54,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734267118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:54,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:54,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 18:50:54,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014968440] [2024-11-06 18:50:54,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:54,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:54,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:54,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:54,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=37, Unknown=3, NotChecked=0, Total=56 [2024-11-06 18:50:54,849 INFO L87 Difference]: Start difference. First operand 88 states and 121 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:57,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:50:59,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:51:02,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:51:04,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:51:06,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:51:08,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:51:11,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:51:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:12,537 INFO L93 Difference]: Finished difference Result 98 states and 133 transitions. [2024-11-06 18:51:12,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:51:12,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2024-11-06 18:51:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:12,543 INFO L225 Difference]: With dead ends: 98 [2024-11-06 18:51:12,543 INFO L226 Difference]: Without dead ends: 94 [2024-11-06 18:51:12,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=20, Invalid=49, Unknown=3, NotChecked=0, Total=72 [2024-11-06 18:51:12,543 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 8 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:12,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 301 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 7 Unknown, 0 Unchecked, 17.7s Time] [2024-11-06 18:51:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-06 18:51:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2024-11-06 18:51:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (28), 12 states have call predecessors, (28), 11 states have call successors, (28) [2024-11-06 18:51:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-11-06 18:51:12,559 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 50 [2024-11-06 18:51:12,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:12,559 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-11-06 18:51:12,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:51:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-11-06 18:51:12,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-06 18:51:12,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:12,559 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:12,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-06 18:51:12,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:12,760 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:12,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:12,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1592416888, now seen corresponding path program 1 times [2024-11-06 18:51:12,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:12,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767769757] [2024-11-06 18:51:12,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:12,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:12,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:12,763 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:12,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-06 18:51:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:12,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 18:51:12,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 18:51:12,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 18:51:12,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:12,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767769757] [2024-11-06 18:51:12,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767769757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:12,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:12,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-06 18:51:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107014104] [2024-11-06 18:51:12,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:12,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 18:51:12,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:12,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 18:51:12,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:51:12,956 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 18:51:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:13,073 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2024-11-06 18:51:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:51:13,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2024-11-06 18:51:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:13,075 INFO L225 Difference]: With dead ends: 111 [2024-11-06 18:51:13,075 INFO L226 Difference]: Without dead ends: 98 [2024-11-06 18:51:13,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-06 18:51:13,077 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:13,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 433 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:51:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-06 18:51:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-11-06 18:51:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 70 states have internal predecessors, (79), 12 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (31), 12 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-06 18:51:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2024-11-06 18:51:13,083 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 54 [2024-11-06 18:51:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:13,084 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2024-11-06 18:51:13,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 18:51:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2024-11-06 18:51:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-06 18:51:13,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:13,086 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-06 18:51:13,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-06 18:51:13,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:13,289 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:13,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:13,289 INFO L85 PathProgramCache]: Analyzing trace with hash -177633806, now seen corresponding path program 1 times [2024-11-06 18:51:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:13,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716398833] [2024-11-06 18:51:13,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:13,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:13,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:13,292 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:13,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-06 18:51:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:13,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 18:51:13,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 18:51:13,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 18:51:13,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:13,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716398833] [2024-11-06 18:51:13,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716398833] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:13,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:13,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-06 18:51:13,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054809830] [2024-11-06 18:51:13,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:13,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 18:51:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:13,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 18:51:13,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:51:13,501 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 18:51:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:13,615 INFO L93 Difference]: Finished difference Result 111 states and 161 transitions. [2024-11-06 18:51:13,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:51:13,616 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2024-11-06 18:51:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:13,616 INFO L225 Difference]: With dead ends: 111 [2024-11-06 18:51:13,616 INFO L226 Difference]: Without dead ends: 98 [2024-11-06 18:51:13,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:51:13,617 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 21 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:13,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 540 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:51:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-06 18:51:13,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-11-06 18:51:13,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 70 states have internal predecessors, (79), 12 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (30), 12 states have call predecessors, (30), 11 states have call successors, (30) [2024-11-06 18:51:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2024-11-06 18:51:13,628 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 63 [2024-11-06 18:51:13,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:13,629 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2024-11-06 18:51:13,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 18:51:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2024-11-06 18:51:13,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-06 18:51:13,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:13,633 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:13,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-06 18:51:13,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:13,834 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:13,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:13,834 INFO L85 PathProgramCache]: Analyzing trace with hash -378794195, now seen corresponding path program 1 times [2024-11-06 18:51:13,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:13,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918331310] [2024-11-06 18:51:13,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:13,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:13,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:13,837 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:13,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-06 18:51:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:13,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 18:51:13,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 18:51:13,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 18:51:14,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:14,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918331310] [2024-11-06 18:51:14,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918331310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:14,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:14,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-06 18:51:14,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304709402] [2024-11-06 18:51:14,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:14,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 18:51:14,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:14,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 18:51:14,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:51:14,019 INFO L87 Difference]: Start difference. First operand 88 states and 121 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 18:51:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:14,133 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2024-11-06 18:51:14,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:51:14,133 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2024-11-06 18:51:14,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:14,134 INFO L225 Difference]: With dead ends: 109 [2024-11-06 18:51:14,134 INFO L226 Difference]: Without dead ends: 95 [2024-11-06 18:51:14,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-06 18:51:14,135 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:14,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 411 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:51:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-06 18:51:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2024-11-06 18:51:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 67 states have internal predecessors, (76), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (27), 12 states have call predecessors, (27), 11 states have call successors, (27) [2024-11-06 18:51:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2024-11-06 18:51:14,141 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 115 transitions. Word has length 63 [2024-11-06 18:51:14,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:14,141 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 115 transitions. [2024-11-06 18:51:14,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 18:51:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2024-11-06 18:51:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-06 18:51:14,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:14,142 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:51:14,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-06 18:51:14,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:14,345 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:14,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2130957302, now seen corresponding path program 1 times [2024-11-06 18:51:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:14,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6383090] [2024-11-06 18:51:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:14,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:14,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:14,348 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:14,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-06 18:51:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:14,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 18:51:14,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 18:51:14,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 18:51:14,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:14,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6383090] [2024-11-06 18:51:14,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6383090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:14,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:14,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-06 18:51:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032472372] [2024-11-06 18:51:14,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:14,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 18:51:14,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:14,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 18:51:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:51:14,542 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 18:51:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:14,643 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2024-11-06 18:51:14,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:51:14,644 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2024-11-06 18:51:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:14,644 INFO L225 Difference]: With dead ends: 106 [2024-11-06 18:51:14,644 INFO L226 Difference]: Without dead ends: 92 [2024-11-06 18:51:14,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:51:14,645 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 38 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:14,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 507 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:51:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-06 18:51:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2024-11-06 18:51:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 64 states have internal predecessors, (73), 12 states have call successors, (12), 5 states have call predecessors, (12), 8 states have return successors, (25), 12 states have call predecessors, (25), 11 states have call successors, (25) [2024-11-06 18:51:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2024-11-06 18:51:14,656 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 65 [2024-11-06 18:51:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:14,656 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2024-11-06 18:51:14,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 18:51:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2024-11-06 18:51:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-06 18:51:14,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:14,657 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:14,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-06 18:51:14,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:14,858 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:14,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1951422266, now seen corresponding path program 1 times [2024-11-06 18:51:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:14,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627440506] [2024-11-06 18:51:14,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:14,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:14,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:14,862 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:14,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-06 18:51:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:14,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-06 18:51:14,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-06 18:51:15,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:15,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:15,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627440506] [2024-11-06 18:51:15,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627440506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:15,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:15,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-06 18:51:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270431716] [2024-11-06 18:51:15,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:15,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 18:51:15,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:15,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 18:51:15,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-06 18:51:15,184 INFO L87 Difference]: Start difference. First operand 82 states and 110 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 18:51:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,325 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2024-11-06 18:51:15,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 18:51:15,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2024-11-06 18:51:15,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,327 INFO L225 Difference]: With dead ends: 96 [2024-11-06 18:51:15,327 INFO L226 Difference]: Without dead ends: 87 [2024-11-06 18:51:15,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-06 18:51:15,328 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 6 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 521 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:51:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-06 18:51:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-11-06 18:51:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 64 states have internal predecessors, (73), 12 states have call successors, (12), 5 states have call predecessors, (12), 8 states have return successors, (24), 12 states have call predecessors, (24), 11 states have call successors, (24) [2024-11-06 18:51:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2024-11-06 18:51:15,337 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 72 [2024-11-06 18:51:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,338 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2024-11-06 18:51:15,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 18:51:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2024-11-06 18:51:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-06 18:51:15,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,339 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-06 18:51:15,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:15,542 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1060490927, now seen corresponding path program 1 times [2024-11-06 18:51:15,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:15,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660316129] [2024-11-06 18:51:15,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:15,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:15,546 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:15,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-06 18:51:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-06 18:51:15,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 18:51:16,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 18:51:16,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:16,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660316129] [2024-11-06 18:51:16,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660316129] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:16,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:16,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2024-11-06 18:51:16,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009187058] [2024-11-06 18:51:16,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:16,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-06 18:51:16,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:16,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-06 18:51:16,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2024-11-06 18:51:16,841 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-06 18:51:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:18,848 INFO L93 Difference]: Finished difference Result 108 states and 148 transitions. [2024-11-06 18:51:18,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 18:51:18,849 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 72 [2024-11-06 18:51:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:18,850 INFO L225 Difference]: With dead ends: 108 [2024-11-06 18:51:18,850 INFO L226 Difference]: Without dead ends: 99 [2024-11-06 18:51:18,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2024-11-06 18:51:18,850 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:18,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 967 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 18:51:18,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-06 18:51:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2024-11-06 18:51:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 69 states have internal predecessors, (79), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (28), 12 states have call predecessors, (28), 11 states have call successors, (28) [2024-11-06 18:51:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-11-06 18:51:18,857 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 72 [2024-11-06 18:51:18,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:18,857 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-11-06 18:51:18,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-06 18:51:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-11-06 18:51:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-06 18:51:18,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:18,858 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:18,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-06 18:51:19,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:19,060 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:19,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1279345645, now seen corresponding path program 1 times [2024-11-06 18:51:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838871288] [2024-11-06 18:51:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:19,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:19,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:19,063 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:19,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-06 18:51:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:19,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 18:51:19,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-06 18:51:19,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 18:51:20,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:20,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838871288] [2024-11-06 18:51:20,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838871288] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:20,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:20,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2024-11-06 18:51:20,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275608262] [2024-11-06 18:51:20,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:20,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-06 18:51:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:20,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-06 18:51:20,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-11-06 18:51:20,934 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-06 18:51:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:23,676 INFO L93 Difference]: Finished difference Result 145 states and 199 transitions. [2024-11-06 18:51:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-06 18:51:23,677 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 72 [2024-11-06 18:51:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:23,677 INFO L225 Difference]: With dead ends: 145 [2024-11-06 18:51:23,677 INFO L226 Difference]: Without dead ends: 130 [2024-11-06 18:51:23,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=342, Invalid=2108, Unknown=0, NotChecked=0, Total=2450 [2024-11-06 18:51:23,678 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 88 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:23,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 894 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 18:51:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-06 18:51:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2024-11-06 18:51:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.216867469879518) internal successors, (101), 87 states have internal predecessors, (101), 16 states have call successors, (16), 6 states have call predecessors, (16), 10 states have return successors, (38), 16 states have call predecessors, (38), 15 states have call successors, (38) [2024-11-06 18:51:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2024-11-06 18:51:23,689 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 72 [2024-11-06 18:51:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:23,689 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2024-11-06 18:51:23,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-06 18:51:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2024-11-06 18:51:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-06 18:51:23,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:23,690 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:23,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-06 18:51:23,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:23,891 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:23,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash -784876239, now seen corresponding path program 2 times [2024-11-06 18:51:23,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:23,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840788404] [2024-11-06 18:51:23,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:51:23,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:23,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:23,894 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:23,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-06 18:51:23,945 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 18:51:23,945 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:51:23,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 18:51:23,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-06 18:51:24,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 18:51:25,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:25,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840788404] [2024-11-06 18:51:25,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840788404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:25,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:25,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2024-11-06 18:51:25,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464086212] [2024-11-06 18:51:25,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:25,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-06 18:51:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:25,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-06 18:51:25,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2024-11-06 18:51:25,859 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-06 18:51:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:28,034 INFO L93 Difference]: Finished difference Result 179 states and 250 transitions. [2024-11-06 18:51:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-06 18:51:28,035 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 72 [2024-11-06 18:51:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:28,039 INFO L225 Difference]: With dead ends: 179 [2024-11-06 18:51:28,039 INFO L226 Difference]: Without dead ends: 162 [2024-11-06 18:51:28,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2024-11-06 18:51:28,043 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 96 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:28,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1023 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 18:51:28,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-06 18:51:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2024-11-06 18:51:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 112 states have internal predecessors, (131), 21 states have call successors, (21), 7 states have call predecessors, (21), 12 states have return successors, (51), 21 states have call predecessors, (51), 20 states have call successors, (51) [2024-11-06 18:51:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2024-11-06 18:51:28,064 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 72 [2024-11-06 18:51:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:28,065 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2024-11-06 18:51:28,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-06 18:51:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2024-11-06 18:51:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-06 18:51:28,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:28,067 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:28,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-06 18:51:28,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:28,267 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:28,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:28,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1031466431, now seen corresponding path program 1 times [2024-11-06 18:51:28,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:28,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707983500] [2024-11-06 18:51:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:28,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:28,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:28,270 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:28,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-06 18:51:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:28,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-06 18:51:28,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 18:51:28,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:28,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:28,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707983500] [2024-11-06 18:51:28,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707983500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:51:28,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1575979320] [2024-11-06 18:51:28,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:28,916 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 18:51:28,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 18:51:28,940 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 18:51:28,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-06 18:51:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:29,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 18:51:29,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-06 18:51:29,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:29,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1575979320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:29,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:51:29,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-06 18:51:29,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579556772] [2024-11-06 18:51:29,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:29,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:51:29,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:51:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-06 18:51:29,218 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 18:51:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:29,263 INFO L93 Difference]: Finished difference Result 184 states and 270 transitions. [2024-11-06 18:51:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:51:29,264 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), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2024-11-06 18:51:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:29,265 INFO L225 Difference]: With dead ends: 184 [2024-11-06 18:51:29,265 INFO L226 Difference]: Without dead ends: 155 [2024-11-06 18:51:29,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-06 18:51:29,266 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:29,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 253 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-06 18:51:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2024-11-06 18:51:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 105 states have (on average 1.2) internal successors, (126), 111 states have internal predecessors, (126), 22 states have call successors, (22), 7 states have call predecessors, (22), 13 states have return successors, (56), 22 states have call predecessors, (56), 21 states have call successors, (56) [2024-11-06 18:51:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-06 18:51:29,291 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 74 [2024-11-06 18:51:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:29,291 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-06 18:51:29,291 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), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 18:51:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-06 18:51:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-06 18:51:29,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:29,292 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:29,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-06 18:51:29,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-06 18:51:29,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-06 18:51:29,694 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:29,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:29,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1250321149, now seen corresponding path program 1 times [2024-11-06 18:51:29,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:29,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351531457] [2024-11-06 18:51:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:29,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:29,696 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:29,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-06 18:51:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:29,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 18:51:29,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-06 18:51:30,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 18:51:31,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:31,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351531457] [2024-11-06 18:51:31,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351531457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:31,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:31,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2024-11-06 18:51:31,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284804461] [2024-11-06 18:51:31,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:31,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-06 18:51:31,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:31,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-06 18:51:31,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2024-11-06 18:51:31,401 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-06 18:51:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:32,813 INFO L93 Difference]: Finished difference Result 175 states and 243 transitions. [2024-11-06 18:51:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-06 18:51:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 74 [2024-11-06 18:51:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:32,815 INFO L225 Difference]: With dead ends: 175 [2024-11-06 18:51:32,815 INFO L226 Difference]: Without dead ends: 155 [2024-11-06 18:51:32,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2024-11-06 18:51:32,819 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 58 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:32,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1081 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 18:51:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-06 18:51:32,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2024-11-06 18:51:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 112 states have internal predecessors, (128), 22 states have call successors, (22), 8 states have call predecessors, (22), 13 states have return successors, (51), 22 states have call predecessors, (51), 21 states have call successors, (51) [2024-11-06 18:51:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 201 transitions. [2024-11-06 18:51:32,856 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 201 transitions. Word has length 74 [2024-11-06 18:51:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:32,856 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 201 transitions. [2024-11-06 18:51:32,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-06 18:51:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 201 transitions. [2024-11-06 18:51:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-06 18:51:32,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:32,861 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:32,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-06 18:51:33,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:33,062 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:33,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash 359389810, now seen corresponding path program 1 times [2024-11-06 18:51:33,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:33,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568630186] [2024-11-06 18:51:33,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:33,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:33,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:33,065 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:33,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-06 18:51:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:33,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 18:51:33,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-06 18:51:33,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:33,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:33,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568630186] [2024-11-06 18:51:33,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568630186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:33,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:33,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 18:51:33,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896100614] [2024-11-06 18:51:33,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:33,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:51:33,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:33,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:51:33,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:51:33,170 INFO L87 Difference]: Start difference. First operand 143 states and 201 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-06 18:51:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:33,274 INFO L93 Difference]: Finished difference Result 155 states and 214 transitions. [2024-11-06 18:51:33,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:51:33,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 74 [2024-11-06 18:51:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:33,276 INFO L225 Difference]: With dead ends: 155 [2024-11-06 18:51:33,276 INFO L226 Difference]: Without dead ends: 146 [2024-11-06 18:51:33,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:51:33,276 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 3 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:33,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 462 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:51:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-06 18:51:33,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-11-06 18:51:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 112 states have internal predecessors, (128), 22 states have call successors, (22), 8 states have call predecessors, (22), 13 states have return successors, (48), 22 states have call predecessors, (48), 21 states have call successors, (48) [2024-11-06 18:51:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 198 transitions. [2024-11-06 18:51:33,292 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 198 transitions. Word has length 74 [2024-11-06 18:51:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:33,292 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 198 transitions. [2024-11-06 18:51:33,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-06 18:51:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 198 transitions. [2024-11-06 18:51:33,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-06 18:51:33,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:33,293 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:33,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-11-06 18:51:33,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:33,497 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:33,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:33,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1455113153, now seen corresponding path program 2 times [2024-11-06 18:51:33,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:33,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098628437] [2024-11-06 18:51:33,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:51:33,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:33,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:33,499 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:33,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-06 18:51:33,548 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 18:51:33,549 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:51:33,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 18:51:33,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-06 18:51:33,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 18:51:35,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:35,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098628437] [2024-11-06 18:51:35,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098628437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:35,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2024-11-06 18:51:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440421821] [2024-11-06 18:51:35,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:35,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-06 18:51:35,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:35,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-06 18:51:35,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-06 18:51:35,483 INFO L87 Difference]: Start difference. First operand 143 states and 198 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-06 18:51:36,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:36,953 INFO L93 Difference]: Finished difference Result 179 states and 239 transitions. [2024-11-06 18:51:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-06 18:51:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 74 [2024-11-06 18:51:36,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:36,954 INFO L225 Difference]: With dead ends: 179 [2024-11-06 18:51:36,954 INFO L226 Difference]: Without dead ends: 165 [2024-11-06 18:51:36,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2024-11-06 18:51:36,955 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 33 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:36,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1133 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 18:51:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-06 18:51:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2024-11-06 18:51:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 118 states have internal predecessors, (136), 23 states have call successors, (23), 9 states have call predecessors, (23), 13 states have return successors, (46), 23 states have call predecessors, (46), 22 states have call successors, (46) [2024-11-06 18:51:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2024-11-06 18:51:36,993 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 74 [2024-11-06 18:51:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:36,994 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2024-11-06 18:51:36,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-06 18:51:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2024-11-06 18:51:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-06 18:51:36,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:36,995 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:36,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-06 18:51:37,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:37,196 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:37,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:37,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1126803066, now seen corresponding path program 1 times [2024-11-06 18:51:37,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:37,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760884206] [2024-11-06 18:51:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:37,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:37,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:37,199 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:37,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-06 18:51:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:37,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-06 18:51:37,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-06 18:51:37,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-06 18:51:39,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:39,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760884206] [2024-11-06 18:51:39,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760884206] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:39,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:39,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2024-11-06 18:51:39,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122223134] [2024-11-06 18:51:39,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:39,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-06 18:51:39,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:39,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-06 18:51:39,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2024-11-06 18:51:39,561 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-06 18:51:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:41,117 INFO L93 Difference]: Finished difference Result 184 states and 242 transitions. [2024-11-06 18:51:41,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-06 18:51:41,118 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) Word has length 77 [2024-11-06 18:51:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:41,119 INFO L225 Difference]: With dead ends: 184 [2024-11-06 18:51:41,119 INFO L226 Difference]: Without dead ends: 163 [2024-11-06 18:51:41,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2024-11-06 18:51:41,119 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 46 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:41,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 891 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 18:51:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-06 18:51:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2024-11-06 18:51:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 114 states have (on average 1.1754385964912282) internal successors, (134), 118 states have internal predecessors, (134), 23 states have call successors, (23), 9 states have call predecessors, (23), 13 states have return successors, (43), 23 states have call predecessors, (43), 22 states have call successors, (43) [2024-11-06 18:51:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 200 transitions. [2024-11-06 18:51:41,140 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 200 transitions. Word has length 77 [2024-11-06 18:51:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:41,140 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 200 transitions. [2024-11-06 18:51:41,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-06 18:51:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 200 transitions. [2024-11-06 18:51:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-06 18:51:41,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:41,141 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:41,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-06 18:51:41,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:41,342 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:41,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1449154486, now seen corresponding path program 2 times [2024-11-06 18:51:41,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:41,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250970867] [2024-11-06 18:51:41,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:51:41,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:41,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:41,345 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:41,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-06 18:51:41,396 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 18:51:41,396 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:51:41,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-06 18:51:41,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-06 18:51:41,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-06 18:51:43,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:43,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250970867] [2024-11-06 18:51:43,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250970867] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:43,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:43,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2024-11-06 18:51:43,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621050432] [2024-11-06 18:51:43,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:43,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-06 18:51:43,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:43,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-06 18:51:43,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2024-11-06 18:51:43,615 INFO L87 Difference]: Start difference. First operand 151 states and 200 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-06 18:51:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:46,147 INFO L93 Difference]: Finished difference Result 177 states and 229 transitions. [2024-11-06 18:51:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-06 18:51:46,148 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) Word has length 77 [2024-11-06 18:51:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:46,153 INFO L225 Difference]: With dead ends: 177 [2024-11-06 18:51:46,153 INFO L226 Difference]: Without dead ends: 163 [2024-11-06 18:51:46,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2024-11-06 18:51:46,154 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 59 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:46,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 774 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 18:51:46,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-06 18:51:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2024-11-06 18:51:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 118 states have internal predecessors, (133), 23 states have call successors, (23), 9 states have call predecessors, (23), 13 states have return successors, (43), 23 states have call predecessors, (43), 22 states have call successors, (43) [2024-11-06 18:51:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 199 transitions. [2024-11-06 18:51:46,208 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 199 transitions. Word has length 77 [2024-11-06 18:51:46,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:46,208 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 199 transitions. [2024-11-06 18:51:46,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-06 18:51:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 199 transitions. [2024-11-06 18:51:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-06 18:51:46,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:46,210 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:46,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-06 18:51:46,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:46,411 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:46,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2068625504, now seen corresponding path program 1 times [2024-11-06 18:51:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:46,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280065890] [2024-11-06 18:51:46,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:46,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:46,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:46,415 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:46,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-06 18:51:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:46,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-06 18:51:46,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:46,817 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-06 18:51:46,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-06 18:51:47,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:47,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280065890] [2024-11-06 18:51:47,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280065890] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:47,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:47,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2024-11-06 18:51:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816208269] [2024-11-06 18:51:47,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:47,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-06 18:51:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:47,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-06 18:51:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-06 18:51:47,800 INFO L87 Difference]: Start difference. First operand 151 states and 199 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-06 18:51:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:48,643 INFO L93 Difference]: Finished difference Result 170 states and 219 transitions. [2024-11-06 18:51:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-06 18:51:48,647 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) Word has length 78 [2024-11-06 18:51:48,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:48,648 INFO L225 Difference]: With dead ends: 170 [2024-11-06 18:51:48,648 INFO L226 Difference]: Without dead ends: 128 [2024-11-06 18:51:48,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2024-11-06 18:51:48,649 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 46 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:48,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 836 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:51:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-06 18:51:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2024-11-06 18:51:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 95 states have internal predecessors, (106), 19 states have call successors, (19), 8 states have call predecessors, (19), 11 states have return successors, (37), 19 states have call predecessors, (37), 18 states have call successors, (37) [2024-11-06 18:51:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 162 transitions. [2024-11-06 18:51:48,680 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 162 transitions. Word has length 78 [2024-11-06 18:51:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:48,680 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 162 transitions. [2024-11-06 18:51:48,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-06 18:51:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 162 transitions. [2024-11-06 18:51:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-06 18:51:48,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:48,681 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:48,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-11-06 18:51:48,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:48,883 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:48,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:48,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1678929915, now seen corresponding path program 1 times [2024-11-06 18:51:48,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:48,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299188335] [2024-11-06 18:51:48,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:48,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:51:48,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:48,888 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:51:48,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-11-06 18:51:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:48,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-06 18:51:48,997 INFO L278 TraceCheckSpWp]: Computing forward predicates...