./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i --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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i', '-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', 'c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6'] 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -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 c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:33:50,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:33:50,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:33:50,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:33:50,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:33:50,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:33:50,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:33:50,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:33:50,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:33:50,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:33:50,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:33:50,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:33:50,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:33:50,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:33:50,289 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:33:50,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:33:50,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:33:50,289 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:33:50,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:33:50,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:33:50,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:33:50,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:33:50,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:33:50,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:33:50,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:33:50,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:33:50,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:33:50,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:33:50,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:33:50,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:33:50,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:33:50,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:33:50,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:33:50,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:33:50,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:33:50,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:33:50,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:33:50,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:33:50,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:33:50,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:33:50,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:33:50,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:33:50,292 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 -> c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 [2024-11-06 22:33:50,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:33:50,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:33:50,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:33:50,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:33:50,563 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:33:50,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-06 22:33:51,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:33:52,165 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:33:52,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-06 22:33:52,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66586a1b8/6f5ff199283a4d1f8ac44b4d7defb53e/FLAGf19660799 [2024-11-06 22:33:52,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66586a1b8/6f5ff199283a4d1f8ac44b4d7defb53e [2024-11-06 22:33:52,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:33:52,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:33:52,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:33:52,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:33:52,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:33:52,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d771f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52, skipping insertion in model container [2024-11-06 22:33:52,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:33:52,354 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2024-11-06 22:33:52,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:33:52,399 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:33:52,409 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2024-11-06 22:33:52,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:33:52,450 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:33:52,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52 WrapperNode [2024-11-06 22:33:52,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:33:52,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:33:52,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:33:52,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:33:52,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,496 INFO L138 Inliner]: procedures = 42, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-11-06 22:33:52,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:33:52,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:33:52,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:33:52,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:33:52,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,527 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 1, 10]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-11-06 22:33:52,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:33:52,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:33:52,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:33:52,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:33:52,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (1/1) ... [2024-11-06 22:33:52,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:33:52,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:33:52,588 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 22:33:52,591 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 22:33:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:33:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 22:33:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 22:33:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 22:33:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-06 22:33:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 22:33:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 22:33:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-06 22:33:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:33:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 22:33:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-06 22:33:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:33:52,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:33:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 22:33:52,715 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:33:52,717 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:33:52,944 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-06 22:33:52,944 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:33:52,954 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:33:52,954 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-06 22:33:52,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:52 BoogieIcfgContainer [2024-11-06 22:33:52,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:33:52,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:33:52,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:33:52,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:33:52,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:33:52" (1/3) ... [2024-11-06 22:33:52,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f89c20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:52, skipping insertion in model container [2024-11-06 22:33:52,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:52" (2/3) ... [2024-11-06 22:33:52,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f89c20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:52, skipping insertion in model container [2024-11-06 22:33:52,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:52" (3/3) ... [2024-11-06 22:33:52,967 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-06 22:33:52,979 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:33:52,980 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:33:53,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:33:53,041 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;@4b9a2608, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:33:53,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:33:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 22:33:53,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:53,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:33:53,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:53,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:53,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1672152255, now seen corresponding path program 1 times [2024-11-06 22:33:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:53,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122785669] [2024-11-06 22:33:53,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:53,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:33:53,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:53,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122785669] [2024-11-06 22:33:53,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122785669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:33:53,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:33:53,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:33:53,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755777893] [2024-11-06 22:33:53,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:33:53,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:33:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:53,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:33:53,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:33:53,349 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:33:53,383 INFO L93 Difference]: Finished difference Result 72 states and 106 transitions. [2024-11-06 22:33:53,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:33:53,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-06 22:33:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:33:53,392 INFO L225 Difference]: With dead ends: 72 [2024-11-06 22:33:53,392 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 22:33:53,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:33:53,398 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:33:53,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:33:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 22:33:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-06 22:33:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-06 22:33:53,422 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 19 [2024-11-06 22:33:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:33:53,423 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-06 22:33:53,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-06 22:33:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:33:53,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:53,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:33:53,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:33:53,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:53,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:53,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1194375668, now seen corresponding path program 1 times [2024-11-06 22:33:53,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:53,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834694227] [2024-11-06 22:33:53,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:53,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:33:53,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:53,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834694227] [2024-11-06 22:33:53,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834694227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:33:53,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905939203] [2024-11-06 22:33:53,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:53,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:53,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:33:53,581 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 22:33:53,582 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 22:33:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:53,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 22:33:53,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:33:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:33:53,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:33:53,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905939203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:33:53,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 22:33:53,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 22:33:53,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226020398] [2024-11-06 22:33:53,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:33:53,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:33:53,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:53,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:33:53,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:33:53,726 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:33:53,745 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2024-11-06 22:33:53,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:33:53,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-06 22:33:53,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:33:53,749 INFO L225 Difference]: With dead ends: 60 [2024-11-06 22:33:53,749 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 22:33:53,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:33:53,750 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:33:53,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:33:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 22:33:53,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-06 22:33:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-06 22:33:53,756 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 25 [2024-11-06 22:33:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:33:53,756 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-06 22:33:53,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-06 22:33:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:33:53,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:53,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:33:53,776 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 22:33:53,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:53,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:53,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash -85488010, now seen corresponding path program 1 times [2024-11-06 22:33:53,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:53,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671885980] [2024-11-06 22:33:53,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:53,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:33:54,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:54,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671885980] [2024-11-06 22:33:54,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671885980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:33:54,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672997601] [2024-11-06 22:33:54,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:54,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:54,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:33:54,064 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 22:33:54,065 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 22:33:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:54,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 22:33:54,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:33:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:33:54,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:33:54,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672997601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:33:54,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 22:33:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2024-11-06 22:33:54,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027871499] [2024-11-06 22:33:54,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:33:54,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:33:54,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:54,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:33:54,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:33:54,260 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:33:54,340 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2024-11-06 22:33:54,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 22:33:54,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-06 22:33:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:33:54,341 INFO L225 Difference]: With dead ends: 72 [2024-11-06 22:33:54,341 INFO L226 Difference]: Without dead ends: 45 [2024-11-06 22:33:54,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-06 22:33:54,342 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:33:54,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:33:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-06 22:33:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2024-11-06 22:33:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-11-06 22:33:54,346 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 25 [2024-11-06 22:33:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:33:54,346 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-06 22:33:54,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-11-06 22:33:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:33:54,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:54,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:33:54,363 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 22:33:54,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:54,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:54,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash -26382666, now seen corresponding path program 1 times [2024-11-06 22:33:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:54,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706561400] [2024-11-06 22:33:54,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:33:54,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:54,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706561400] [2024-11-06 22:33:54,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706561400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:33:54,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685333399] [2024-11-06 22:33:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:54,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:54,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:33:54,659 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 22:33:54,661 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 22:33:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:54,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 22:33:54,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:33:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:33:54,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:33:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:33:54,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685333399] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:33:54,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:33:54,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-06 22:33:54,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458590063] [2024-11-06 22:33:54,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:33:54,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:33:54,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:54,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:33:54,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:33:54,779 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:54,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:33:54,811 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2024-11-06 22:33:54,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:33:54,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-06 22:33:54,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:33:54,812 INFO L225 Difference]: With dead ends: 77 [2024-11-06 22:33:54,812 INFO L226 Difference]: Without dead ends: 44 [2024-11-06 22:33:54,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:33:54,813 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:33:54,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 114 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:33:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-06 22:33:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-06 22:33:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2024-11-06 22:33:54,818 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 25 [2024-11-06 22:33:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:33:54,818 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2024-11-06 22:33:54,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-11-06 22:33:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 22:33:54,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:54,819 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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 22:33:54,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 22:33:55,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:55,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:55,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:55,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1034544144, now seen corresponding path program 2 times [2024-11-06 22:33:55,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:55,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531614267] [2024-11-06 22:33:55,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:55,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:33:55,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:55,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531614267] [2024-11-06 22:33:55,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531614267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:33:55,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953746645] [2024-11-06 22:33:55,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:33:55,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:55,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:33:55,175 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 22:33:55,177 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 22:33:55,265 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 22:33:55,265 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:33:55,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 22:33:55,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:33:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:33:55,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:33:55,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953746645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:33:55,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 22:33:55,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-06 22:33:55,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034725777] [2024-11-06 22:33:55,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:33:55,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 22:33:55,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:55,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 22:33:55,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-06 22:33:55,400 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:33:55,511 INFO L93 Difference]: Finished difference Result 126 states and 162 transitions. [2024-11-06 22:33:55,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:33:55,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-06 22:33:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:33:55,512 INFO L225 Difference]: With dead ends: 126 [2024-11-06 22:33:55,512 INFO L226 Difference]: Without dead ends: 74 [2024-11-06 22:33:55,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-06 22:33:55,516 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 50 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:33:55,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 133 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:33:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-06 22:33:55,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2024-11-06 22:33:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-11-06 22:33:55,529 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 31 [2024-11-06 22:33:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:33:55,529 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-11-06 22:33:55,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-11-06 22:33:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 22:33:55,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:55,530 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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 22:33:55,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-06 22:33:55,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:55,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:55,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:55,731 INFO L85 PathProgramCache]: Analyzing trace with hash -776378706, now seen corresponding path program 1 times [2024-11-06 22:33:55,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:55,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066606589] [2024-11-06 22:33:55,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:55,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:33:55,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:55,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066606589] [2024-11-06 22:33:55,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066606589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:33:55,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:33:55,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 22:33:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061194752] [2024-11-06 22:33:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:33:55,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 22:33:55,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:55,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 22:33:55,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:33:55,926 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:33:55,984 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2024-11-06 22:33:55,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:33:55,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-06 22:33:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:33:55,986 INFO L225 Difference]: With dead ends: 88 [2024-11-06 22:33:55,988 INFO L226 Difference]: Without dead ends: 86 [2024-11-06 22:33:55,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:33:55,989 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:33:55,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 111 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:33:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-06 22:33:55,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2024-11-06 22:33:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 73 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2024-11-06 22:33:55,999 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 31 [2024-11-06 22:33:55,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:33:55,999 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2024-11-06 22:33:55,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2024-11-06 22:33:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-06 22:33:56,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:56,000 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 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 22:33:56,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 22:33:56,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:56,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:56,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1117920663, now seen corresponding path program 1 times [2024-11-06 22:33:56,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:56,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525232268] [2024-11-06 22:33:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:56,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:33:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525232268] [2024-11-06 22:33:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525232268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:33:56,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:33:56,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:33:56,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262918217] [2024-11-06 22:33:56,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:33:56,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:33:56,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:56,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:33:56,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:33:56,084 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:33:56,103 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2024-11-06 22:33:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:33:56,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-06 22:33:56,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:33:56,105 INFO L225 Difference]: With dead ends: 109 [2024-11-06 22:33:56,105 INFO L226 Difference]: Without dead ends: 78 [2024-11-06 22:33:56,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:33:56,106 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:33:56,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:33:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-06 22:33:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-06 22:33:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2024-11-06 22:33:56,115 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 33 [2024-11-06 22:33:56,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:33:56,117 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2024-11-06 22:33:56,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2024-11-06 22:33:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-06 22:33:56,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:56,118 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 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 22:33:56,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 22:33:56,119 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:56,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:56,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1510947673, now seen corresponding path program 1 times [2024-11-06 22:33:56,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:56,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684120009] [2024-11-06 22:33:56,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:56,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:33:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684120009] [2024-11-06 22:33:56,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684120009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:33:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031430036] [2024-11-06 22:33:56,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:56,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:56,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:33:56,234 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 22:33:56,236 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 22:33:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:56,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 22:33:56,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:33:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:33:56,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:33:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:33:56,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031430036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:33:56,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:33:56,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-06 22:33:56,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515955701] [2024-11-06 22:33:56,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:33:56,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 22:33:56,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:56,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 22:33:56,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-06 22:33:56,417 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:33:56,451 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2024-11-06 22:33:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 22:33:56,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-06 22:33:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:33:56,452 INFO L225 Difference]: With dead ends: 151 [2024-11-06 22:33:56,452 INFO L226 Difference]: Without dead ends: 84 [2024-11-06 22:33:56,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-06 22:33:56,453 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:33:56,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 188 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:33:56,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-06 22:33:56,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-06 22:33:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 83 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2024-11-06 22:33:56,460 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 33 [2024-11-06 22:33:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:33:56,460 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2024-11-06 22:33:56,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2024-11-06 22:33:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 22:33:56,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:56,461 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 1, 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 22:33:56,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 22:33:56,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:56,665 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:56,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:56,666 INFO L85 PathProgramCache]: Analyzing trace with hash -664954911, now seen corresponding path program 2 times [2024-11-06 22:33:56,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:56,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998557693] [2024-11-06 22:33:56,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:56,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:33:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:56,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998557693] [2024-11-06 22:33:56,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998557693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:33:56,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:33:56,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 22:33:56,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975771544] [2024-11-06 22:33:56,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:33:56,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 22:33:56,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:56,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 22:33:56,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:33:56,783 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:33:56,844 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2024-11-06 22:33:56,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 22:33:56,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-06 22:33:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:33:56,845 INFO L225 Difference]: With dead ends: 151 [2024-11-06 22:33:56,845 INFO L226 Difference]: Without dead ends: 104 [2024-11-06 22:33:56,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-06 22:33:56,846 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 26 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:33:56,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 149 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:33:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-06 22:33:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2024-11-06 22:33:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 86 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2024-11-06 22:33:56,854 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 39 [2024-11-06 22:33:56,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:33:56,855 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2024-11-06 22:33:56,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2024-11-06 22:33:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 22:33:56,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:56,856 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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 22:33:56,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 22:33:56,856 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:56,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1636169070, now seen corresponding path program 1 times [2024-11-06 22:33:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:56,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192469367] [2024-11-06 22:33:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:56,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-06 22:33:57,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:57,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192469367] [2024-11-06 22:33:57,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192469367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:33:57,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:33:57,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 22:33:57,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244795523] [2024-11-06 22:33:57,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:33:57,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:33:57,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:57,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:33:57,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:33:57,028 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:33:57,126 INFO L93 Difference]: Finished difference Result 160 states and 197 transitions. [2024-11-06 22:33:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:33:57,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-06 22:33:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:33:57,128 INFO L225 Difference]: With dead ends: 160 [2024-11-06 22:33:57,128 INFO L226 Difference]: Without dead ends: 122 [2024-11-06 22:33:57,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 22:33:57,129 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 49 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:33:57,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 188 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:33:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-06 22:33:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2024-11-06 22:33:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.24) internal successors, (124), 100 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2024-11-06 22:33:57,135 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 42 [2024-11-06 22:33:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:33:57,135 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2024-11-06 22:33:57,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2024-11-06 22:33:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 22:33:57,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:57,136 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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 22:33:57,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 22:33:57,137 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:57,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1159200651, now seen corresponding path program 1 times [2024-11-06 22:33:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:57,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444388272] [2024-11-06 22:33:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:57,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:33:57,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444388272] [2024-11-06 22:33:57,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444388272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:33:57,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549263298] [2024-11-06 22:33:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:57,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:57,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:33:57,246 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 22:33:57,248 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 22:33:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:57,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 22:33:57,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:33:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:33:57,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:33:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:33:57,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549263298] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:33:57,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:33:57,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-11-06 22:33:57,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973238868] [2024-11-06 22:33:57,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:33:57,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:33:57,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:57,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:33:57,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:33:57,434 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:33:57,523 INFO L93 Difference]: Finished difference Result 226 states and 276 transitions. [2024-11-06 22:33:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 22:33:57,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-06 22:33:57,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:33:57,526 INFO L225 Difference]: With dead ends: 226 [2024-11-06 22:33:57,526 INFO L226 Difference]: Without dead ends: 163 [2024-11-06 22:33:57,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-06 22:33:57,526 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:33:57,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 167 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:33:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-06 22:33:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2024-11-06 22:33:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.213235294117647) internal successors, (165), 136 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 165 transitions. [2024-11-06 22:33:57,539 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 165 transitions. Word has length 44 [2024-11-06 22:33:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:33:57,539 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 165 transitions. [2024-11-06 22:33:57,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2024-11-06 22:33:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 22:33:57,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:57,540 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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 22:33:57,562 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 22:33:57,741 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 22:33:57,741 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:57,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:57,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1026725283, now seen corresponding path program 2 times [2024-11-06 22:33:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:57,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905983209] [2024-11-06 22:33:57,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:33:57,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905983209] [2024-11-06 22:33:57,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905983209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:33:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676424294] [2024-11-06 22:33:57,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:33:57,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:57,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:33:57,961 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 22:33:57,962 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 22:33:58,073 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:33:58,073 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:33:58,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 22:33:58,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:33:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:33:58,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:33:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:33:58,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676424294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:33:58,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:33:58,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2024-11-06 22:33:58,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656563616] [2024-11-06 22:33:58,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:33:58,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-06 22:33:58,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:58,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-06 22:33:58,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-11-06 22:33:58,381 INFO L87 Difference]: Start difference. First operand 137 states and 165 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:33:59,017 INFO L93 Difference]: Finished difference Result 444 states and 565 transitions. [2024-11-06 22:33:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-06 22:33:59,018 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-06 22:33:59,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:33:59,020 INFO L225 Difference]: With dead ends: 444 [2024-11-06 22:33:59,020 INFO L226 Difference]: Without dead ends: 241 [2024-11-06 22:33:59,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2024-11-06 22:33:59,021 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 360 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 22:33:59,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 587 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 22:33:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-06 22:33:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 159. [2024-11-06 22:33:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.2215189873417722) internal successors, (193), 158 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 193 transitions. [2024-11-06 22:33:59,035 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 193 transitions. Word has length 49 [2024-11-06 22:33:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:33:59,036 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 193 transitions. [2024-11-06 22:33:59,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 193 transitions. [2024-11-06 22:33:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 22:33:59,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:33:59,037 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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 22:33:59,053 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 22:33:59,237 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 22:33:59,237 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:33:59,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:33:59,238 INFO L85 PathProgramCache]: Analyzing trace with hash 15608033, now seen corresponding path program 1 times [2024-11-06 22:33:59,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:33:59,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184037624] [2024-11-06 22:33:59,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:33:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:33:59,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:33:59,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184037624] [2024-11-06 22:33:59,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184037624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:33:59,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571592541] [2024-11-06 22:33:59,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:33:59,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:33:59,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:33:59,427 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 22:33:59,428 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 22:33:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:33:59,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 22:33:59,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:33:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:33:59,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:33:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:33:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571592541] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:33:59,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:33:59,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-06 22:33:59,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434520843] [2024-11-06 22:33:59,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:33:59,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-06 22:33:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:33:59,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-06 22:33:59,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2024-11-06 22:33:59,887 INFO L87 Difference]: Start difference. First operand 159 states and 193 transitions. Second operand has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:00,264 INFO L93 Difference]: Finished difference Result 281 states and 337 transitions. [2024-11-06 22:34:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-06 22:34:00,264 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-06 22:34:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:00,266 INFO L225 Difference]: With dead ends: 281 [2024-11-06 22:34:00,266 INFO L226 Difference]: Without dead ends: 279 [2024-11-06 22:34:00,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=919, Unknown=0, NotChecked=0, Total=1190 [2024-11-06 22:34:00,267 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 287 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:00,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 296 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 22:34:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-06 22:34:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 181. [2024-11-06 22:34:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.2555555555555555) internal successors, (226), 180 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 226 transitions. [2024-11-06 22:34:00,275 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 226 transitions. Word has length 49 [2024-11-06 22:34:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:00,275 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 226 transitions. [2024-11-06 22:34:00,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 226 transitions. [2024-11-06 22:34:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 22:34:00,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:00,277 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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 22:34:00,290 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 22:34:00,478 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 22:34:00,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:00,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:00,479 INFO L85 PathProgramCache]: Analyzing trace with hash 17455075, now seen corresponding path program 1 times [2024-11-06 22:34:00,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:34:00,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99291050] [2024-11-06 22:34:00,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:34:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 22:34:00,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 22:34:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 22:34:00,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 22:34:00,572 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 22:34:00,573 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 22:34:00,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 22:34:00,577 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:34:00,625 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 22:34:00,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:34:00 BoogieIcfgContainer [2024-11-06 22:34:00,629 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 22:34:00,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 22:34:00,630 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 22:34:00,630 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 22:34:00,631 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:52" (3/4) ... [2024-11-06 22:34:00,633 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-06 22:34:00,634 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 22:34:00,635 INFO L158 Benchmark]: Toolchain (without parser) took 8433.03ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 91.8MB in the beginning and 84.7MB in the end (delta: 7.2MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2024-11-06 22:34:00,635 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 81.6MB in the end (delta: 77.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:34:00,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.68ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 79.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:34:00,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.99ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:34:00,636 INFO L158 Benchmark]: Boogie Preprocessor took 53.03ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 75.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:34:00,636 INFO L158 Benchmark]: RCFGBuilder took 403.59ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 61.1MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 22:34:00,636 INFO L158 Benchmark]: TraceAbstraction took 7670.67ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 60.4MB in the beginning and 86.2MB in the end (delta: -25.8MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-06 22:34:00,636 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 151.0MB. Free memory was 86.2MB in the beginning and 84.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:34:00,638 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.98ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 81.6MB in the end (delta: 77.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.68ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 79.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.99ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.03ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 75.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 403.59ms. Allocated memory is still 117.4MB. Free memory was 75.9MB in the beginning and 61.1MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7670.67ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 60.4MB in the beginning and 86.2MB in the end (delta: -25.8MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 151.0MB. Free memory was 86.2MB in the beginning and 84.7MB in the end (delta: 1.5MB). 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: 16]: 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 strncpy at line 42. Possible FailurePath: [L86] char A [2 + 2 + 4 +1]; [L87] int i = 0; VAL [A={10:0}, i=0] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=1] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=2] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=3] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=4] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=5] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=6] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=7] [L87] COND FALSE !(i<2 + 2 + 4 -1) VAL [A={10:0}] [L90] A[2 + 2 + 4] = 0 [L91] CALL parse_expression_list (A) [L60] int start=0, i=-1, j=-1; [L61] char str2[2]; VAL [i=-1, start=0, str2={7:0}, str={10:0}] [L62] COND FALSE !(!str) VAL [i=-1, start=0, str2={7:0}, str={10:0}] [L64] i++ [L65] str[i] [L66] case 0: VAL [i=0, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=1, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=2, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={10:0}] [L67] (str[start] == ' ') || (str[start] == '\t') [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={10:0}] [L67] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L68] str[start] [L66] case 0: [L69] j = i-1 VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L71] EXPR str[j] [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L66] case 0: [L73] CALL r_strncpy(str2, str+start, j-start+1) [L42] return strncpy(dest,src,n); [L73] RET r_strncpy(str2, str+start, j-start+1) [L74] CALL __VERIFIER_assert(j - start + 1 < 2) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 872 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 872 mSDsluCounter, 2328 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1817 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1429 IncrementalHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 511 mSDtfsCounter, 1429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 447 SyntacticMatches, 12 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=13, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 287 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 775 NumberOfCodeBlocks, 767 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 900 ConstructedInterpolants, 0 QuantifiedInterpolants, 2276 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1331 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 591/720 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 22:34:00,664 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -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 c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:34:02,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:34:02,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 22:34:02,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:34:02,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:34:02,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:34:02,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:34:02,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:34:02,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:34:02,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:34:02,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:34:02,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:34:02,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:34:02,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:34:02,940 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:34:02,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:34:02,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:34:02,941 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:34:02,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:34:02,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:34:02,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:34:02,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:34:02,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:34:02,941 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 22:34:02,942 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 22:34:02,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:34:02,942 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 22:34:02,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:34:02,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:34:02,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:34:02,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:34:02,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:34:02,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:34:02,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:34:02,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:34:02,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:34:02,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:34:02,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:34:02,944 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 22:34:02,944 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 22:34:02,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:34:02,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:34:02,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:34:02,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:34:02,944 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 -> c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 [2024-11-06 22:34:03,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:34:03,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:34:03,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:34:03,418 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:34:03,418 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:34:03,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-06 22:34:04,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:34:04,944 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:34:04,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-06 22:34:04,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/335cab5bf/cc8af09817694ad19e991e50f2df5eaa/FLAG7ffd4dc21 [2024-11-06 22:34:05,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/335cab5bf/cc8af09817694ad19e991e50f2df5eaa [2024-11-06 22:34:05,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:34:05,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:34:05,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:34:05,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:34:05,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:34:05,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c88520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05, skipping insertion in model container [2024-11-06 22:34:05,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:34:05,401 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2024-11-06 22:34:05,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:34:05,442 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:34:05,454 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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2024-11-06 22:34:05,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:34:05,491 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:34:05,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05 WrapperNode [2024-11-06 22:34:05,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:34:05,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:34:05,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:34:05,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:34:05,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,521 INFO L138 Inliner]: procedures = 42, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-11-06 22:34:05,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:34:05,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:34:05,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:34:05,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:34:05,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,546 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 1, 10]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-11-06 22:34:05,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:34:05,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:34:05,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:34:05,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:34:05,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (1/1) ... [2024-11-06 22:34:05,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:34:05,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:34:05,601 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 22:34:05,607 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 22:34:05,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:34:05,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-06 22:34:05,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-06 22:34:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-06 22:34:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 22:34:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 22:34:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 22:34:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 22:34:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:34:05,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:34:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-06 22:34:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-06 22:34:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-06 22:34:05,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 22:34:05,695 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:34:05,696 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:34:05,947 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-06 22:34:05,948 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:34:05,955 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:34:05,955 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-06 22:34:05,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:34:05 BoogieIcfgContainer [2024-11-06 22:34:05,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:34:05,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:34:05,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:34:05,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:34:05,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:34:05" (1/3) ... [2024-11-06 22:34:05,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3975260c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:34:05, skipping insertion in model container [2024-11-06 22:34:05,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:05" (2/3) ... [2024-11-06 22:34:05,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3975260c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:34:05, skipping insertion in model container [2024-11-06 22:34:05,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:34:05" (3/3) ... [2024-11-06 22:34:05,965 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-06 22:34:05,981 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:34:05,981 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:34:06,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:34:06,049 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;@30b0ac2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:34:06,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:34:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 22:34:06,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:06,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:34:06,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:06,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:06,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1672152255, now seen corresponding path program 1 times [2024-11-06 22:34:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:06,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248722346] [2024-11-06 22:34:06,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:06,068 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 22:34:06,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:06,071 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 22:34:06,073 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 22:34:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:06,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 22:34:06,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:34:06,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:34:06,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:06,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248722346] [2024-11-06 22:34:06,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248722346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:34:06,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:34:06,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 22:34:06,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763318659] [2024-11-06 22:34:06,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:34:06,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 22:34:06,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:06,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 22:34:06,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 22:34:06,215 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:06,230 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2024-11-06 22:34:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 22:34:06,231 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-06 22:34:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:06,237 INFO L225 Difference]: With dead ends: 70 [2024-11-06 22:34:06,237 INFO L226 Difference]: Without dead ends: 32 [2024-11-06 22:34:06,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 22:34:06,243 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:06,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:34:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-06 22:34:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-06 22:34:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-11-06 22:34:06,275 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 19 [2024-11-06 22:34:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:06,276 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-11-06 22:34:06,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-11-06 22:34:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 22:34:06,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:06,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:34:06,282 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 22:34:06,479 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 22:34:06,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:06,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:06,480 INFO L85 PathProgramCache]: Analyzing trace with hash 573346102, now seen corresponding path program 1 times [2024-11-06 22:34:06,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:06,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090760220] [2024-11-06 22:34:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:06,480 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 22:34:06,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:06,483 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 22:34:06,484 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 22:34:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:06,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 22:34:06,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:34:06,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:34:06,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:06,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090760220] [2024-11-06 22:34:06,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090760220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:34:06,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:34:06,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:34:06,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702771977] [2024-11-06 22:34:06,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:34:06,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:34:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:06,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:34:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:34:06,596 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:06,618 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2024-11-06 22:34:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:34:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-06 22:34:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:06,619 INFO L225 Difference]: With dead ends: 62 [2024-11-06 22:34:06,619 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 22:34:06,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:34:06,620 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:06,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:34:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 22:34:06,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-06 22:34:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-06 22:34:06,629 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 23 [2024-11-06 22:34:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:06,629 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-06 22:34:06,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-06 22:34:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:34:06,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:06,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:34:06,635 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 22:34:06,831 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 22:34:06,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:06,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1194375668, now seen corresponding path program 1 times [2024-11-06 22:34:06,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:06,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516654538] [2024-11-06 22:34:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:06,833 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 22:34:06,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:06,835 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 22:34:06,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 (4)] Waiting until timeout for monitored process [2024-11-06 22:34:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:06,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 22:34:06,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:34:06,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:34:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:34:06,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:06,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516654538] [2024-11-06 22:34:06,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516654538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:34:06,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:34:06,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 22:34:06,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187964968] [2024-11-06 22:34:06,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:34:06,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 22:34:06,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:06,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 22:34:06,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:34:06,974 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:07,038 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2024-11-06 22:34:07,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:34:07,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-06 22:34:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:07,040 INFO L225 Difference]: With dead ends: 67 [2024-11-06 22:34:07,040 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 22:34:07,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:34:07,041 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:07,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 188 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:34:07,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 22:34:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 22:34:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-06 22:34:07,047 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 25 [2024-11-06 22:34:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:07,047 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-06 22:34:07,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-06 22:34:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 22:34:07,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:07,049 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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 22:34:07,053 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 22:34:07,250 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 22:34:07,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:07,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 186214190, now seen corresponding path program 2 times [2024-11-06 22:34:07,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:07,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76696746] [2024-11-06 22:34:07,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:34:07,251 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 22:34:07,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:07,253 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 22:34:07,254 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 22:34:07,329 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 22:34:07,329 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:34:07,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 22:34:07,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:34:07,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:34:07,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:07,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76696746] [2024-11-06 22:34:07,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76696746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:34:07,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:34:07,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:34:07,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217381267] [2024-11-06 22:34:07,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:34:07,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:34:07,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:07,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:34:07,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:34:07,344 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:07,368 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2024-11-06 22:34:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:34:07,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-06 22:34:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:07,369 INFO L225 Difference]: With dead ends: 66 [2024-11-06 22:34:07,369 INFO L226 Difference]: Without dead ends: 40 [2024-11-06 22:34:07,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:34:07,370 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:07,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:34:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-06 22:34:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-06 22:34:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-11-06 22:34:07,395 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 31 [2024-11-06 22:34:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:07,395 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-11-06 22:34:07,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-11-06 22:34:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 22:34:07,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:07,396 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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 22:34:07,400 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 (5)] Forceful destruction successful, exit code 0 [2024-11-06 22:34:07,599 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 22:34:07,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:07,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:07,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1093649488, now seen corresponding path program 1 times [2024-11-06 22:34:07,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:07,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610232803] [2024-11-06 22:34:07,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:07,601 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 22:34:07,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:07,604 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 22:34:07,605 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 22:34:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:07,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 22:34:07,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:34:07,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:34:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:34:07,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:07,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610232803] [2024-11-06 22:34:07,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610232803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:34:07,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:34:07,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 22:34:07,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840339780] [2024-11-06 22:34:07,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:34:07,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 22:34:07,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:07,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 22:34:07,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-06 22:34:07,844 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:07,953 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2024-11-06 22:34:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 22:34:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-06 22:34:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:07,954 INFO L225 Difference]: With dead ends: 75 [2024-11-06 22:34:07,954 INFO L226 Difference]: Without dead ends: 46 [2024-11-06 22:34:07,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-06 22:34:07,955 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:07,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 262 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:34:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-06 22:34:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-06 22:34:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-06 22:34:07,964 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 31 [2024-11-06 22:34:07,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:07,964 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-06 22:34:07,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-06 22:34:07,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 22:34:07,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:07,967 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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 22:34:07,970 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 22:34:08,167 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 22:34:08,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:08,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:08,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2031315606, now seen corresponding path program 2 times [2024-11-06 22:34:08,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:08,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200716786] [2024-11-06 22:34:08,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:34:08,169 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 22:34:08,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:08,170 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 22:34:08,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 (7)] Waiting until timeout for monitored process [2024-11-06 22:34:08,250 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 22:34:08,250 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:34:08,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 22:34:08,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:08,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:34:08,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:08,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200716786] [2024-11-06 22:34:08,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200716786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:34:08,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:34:08,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 22:34:08,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960657203] [2024-11-06 22:34:08,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:34:08,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:34:08,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:08,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:34:08,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:34:08,445 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:08,677 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2024-11-06 22:34:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 22:34:08,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-06 22:34:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:08,681 INFO L225 Difference]: With dead ends: 139 [2024-11-06 22:34:08,681 INFO L226 Difference]: Without dead ends: 107 [2024-11-06 22:34:08,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 22:34:08,683 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 93 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:08,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 223 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 22:34:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-06 22:34:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2024-11-06 22:34:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2024-11-06 22:34:08,696 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 37 [2024-11-06 22:34:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:08,697 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2024-11-06 22:34:08,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-06 22:34:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 22:34:08,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:08,698 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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 22:34:08,701 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 (7)] Ended with exit code 0 [2024-11-06 22:34:08,898 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 22:34:08,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:08,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:08,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1773150168, now seen corresponding path program 1 times [2024-11-06 22:34:08,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:08,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419321082] [2024-11-06 22:34:08,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:08,899 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 22:34:08,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:08,901 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 22:34:08,902 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 22:34:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:08,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 22:34:08,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:09,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:34:09,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419321082] [2024-11-06 22:34:09,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419321082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:34:09,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:34:09,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 22:34:09,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436153041] [2024-11-06 22:34:09,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:34:09,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 22:34:09,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:09,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 22:34:09,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:34:09,045 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:09,153 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2024-11-06 22:34:09,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 22:34:09,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-06 22:34:09,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:09,154 INFO L225 Difference]: With dead ends: 143 [2024-11-06 22:34:09,154 INFO L226 Difference]: Without dead ends: 115 [2024-11-06 22:34:09,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-06 22:34:09,155 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 58 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:09,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 144 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:34:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-06 22:34:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2024-11-06 22:34:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2024-11-06 22:34:09,163 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 37 [2024-11-06 22:34:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:09,163 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2024-11-06 22:34:09,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2024-11-06 22:34:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 22:34:09,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:09,164 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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 22:34:09,168 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 (8)] Forceful destruction successful, exit code 0 [2024-11-06 22:34:09,367 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 22:34:09,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:09,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1714044824, now seen corresponding path program 1 times [2024-11-06 22:34:09,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:09,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422015333] [2024-11-06 22:34:09,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:09,369 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 22:34:09,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:09,372 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 22:34:09,375 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 22:34:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:09,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 22:34:09,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:09,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:34:09,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:09,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422015333] [2024-11-06 22:34:09,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422015333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:34:09,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:34:09,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:34:09,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404013025] [2024-11-06 22:34:09,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:34:09,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:34:09,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:09,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:34:09,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:34:09,584 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:09,707 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2024-11-06 22:34:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:34:09,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-06 22:34:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:09,708 INFO L225 Difference]: With dead ends: 145 [2024-11-06 22:34:09,709 INFO L226 Difference]: Without dead ends: 113 [2024-11-06 22:34:09,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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 22:34:09,709 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:09,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 137 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:34:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-06 22:34:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2024-11-06 22:34:09,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2024-11-06 22:34:09,720 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 37 [2024-11-06 22:34:09,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:09,720 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2024-11-06 22:34:09,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2024-11-06 22:34:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 22:34:09,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:09,722 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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 22:34:09,726 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 22:34:09,922 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 22:34:09,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:09,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1288644661, now seen corresponding path program 1 times [2024-11-06 22:34:09,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:09,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425142544] [2024-11-06 22:34:09,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:09,923 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 22:34:09,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:09,927 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 22:34:09,928 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 22:34:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:10,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 22:34:10,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:10,167 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:10,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:34:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:10,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:10,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425142544] [2024-11-06 22:34:10,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425142544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:34:10,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:34:10,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 22:34:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002640006] [2024-11-06 22:34:10,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:34:10,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 22:34:10,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 22:34:10,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-06 22:34:10,328 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:11,362 INFO L93 Difference]: Finished difference Result 397 states and 537 transitions. [2024-11-06 22:34:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-06 22:34:11,363 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-06 22:34:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:11,365 INFO L225 Difference]: With dead ends: 397 [2024-11-06 22:34:11,365 INFO L226 Difference]: Without dead ends: 351 [2024-11-06 22:34:11,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2024-11-06 22:34:11,366 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 507 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:11,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 405 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 22:34:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-06 22:34:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 151. [2024-11-06 22:34:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.38) internal successors, (207), 150 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 207 transitions. [2024-11-06 22:34:11,394 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 207 transitions. Word has length 40 [2024-11-06 22:34:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:11,394 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 207 transitions. [2024-11-06 22:34:11,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 207 transitions. [2024-11-06 22:34:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 22:34:11,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:11,395 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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 22:34:11,401 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 (10)] Forceful destruction successful, exit code 0 [2024-11-06 22:34:11,597 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 22:34:11,598 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:11,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:11,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1588600624, now seen corresponding path program 1 times [2024-11-06 22:34:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770081013] [2024-11-06 22:34:11,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:11,600 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 22:34:11,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:11,602 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 22:34:11,604 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 22:34:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:11,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 22:34:11,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:11,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:34:11,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:11,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770081013] [2024-11-06 22:34:11,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770081013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:34:11,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:34:11,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 22:34:11,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695546589] [2024-11-06 22:34:11,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:34:11,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 22:34:11,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:11,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 22:34:11,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:34:11,739 INFO L87 Difference]: Start difference. First operand 151 states and 207 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:11,835 INFO L93 Difference]: Finished difference Result 206 states and 277 transitions. [2024-11-06 22:34:11,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 22:34:11,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-06 22:34:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:11,837 INFO L225 Difference]: With dead ends: 206 [2024-11-06 22:34:11,837 INFO L226 Difference]: Without dead ends: 143 [2024-11-06 22:34:11,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-06 22:34:11,838 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:11,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 180 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:34:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-06 22:34:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 126. [2024-11-06 22:34:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.32) internal successors, (165), 125 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 165 transitions. [2024-11-06 22:34:11,854 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 165 transitions. Word has length 40 [2024-11-06 22:34:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:11,854 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 165 transitions. [2024-11-06 22:34:11,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 165 transitions. [2024-11-06 22:34:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 22:34:11,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:11,855 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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 22:34:11,864 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 22:34:12,055 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 22:34:12,056 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:12,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:12,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1695274414, now seen corresponding path program 1 times [2024-11-06 22:34:12,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:12,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825833029] [2024-11-06 22:34:12,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:12,057 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 22:34:12,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:12,058 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 22:34:12,059 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 22:34:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:12,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 22:34:12,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:12,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:34:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:12,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:12,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825833029] [2024-11-06 22:34:12,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825833029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:34:12,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:34:12,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-06 22:34:12,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167650261] [2024-11-06 22:34:12,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:34:12,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 22:34:12,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:12,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 22:34:12,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-06 22:34:12,282 INFO L87 Difference]: Start difference. First operand 126 states and 165 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:12,539 INFO L93 Difference]: Finished difference Result 244 states and 316 transitions. [2024-11-06 22:34:12,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 22:34:12,539 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-06 22:34:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:12,541 INFO L225 Difference]: With dead ends: 244 [2024-11-06 22:34:12,541 INFO L226 Difference]: Without dead ends: 211 [2024-11-06 22:34:12,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-06 22:34:12,542 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 130 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:12,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 379 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 22:34:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-06 22:34:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 171. [2024-11-06 22:34:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 170 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 226 transitions. [2024-11-06 22:34:12,553 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 226 transitions. Word has length 42 [2024-11-06 22:34:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:12,553 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 226 transitions. [2024-11-06 22:34:12,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 226 transitions. [2024-11-06 22:34:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 22:34:12,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:12,555 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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 22:34:12,559 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 22:34:12,755 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 22:34:12,755 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:12,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1378003632, now seen corresponding path program 1 times [2024-11-06 22:34:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888247945] [2024-11-06 22:34:12,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:12,756 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 22:34:12,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:12,758 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 22:34:12,761 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 22:34:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:12,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 22:34:12,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:12,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:34:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:13,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:13,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888247945] [2024-11-06 22:34:13,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888247945] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:34:13,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:34:13,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 22:34:13,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162413898] [2024-11-06 22:34:13,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:34:13,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 22:34:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:13,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 22:34:13,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-06 22:34:13,165 INFO L87 Difference]: Start difference. First operand 171 states and 226 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:14,518 INFO L93 Difference]: Finished difference Result 442 states and 591 transitions. [2024-11-06 22:34:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-06 22:34:14,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-06 22:34:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:14,521 INFO L225 Difference]: With dead ends: 442 [2024-11-06 22:34:14,521 INFO L226 Difference]: Without dead ends: 440 [2024-11-06 22:34:14,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2024-11-06 22:34:14,522 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 295 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:14,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 510 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 22:34:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-06 22:34:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 225. [2024-11-06 22:34:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.3482142857142858) internal successors, (302), 224 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 302 transitions. [2024-11-06 22:34:14,536 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 302 transitions. Word has length 42 [2024-11-06 22:34:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:14,536 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 302 transitions. [2024-11-06 22:34:14,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 302 transitions. [2024-11-06 22:34:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 22:34:14,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:14,538 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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 22:34:14,542 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 (13)] Ended with exit code 0 [2024-11-06 22:34:14,738 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 22:34:14,738 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:14,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:14,739 INFO L85 PathProgramCache]: Analyzing trace with hash 208496234, now seen corresponding path program 2 times [2024-11-06 22:34:14,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:14,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717247878] [2024-11-06 22:34:14,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:34:14,739 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 22:34:14,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:14,743 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 22:34:14,744 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 22:34:14,820 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 22:34:14,820 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:34:14,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 22:34:14,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-06 22:34:14,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:34:14,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:14,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717247878] [2024-11-06 22:34:14,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717247878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:34:14,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:34:14,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:34:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634851938] [2024-11-06 22:34:14,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:34:14,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:34:14,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:14,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:34:14,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:34:14,856 INFO L87 Difference]: Start difference. First operand 225 states and 302 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:14,939 INFO L93 Difference]: Finished difference Result 305 states and 403 transitions. [2024-11-06 22:34:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 22:34:14,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-06 22:34:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:14,941 INFO L225 Difference]: With dead ends: 305 [2024-11-06 22:34:14,941 INFO L226 Difference]: Without dead ends: 243 [2024-11-06 22:34:14,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:34:14,941 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:14,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:34:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-06 22:34:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 222. [2024-11-06 22:34:14,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.3484162895927603) internal successors, (298), 221 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 298 transitions. [2024-11-06 22:34:14,958 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 298 transitions. Word has length 47 [2024-11-06 22:34:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:14,958 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 298 transitions. [2024-11-06 22:34:14,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 298 transitions. [2024-11-06 22:34:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 22:34:14,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:14,959 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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 22:34:14,962 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 22:34:15,159 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 22:34:15,159 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:15,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash 267601578, now seen corresponding path program 1 times [2024-11-06 22:34:15,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:15,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899758307] [2024-11-06 22:34:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:15,160 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 22:34:15,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:15,163 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 22:34:15,164 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 22:34:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:15,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 22:34:15,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:15,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:34:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:15,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:15,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899758307] [2024-11-06 22:34:15,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899758307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:34:15,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:34:15,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-06 22:34:15,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800364674] [2024-11-06 22:34:15,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:34:15,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 22:34:15,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:15,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 22:34:15,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-06 22:34:15,396 INFO L87 Difference]: Start difference. First operand 222 states and 298 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:15,951 INFO L93 Difference]: Finished difference Result 689 states and 907 transitions. [2024-11-06 22:34:15,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-06 22:34:15,951 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-06 22:34:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:15,954 INFO L225 Difference]: With dead ends: 689 [2024-11-06 22:34:15,954 INFO L226 Difference]: Without dead ends: 627 [2024-11-06 22:34:15,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2024-11-06 22:34:15,955 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 760 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:15,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 721 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 22:34:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-06 22:34:15,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 509. [2024-11-06 22:34:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.328740157480315) internal successors, (675), 508 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 675 transitions. [2024-11-06 22:34:15,974 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 675 transitions. Word has length 47 [2024-11-06 22:34:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:15,974 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 675 transitions. [2024-11-06 22:34:15,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 675 transitions. [2024-11-06 22:34:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 22:34:15,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:15,975 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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 22:34:15,980 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 (15)] Ended with exit code 0 [2024-11-06 22:34:16,179 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 22:34:16,179 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:16,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:16,180 INFO L85 PathProgramCache]: Analyzing trace with hash 100862541, now seen corresponding path program 1 times [2024-11-06 22:34:16,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:16,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759967761] [2024-11-06 22:34:16,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:16,180 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 22:34:16,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:16,182 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 22:34:16,183 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 22:34:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:16,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 22:34:16,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-06 22:34:16,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:34:16,397 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-06 22:34:16,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:16,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759967761] [2024-11-06 22:34:16,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759967761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:34:16,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:34:16,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-06 22:34:16,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599776913] [2024-11-06 22:34:16,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:34:16,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 22:34:16,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:16,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 22:34:16,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-06 22:34:16,399 INFO L87 Difference]: Start difference. First operand 509 states and 675 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:16,576 INFO L93 Difference]: Finished difference Result 844 states and 1110 transitions. [2024-11-06 22:34:16,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 22:34:16,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-06 22:34:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:16,579 INFO L225 Difference]: With dead ends: 844 [2024-11-06 22:34:16,579 INFO L226 Difference]: Without dead ends: 478 [2024-11-06 22:34:16,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-06 22:34:16,580 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 105 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:16,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 358 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:34:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-06 22:34:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 470. [2024-11-06 22:34:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.302771855010661) internal successors, (611), 469 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 611 transitions. [2024-11-06 22:34:16,597 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 611 transitions. Word has length 47 [2024-11-06 22:34:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:16,598 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 611 transitions. [2024-11-06 22:34:16,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 611 transitions. [2024-11-06 22:34:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 22:34:16,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:16,599 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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] [2024-11-06 22:34:16,603 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 (16)] Ended with exit code 0 [2024-11-06 22:34:16,799 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 22:34:16,800 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:16,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash 734702770, now seen corresponding path program 1 times [2024-11-06 22:34:16,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:16,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399146637] [2024-11-06 22:34:16,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:16,801 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 22:34:16,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:16,804 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 22:34:16,805 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 22:34:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:16,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 22:34:16,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:17,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:34:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:17,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:17,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399146637] [2024-11-06 22:34:17,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399146637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:34:17,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:34:17,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-06 22:34:17,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444522323] [2024-11-06 22:34:17,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:34:17,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-06 22:34:17,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:17,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-06 22:34:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-06 22:34:17,307 INFO L87 Difference]: Start difference. First operand 470 states and 611 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:18,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:18,605 INFO L93 Difference]: Finished difference Result 1092 states and 1416 transitions. [2024-11-06 22:34:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-06 22:34:18,607 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-06 22:34:18,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:18,610 INFO L225 Difference]: With dead ends: 1092 [2024-11-06 22:34:18,610 INFO L226 Difference]: Without dead ends: 719 [2024-11-06 22:34:18,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-11-06 22:34:18,612 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 412 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:18,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 647 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 22:34:18,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-06 22:34:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 524. [2024-11-06 22:34:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.311663479923518) internal successors, (686), 523 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 686 transitions. [2024-11-06 22:34:18,635 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 686 transitions. Word has length 48 [2024-11-06 22:34:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:18,635 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 686 transitions. [2024-11-06 22:34:18,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 686 transitions. [2024-11-06 22:34:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 22:34:18,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:18,636 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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 22:34:18,641 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 (17)] Forceful destruction successful, exit code 0 [2024-11-06 22:34:18,837 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 22:34:18,837 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:18,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:18,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1419752293, now seen corresponding path program 1 times [2024-11-06 22:34:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:18,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388293332] [2024-11-06 22:34:18,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:18,838 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 22:34:18,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:18,841 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 22:34:18,843 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 22:34:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:18,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 22:34:18,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-06 22:34:18,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:34:18,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:18,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388293332] [2024-11-06 22:34:18,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388293332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:34:18,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:34:18,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:34:18,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969377640] [2024-11-06 22:34:18,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:34:18,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:34:18,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:18,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:34:18,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:34:18,937 INFO L87 Difference]: Start difference. First operand 524 states and 686 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:18,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:18,971 INFO L93 Difference]: Finished difference Result 826 states and 1087 transitions. [2024-11-06 22:34:18,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:34:18,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-06 22:34:18,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:18,974 INFO L225 Difference]: With dead ends: 826 [2024-11-06 22:34:18,974 INFO L226 Difference]: Without dead ends: 548 [2024-11-06 22:34:18,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:34:18,974 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:18,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:34:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-06 22:34:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 534. [2024-11-06 22:34:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.3058161350844277) internal successors, (696), 533 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 696 transitions. [2024-11-06 22:34:18,993 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 696 transitions. Word has length 49 [2024-11-06 22:34:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:18,993 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 696 transitions. [2024-11-06 22:34:18,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 696 transitions. [2024-11-06 22:34:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 22:34:18,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:18,996 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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 22:34:19,000 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 (18)] Forceful destruction successful, exit code 0 [2024-11-06 22:34:19,196 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 22:34:19,197 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:19,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:19,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1026725283, now seen corresponding path program 1 times [2024-11-06 22:34:19,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:19,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777612487] [2024-11-06 22:34:19,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:19,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 22:34:19,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:19,199 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 22:34:19,200 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 22:34:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:19,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 22:34:19,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:19,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:34:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:19,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:19,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777612487] [2024-11-06 22:34:19,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777612487] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:34:19,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:34:19,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-06 22:34:19,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374868271] [2024-11-06 22:34:19,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:34:19,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-06 22:34:19,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:19,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-06 22:34:19,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-06 22:34:19,613 INFO L87 Difference]: Start difference. First operand 534 states and 696 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:20,545 INFO L93 Difference]: Finished difference Result 1005 states and 1302 transitions. [2024-11-06 22:34:20,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-06 22:34:20,546 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-06 22:34:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:20,548 INFO L225 Difference]: With dead ends: 1005 [2024-11-06 22:34:20,548 INFO L226 Difference]: Without dead ends: 700 [2024-11-06 22:34:20,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2024-11-06 22:34:20,550 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 669 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:20,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 704 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 22:34:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-06 22:34:20,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 556. [2024-11-06 22:34:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.3045045045045045) internal successors, (724), 555 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 724 transitions. [2024-11-06 22:34:20,576 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 724 transitions. Word has length 49 [2024-11-06 22:34:20,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:20,576 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 724 transitions. [2024-11-06 22:34:20,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 724 transitions. [2024-11-06 22:34:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 22:34:20,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:20,578 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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 22:34:20,582 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 (19)] Forceful destruction successful, exit code 0 [2024-11-06 22:34:20,778 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 22:34:20,778 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:20,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1028572325, now seen corresponding path program 1 times [2024-11-06 22:34:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:20,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294287358] [2024-11-06 22:34:20,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:20,779 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 22:34:20,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:20,783 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 22:34:20,784 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 22:34:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:20,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 22:34:20,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:21,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:34:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:21,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:21,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294287358] [2024-11-06 22:34:21,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294287358] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:34:21,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:34:21,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-11-06 22:34:21,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83728954] [2024-11-06 22:34:21,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:34:21,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-06 22:34:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:21,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-06 22:34:21,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-06 22:34:21,212 INFO L87 Difference]: Start difference. First operand 556 states and 724 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:23,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:23,034 INFO L93 Difference]: Finished difference Result 2184 states and 2856 transitions. [2024-11-06 22:34:23,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-06 22:34:23,034 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-06 22:34:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:23,040 INFO L225 Difference]: With dead ends: 2184 [2024-11-06 22:34:23,040 INFO L226 Difference]: Without dead ends: 2182 [2024-11-06 22:34:23,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2024-11-06 22:34:23,041 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 616 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:23,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 849 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 22:34:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2024-11-06 22:34:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 643. [2024-11-06 22:34:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.3255451713395638) internal successors, (851), 642 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 851 transitions. [2024-11-06 22:34:23,086 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 851 transitions. Word has length 49 [2024-11-06 22:34:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:23,087 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 851 transitions. [2024-11-06 22:34:23,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 851 transitions. [2024-11-06 22:34:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 22:34:23,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:23,088 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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 22:34:23,093 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 22:34:23,288 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 22:34:23,289 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:23,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:23,289 INFO L85 PathProgramCache]: Analyzing trace with hash 15608033, now seen corresponding path program 1 times [2024-11-06 22:34:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:23,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989351903] [2024-11-06 22:34:23,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:23,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 22:34:23,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:23,291 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 22:34:23,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 (21)] Waiting until timeout for monitored process [2024-11-06 22:34:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:34:23,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 22:34:23,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:34:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:23,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:34:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 22:34:23,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 22:34:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989351903] [2024-11-06 22:34:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989351903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:34:23,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:34:23,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-06 22:34:23,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232310344] [2024-11-06 22:34:23,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:34:23,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-06 22:34:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 22:34:23,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-06 22:34:23,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-06 22:34:23,717 INFO L87 Difference]: Start difference. First operand 643 states and 851 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:26,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:34:26,797 INFO L93 Difference]: Finished difference Result 2536 states and 3312 transitions. [2024-11-06 22:34:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-06 22:34:26,798 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-06 22:34:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:34:26,805 INFO L225 Difference]: With dead ends: 2536 [2024-11-06 22:34:26,805 INFO L226 Difference]: Without dead ends: 2534 [2024-11-06 22:34:26,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=380, Invalid=1782, Unknown=0, NotChecked=0, Total=2162 [2024-11-06 22:34:26,807 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 760 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:34:26,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1038 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 22:34:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2024-11-06 22:34:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 780. [2024-11-06 22:34:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 1.332477535301669) internal successors, (1038), 779 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1038 transitions. [2024-11-06 22:34:26,870 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1038 transitions. Word has length 49 [2024-11-06 22:34:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:34:26,870 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1038 transitions. [2024-11-06 22:34:26,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:34:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1038 transitions. [2024-11-06 22:34:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 22:34:26,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:34:26,871 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 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 22:34:26,886 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 22:34:27,072 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 22:34:27,072 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:34:27,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:34:27,073 INFO L85 PathProgramCache]: Analyzing trace with hash 17455075, now seen corresponding path program 1 times [2024-11-06 22:34:27,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 22:34:27,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940367778] [2024-11-06 22:34:27,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:34:27,073 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 22:34:27,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 22:34:27,075 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 22:34:27,076 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 22:34:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 22:34:27,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 22:34:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 22:34:27,283 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-06 22:34:27,283 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 22:34:27,284 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 22:34:27,292 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 (22)] Forceful destruction successful, exit code 0 [2024-11-06 22:34:27,486 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 22:34:27,489 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:34:27,529 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 22:34:27,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:34:27 BoogieIcfgContainer [2024-11-06 22:34:27,531 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 22:34:27,532 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 22:34:27,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 22:34:27,532 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 22:34:27,533 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:34:05" (3/4) ... [2024-11-06 22:34:27,536 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-06 22:34:27,537 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 22:34:27,538 INFO L158 Benchmark]: Toolchain (without parser) took 22265.60ms. Allocated memory was 83.9MB in the beginning and 92.3MB in the end (delta: 8.4MB). Free memory was 60.5MB in the beginning and 47.8MB in the end (delta: 12.7MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-11-06 22:34:27,538 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 83.9MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:34:27,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.07ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 47.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:34:27,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.15ms. Allocated memory is still 83.9MB. Free memory was 47.6MB in the beginning and 45.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:34:27,539 INFO L158 Benchmark]: Boogie Preprocessor took 47.05ms. Allocated memory is still 83.9MB. Free memory was 45.8MB in the beginning and 44.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:34:27,540 INFO L158 Benchmark]: RCFGBuilder took 386.02ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 27.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 22:34:27,540 INFO L158 Benchmark]: TraceAbstraction took 21573.06ms. Allocated memory was 83.9MB in the beginning and 92.3MB in the end (delta: 8.4MB). Free memory was 26.6MB in the beginning and 48.5MB in the end (delta: -21.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:34:27,541 INFO L158 Benchmark]: Witness Printer took 5.00ms. Allocated memory is still 92.3MB. Free memory was 47.8MB in the beginning and 47.8MB in the end (delta: 8.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:34:27,542 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.91ms. Allocated memory is still 83.9MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.07ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 47.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.15ms. Allocated memory is still 83.9MB. Free memory was 47.6MB in the beginning and 45.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.05ms. Allocated memory is still 83.9MB. Free memory was 45.8MB in the beginning and 44.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 386.02ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 27.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21573.06ms. Allocated memory was 83.9MB in the beginning and 92.3MB in the end (delta: 8.4MB). Free memory was 26.6MB in the beginning and 48.5MB in the end (delta: -21.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.00ms. Allocated memory is still 92.3MB. Free memory was 47.8MB in the beginning and 47.8MB in the end (delta: 8.6kB). 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: 16]: 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 strncpy at line 42. Possible FailurePath: [L86] char A [2 + 2 + 4 +1]; [L87] int i = 0; VAL [A={3:0}, i=0] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=1] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=2] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=3] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=4] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=5] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=6] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=7] [L87] COND FALSE !(i<2 + 2 + 4 -1) VAL [A={3:0}] [L90] A[2 + 2 + 4] = 0 [L91] CALL parse_expression_list (A) [L60] int start=0, i=-1, j=-1; [L61] char str2[2]; VAL [i=-1, start=0, str2={7:0}, str={3:0}] [L62] COND FALSE !(!str) VAL [i=-1, start=0, str2={7:0}, str={3:0}] [L64] i++ [L65] str[i] [L66] case 0: VAL [i=0, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=1, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=2, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={3:0}] [L67] (str[start] == ' ') || (str[start] == '\t') [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={3:0}] [L67] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L68] str[start] [L66] case 0: [L69] j = i-1 VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L71] EXPR str[j] [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L66] case 0: [L73] CALL r_strncpy(str2, str+start, j-start+1) [L42] return strncpy(dest,src,n); [L73] RET r_strncpy(str2, str+start, j-start+1) [L74] CALL __VERIFIER_assert(j - start + 1 < 2) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4493 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4493 mSDsluCounter, 7175 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6050 mSDsCounter, 225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5013 IncrementalHoareTripleChecker+Invalid, 5238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 225 mSolverCounterUnsat, 1125 mSDtfsCounter, 5013 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1357 GetRequests, 1085 SyntacticMatches, 1 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=20, InterpolantAutomatonStates: 256, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 4346 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 838 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1227 ConstructedInterpolants, 0 QuantifiedInterpolants, 3785 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2165 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 31 InterpolantComputations, 9 PerfectInterpolantSequences, 1219/1365 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 22:34:27,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample