./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.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', '99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6'] 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.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 99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:17:12,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:17:12,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:17:12,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:17:12,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:17:12,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:17:12,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:17:12,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:17:12,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:17:12,416 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:17:12,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:17:12,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:17:12,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:17:12,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:17:12,416 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:17:12,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:17:12,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:17:12,418 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:17:12,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:17:12,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:17:12,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:17:12,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:17:12,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:17:12,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:17:12,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:17:12,419 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:17:12,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:17:12,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:17:12,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:17:12,421 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 -> 99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6 [2024-11-07 10:17:12,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:17:12,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:17:12,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:17:12,717 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:17:12,717 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:17:12,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i [2024-11-07 10:17:14,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:17:14,278 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:17:14,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i [2024-11-07 10:17:14,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0141b3fa2/4e408e599c924de0a96d31a1f2596600/FLAG1584915c9 [2024-11-07 10:17:14,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0141b3fa2/4e408e599c924de0a96d31a1f2596600 [2024-11-07 10:17:14,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:17:14,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:17:14,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:17:14,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:17:14,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:17:14,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3247b408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14, skipping insertion in model container [2024-11-07 10:17:14,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:17:14,474 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i[916,929] [2024-11-07 10:17:14,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:17:14,550 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:17:14,561 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i[916,929] [2024-11-07 10:17:14,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:17:14,615 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:17:14,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14 WrapperNode [2024-11-07 10:17:14,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:17:14,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:17:14,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:17:14,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:17:14,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,698 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2024-11-07 10:17:14,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:17:14,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:17:14,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:17:14,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:17:14,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,755 INFO L175 MemorySlicer]: Split 110 memory accesses to 6 slices as follows [2, 16, 21, 39, 9, 23]. 35 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 3, 3, 1, 2]. The 15 writes are split as follows [0, 2, 4, 5, 2, 2]. [2024-11-07 10:17:14,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:17:14,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:17:14,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:17:14,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:17:14,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (1/1) ... [2024-11-07 10:17:14,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:17:14,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:17:14,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:17:14,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:17:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:17:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:17:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:17:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:17:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:17:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:17:14,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 10:17:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:17:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:17:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:17:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:17:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:17:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-07 10:17:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:17:14,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:17:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:17:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:17:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:17:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-07 10:17:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:17:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:17:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:17:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:17:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:17:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 10:17:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:17:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:17:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:17:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:17:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:17:14,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-07 10:17:14,888 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:17:14,888 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:17:14,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:17:14,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:17:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:17:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:17:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:17:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 10:17:14,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:17:14,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:17:15,028 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:17:15,030 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:17:15,552 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-11-07 10:17:15,553 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:17:15,565 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:17:15,567 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:17:15,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:17:15 BoogieIcfgContainer [2024-11-07 10:17:15,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:17:15,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:17:15,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:17:15,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:17:15,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:17:14" (1/3) ... [2024-11-07 10:17:15,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ddf0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:17:15, skipping insertion in model container [2024-11-07 10:17:15,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:14" (2/3) ... [2024-11-07 10:17:15,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ddf0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:17:15, skipping insertion in model container [2024-11-07 10:17:15,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:17:15" (3/3) ... [2024-11-07 10:17:15,577 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-78.i [2024-11-07 10:17:15,590 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:17:15,591 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:17:15,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:17:15,651 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;@12e45445, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:17:15,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:17:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 10:17:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 10:17:15,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:15,667 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:15,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:15,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:15,673 INFO L85 PathProgramCache]: Analyzing trace with hash -438494555, now seen corresponding path program 1 times [2024-11-07 10:17:15,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:15,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325792233] [2024-11-07 10:17:15,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:15,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:15,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:15,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:15,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:15,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:15,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:15,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:15,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:15,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:15,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 10:17:16,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:16,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325792233] [2024-11-07 10:17:16,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325792233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:16,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:17:16,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392196493] [2024-11-07 10:17:16,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:16,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:17:16,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:16,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:17:16,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:17:16,039 INFO L87 Difference]: Start difference. First operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:16,069 INFO L93 Difference]: Finished difference Result 179 states and 276 transitions. [2024-11-07 10:17:16,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:17:16,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-11-07 10:17:16,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:16,078 INFO L225 Difference]: With dead ends: 179 [2024-11-07 10:17:16,079 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 10:17:16,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:17:16,086 INFO L432 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:16,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:17:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 10:17:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-07 10:17:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 10:17:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-11-07 10:17:16,167 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 98 [2024-11-07 10:17:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:16,169 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-11-07 10:17:16,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-11-07 10:17:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 10:17:16,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:16,173 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:16,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:17:16,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:16,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1706018639, now seen corresponding path program 1 times [2024-11-07 10:17:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:16,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899212781] [2024-11-07 10:17:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:16,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 10:17:16,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:16,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899212781] [2024-11-07 10:17:16,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899212781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:16,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:16,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:17:16,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319424191] [2024-11-07 10:17:16,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:16,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:17:16,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:16,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:17:16,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:16,599 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:16,658 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2024-11-07 10:17:16,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:17:16,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-11-07 10:17:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:16,661 INFO L225 Difference]: With dead ends: 177 [2024-11-07 10:17:16,662 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:17:16,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-07 10:17:16,664 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:16,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:17:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:17:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 10:17:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 10:17:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-07 10:17:16,677 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 98 [2024-11-07 10:17:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:16,681 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-07 10:17:16,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:16,681 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-07 10:17:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 10:17:16,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:16,684 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:16,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:17:16,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:16,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash 322567471, now seen corresponding path program 1 times [2024-11-07 10:17:16,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:16,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880059088] [2024-11-07 10:17:16,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:16,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 10:17:16,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:16,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880059088] [2024-11-07 10:17:16,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880059088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:16,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:16,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:17:16,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832952651] [2024-11-07 10:17:16,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:16,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:17:16,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:16,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:17:16,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:16,975 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 10:17:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:17,019 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2024-11-07 10:17:17,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:17:17,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-11-07 10:17:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:17,024 INFO L225 Difference]: With dead ends: 181 [2024-11-07 10:17:17,024 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 10:17:17,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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-07 10:17:17,026 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:17,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:17:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 10:17:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 10:17:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 10:17:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-07 10:17:17,039 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 98 [2024-11-07 10:17:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:17,039 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-07 10:17:17,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 10:17:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-07 10:17:17,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 10:17:17,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:17,043 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:17,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:17:17,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:17,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash -561605494, now seen corresponding path program 1 times [2024-11-07 10:17:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:17,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9378301] [2024-11-07 10:17:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:17,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:17,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:17,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:17,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:17,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:17,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:17,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:17,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:17,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:17,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:17,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 10:17:17,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:17,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9378301] [2024-11-07 10:17:17,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9378301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:17,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:17,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:17:17,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268535676] [2024-11-07 10:17:17,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:17,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:17:17,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:17,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:17:17,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:17,464 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 10:17:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:17,550 INFO L93 Difference]: Finished difference Result 273 states and 393 transitions. [2024-11-07 10:17:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:17:17,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 100 [2024-11-07 10:17:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:17,555 INFO L225 Difference]: With dead ends: 273 [2024-11-07 10:17:17,556 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 10:17:17,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:17:17,560 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 83 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:17,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 355 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:17:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 10:17:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-11-07 10:17:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.394904458598726) internal successors, (219), 157 states have internal predecessors, (219), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:17:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 259 transitions. [2024-11-07 10:17:17,586 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 259 transitions. Word has length 100 [2024-11-07 10:17:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:17,587 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 259 transitions. [2024-11-07 10:17:17,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 10:17:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 259 transitions. [2024-11-07 10:17:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 10:17:17,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:17,590 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:17,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:17:17,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:17,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1582673848, now seen corresponding path program 1 times [2024-11-07 10:17:17,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:17,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393145503] [2024-11-07 10:17:17,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:17,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:18,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:17:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:18,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:17:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:18,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:17:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:18,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:17:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:17:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:18,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:17:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:18,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:17:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:18,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:17:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:18,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:17:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:18,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:17:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 10:17:18,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:17:18,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393145503] [2024-11-07 10:17:18,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393145503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:18,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:18,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:17:18,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520354060] [2024-11-07 10:17:18,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:18,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:17:18,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:17:18,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:17:18,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:17:18,237 INFO L87 Difference]: Start difference. First operand 180 states and 259 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:18,385 INFO L93 Difference]: Finished difference Result 439 states and 625 transitions. [2024-11-07 10:17:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:17:18,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2024-11-07 10:17:18,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:18,391 INFO L225 Difference]: With dead ends: 439 [2024-11-07 10:17:18,391 INFO L226 Difference]: Without dead ends: 262 [2024-11-07 10:17:18,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:17:18,394 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 49 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:18,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 602 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:17:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-07 10:17:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2024-11-07 10:17:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 229 states have (on average 1.3799126637554586) internal successors, (316), 231 states have internal predecessors, (316), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:17:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 364 transitions. [2024-11-07 10:17:18,425 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 364 transitions. Word has length 100 [2024-11-07 10:17:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:18,425 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 364 transitions. [2024-11-07 10:17:18,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 364 transitions. [2024-11-07 10:17:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 10:17:18,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:18,427 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:18,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:17:18,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:18,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:18,428 INFO L85 PathProgramCache]: Analyzing trace with hash -571556598, now seen corresponding path program 1 times [2024-11-07 10:17:18,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:17:18,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032930598] [2024-11-07 10:17:18,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:17:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:17:18,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:17:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:17:18,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:17:18,616 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:17:18,617 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:17:18,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:17:18,622 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 10:17:18,713 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:17:18,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:17:18 BoogieIcfgContainer [2024-11-07 10:17:18,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:17:18,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:17:18,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:17:18,717 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:17:18,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:17:15" (3/4) ... [2024-11-07 10:17:18,720 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:17:18,720 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:17:18,722 INFO L158 Benchmark]: Toolchain (without parser) took 4403.94ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 77.1MB in the beginning and 69.5MB in the end (delta: 7.5MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2024-11-07 10:17:18,724 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:17:18,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.31ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 62.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:17:18,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.13ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 59.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:17:18,725 INFO L158 Benchmark]: Boogie Preprocessor took 115.04ms. Allocated memory is still 100.7MB. Free memory was 59.7MB in the beginning and 55.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:17:18,725 INFO L158 Benchmark]: RCFGBuilder took 753.15ms. Allocated memory is still 100.7MB. Free memory was 55.5MB in the beginning and 63.8MB in the end (delta: -8.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-11-07 10:17:18,725 INFO L158 Benchmark]: TraceAbstraction took 3146.19ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 62.9MB in the beginning and 69.6MB in the end (delta: -6.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-07 10:17:18,725 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 125.8MB. Free memory was 69.6MB in the beginning and 69.5MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:17:18,727 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.25ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.31ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 62.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.13ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 59.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 115.04ms. Allocated memory is still 100.7MB. Free memory was 59.7MB in the beginning and 55.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 753.15ms. Allocated memory is still 100.7MB. Free memory was 55.5MB in the beginning and 63.8MB in the end (delta: -8.3MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3146.19ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 62.9MB in the beginning and 69.6MB in the end (delta: -6.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 125.8MB. Free memory was 69.6MB in the beginning and 69.5MB in the end (delta: 30.0kB). 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: 19]: 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 someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryArithmeticDOUBLEoperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryArithmeticFLOAToperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] double double_Array_0[3] = { 128.5, 0.0, 127.875 }; [L25-L27] double double_Array_0[3] = { 128.5, 0.0, 127.875 }; [L25-L27] double double_Array_0[3] = { 128.5, 0.0, 127.875 }; [L25-L27] double double_Array_0[3] = { 128.5, 0.0, 127.875 }; [L28-L30] float float_Array_0[3] = { 100.55, 4.75, 128.75 }; [L28-L30] float float_Array_0[3] = { 100.55, 4.75, 128.75 }; [L28-L30] float float_Array_0[3] = { 100.55, 4.75, 128.75 }; [L28-L30] float float_Array_0[3] = { 100.55, 4.75, 128.75 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -200 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -200 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 1 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 1 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 1 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] double_Array_0[1] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] CALL assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] RET assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] double_Array_0[2] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[2] [L78] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L78] EXPR double_Array_0[2] [L78] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] float_Array_0[1] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] float_Array_0[2] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[2] [L82] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L82] EXPR float_Array_0[2] [L82] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L98] RET updateVariables() [L99] CALL step() [L40] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L40] COND TRUE 0.8f > (- float_Array_0[1]) [L41] EXPR unsigned_char_Array_0[0] [L41] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L43] EXPR unsigned_char_Array_0[1] [L43] EXPR unsigned_char_Array_0[1] [L43] unsigned char stepLocal_1 = unsigned_char_Array_0[1] > unsigned_char_Array_0[1]; [L44] EXPR BOOL_unsigned_char_Array_0[0] [L44] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L45] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[1] && stepLocal_0) [L52] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L52] COND TRUE BOOL_unsigned_char_Array_0[1] [L53] EXPR float_Array_0[1] [L53] EXPR float_Array_0[2] [L53] float_Array_0[0] = (float_Array_0[1] - float_Array_0[2]) [L61] EXPR signed_long_int_Array_0[0] [L61] signed long int stepLocal_2 = signed_long_int_Array_0[0]; [L62] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L65] EXPR double_Array_0[1] [L65] EXPR double_Array_0[2] [L65] EXPR float_Array_0[2] [L65] double_Array_0[0] = ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2]) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR BOOL_unsigned_char_Array_0[1] [L90] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] [L90] EXPR BOOL_unsigned_char_Array_0[0] [L90] EXPR BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1 [L90] EXPR (BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1])))) [L90] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))) [L90] EXPR float_Array_0[0] [L90] EXPR float_Array_0[1] [L90] EXPR float_Array_0[2] [L90] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR (((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2]))))) && ((0.8f > (- float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] EXPR ((((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2]))))) && ((0.8f > (- float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90-L91] return ((((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? ((BOOL_unsigned_char_Array_0[1] && (unsigned_char_Array_0[1] > unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[0] == ((signed long int) ((unsigned_char_Array_0[1] + 5) - unsigned_char_Array_0[1])))) : 1) && (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : ((signed_long_int_Array_0[0] < unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) ((((float_Array_0[2]) > (float_Array_0[1])) ? (float_Array_0[2]) : (float_Array_0[1]))))) : (float_Array_0[0] == ((float) float_Array_0[1]))))) && ((signed_long_int_Array_0[0] <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (double_Array_0[0] == ((double) (float_Array_0[1] - 99.5))) : (double_Array_0[0] == ((double) ((double_Array_0[1] - double_Array_0[2]) - float_Array_0[2]))))) && ((0.8f > (- float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 1826 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1192 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 634 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=5, InterpolantAutomatonStates: 20, 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, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 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-07 10:17:18,752 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.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 99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:17:20,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:17:21,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:17:21,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:17:21,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:17:21,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:17:21,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:17:21,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:17:21,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:17:21,126 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:17:21,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:17:21,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:17:21,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:17:21,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:17:21,126 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:17:21,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:17:21,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:17:21,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:17:21,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:17:21,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:17:21,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:17:21,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:17:21,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:17:21,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:17:21,127 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:17:21,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:17:21,127 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:17:21,127 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:17:21,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:17:21,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:17:21,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:17:21,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:17:21,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:17:21,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:17:21,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:17:21,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:17:21,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:17:21,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:17:21,128 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:17:21,128 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:17:21,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:17:21,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:17:21,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:17:21,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:17:21,129 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 -> 99d92429afe7a1d3dd5b770cdd3a3c403da1aa6e04070cb3749a858d645383e6 [2024-11-07 10:17:21,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:17:21,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:17:21,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:17:21,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:17:21,463 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:17:21,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i [2024-11-07 10:17:22,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:17:23,075 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:17:23,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i [2024-11-07 10:17:23,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/340d2952d/2f2035e99c8f429287fb38a371c31e46/FLAG12c557a57 [2024-11-07 10:17:23,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/340d2952d/2f2035e99c8f429287fb38a371c31e46 [2024-11-07 10:17:23,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:17:23,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:17:23,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:17:23,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:17:23,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:17:23,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496fa61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23, skipping insertion in model container [2024-11-07 10:17:23,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:17:23,276 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i[916,929] [2024-11-07 10:17:23,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:17:23,375 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:17:23,386 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-78.i[916,929] [2024-11-07 10:17:23,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:17:23,445 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:17:23,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23 WrapperNode [2024-11-07 10:17:23,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:17:23,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:17:23,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:17:23,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:17:23,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,519 INFO L138 Inliner]: procedures = 36, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2024-11-07 10:17:23,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:17:23,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:17:23,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:17:23,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:17:23,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,592 INFO L175 MemorySlicer]: Split 110 memory accesses to 6 slices as follows [2, 16, 21, 39, 9, 23]. 35 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 3, 3, 1, 2]. The 15 writes are split as follows [0, 2, 4, 5, 2, 2]. [2024-11-07 10:17:23,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:17:23,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:17:23,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:17:23,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:17:23,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (1/1) ... [2024-11-07 10:17:23,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:17:23,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:17:23,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:17:23,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:17:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:17:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:17:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:17:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-07 10:17:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-07 10:17:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-07 10:17:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-07 10:17:23,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:17:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:17:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-07 10:17:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-07 10:17:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-07 10:17:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-07 10:17:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:17:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:17:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:17:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:17:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:17:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-07 10:17:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:17:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:17:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:17:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:17:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:17:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-07 10:17:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 10:17:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 10:17:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 10:17:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 10:17:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-07 10:17:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-07 10:17:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:17:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:17:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-07 10:17:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-07 10:17:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:17:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:17:23,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:17:23,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 10:17:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 10:17:23,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-07 10:17:23,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-07 10:17:23,912 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:17:23,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:17:25,336 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-07 10:17:25,336 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:17:25,352 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:17:25,352 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:17:25,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:17:25 BoogieIcfgContainer [2024-11-07 10:17:25,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:17:25,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:17:25,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:17:25,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:17:25,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:17:23" (1/3) ... [2024-11-07 10:17:25,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36173197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:17:25, skipping insertion in model container [2024-11-07 10:17:25,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:17:23" (2/3) ... [2024-11-07 10:17:25,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36173197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:17:25, skipping insertion in model container [2024-11-07 10:17:25,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:17:25" (3/3) ... [2024-11-07 10:17:25,362 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-78.i [2024-11-07 10:17:25,375 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:17:25,376 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:17:25,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:17:25,446 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;@1d16c7fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:17:25,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:17:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 10:17:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 10:17:25,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:25,464 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:25,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:25,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash -438494555, now seen corresponding path program 1 times [2024-11-07 10:17:25,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:25,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765274301] [2024-11-07 10:17:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:25,484 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-07 10:17:25,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:25,488 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-07 10:17:25,490 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-07 10:17:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:25,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:17:25,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-07 10:17:26,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:17:26,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:26,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765274301] [2024-11-07 10:17:26,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765274301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:26,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:26,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:17:26,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892225750] [2024-11-07 10:17:26,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:26,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:17:26,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:26,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:17:26,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:17:26,037 INFO L87 Difference]: Start difference. First operand has 93 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:26,070 INFO L93 Difference]: Finished difference Result 179 states and 276 transitions. [2024-11-07 10:17:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:17:26,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-11-07 10:17:26,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:26,078 INFO L225 Difference]: With dead ends: 179 [2024-11-07 10:17:26,078 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 10:17:26,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:17:26,086 INFO L432 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:26,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:17:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 10:17:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-07 10:17:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 10:17:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-11-07 10:17:26,132 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 98 [2024-11-07 10:17:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:26,133 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-11-07 10:17:26,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-11-07 10:17:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 10:17:26,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:26,138 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:26,151 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 (2)] Forceful destruction successful, exit code 0 [2024-11-07 10:17:26,339 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-07 10:17:26,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:26,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1706018639, now seen corresponding path program 1 times [2024-11-07 10:17:26,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:26,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790145701] [2024-11-07 10:17:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:26,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:17:26,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:26,346 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-07 10:17:26,347 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-07 10:17:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:26,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:17:26,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:17:26,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:17:26,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:26,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790145701] [2024-11-07 10:17:26,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790145701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:26,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:26,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:17:26,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551841972] [2024-11-07 10:17:26,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:26,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:17:26,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:26,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:17:26,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:26,789 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:26,883 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2024-11-07 10:17:26,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:17:26,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-11-07 10:17:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:26,889 INFO L225 Difference]: With dead ends: 177 [2024-11-07 10:17:26,889 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:17:26,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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-07 10:17:26,890 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:26,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:17:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:17:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 10:17:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 10:17:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-07 10:17:26,902 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 98 [2024-11-07 10:17:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:26,903 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-07 10:17:26,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-07 10:17:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 10:17:26,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:26,906 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:26,919 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 (3)] Forceful destruction successful, exit code 0 [2024-11-07 10:17:27,106 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-07 10:17:27,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:27,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:27,108 INFO L85 PathProgramCache]: Analyzing trace with hash 322567471, now seen corresponding path program 1 times [2024-11-07 10:17:27,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:27,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300976144] [2024-11-07 10:17:27,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:27,108 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-07 10:17:27,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:27,111 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-07 10:17:27,112 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-07 10:17:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:27,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:17:27,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:27,992 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 10:17:27,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:17:27,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:27,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300976144] [2024-11-07 10:17:27,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300976144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:27,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:27,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:17:27,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51447909] [2024-11-07 10:17:27,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:27,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:17:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:27,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:17:27,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:27,995 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 10:17:29,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:17:30,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:17:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:30,978 INFO L93 Difference]: Finished difference Result 267 states and 387 transitions. [2024-11-07 10:17:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:17:30,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-11-07 10:17:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:30,981 INFO L225 Difference]: With dead ends: 267 [2024-11-07 10:17:30,982 INFO L226 Difference]: Without dead ends: 179 [2024-11-07 10:17:30,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:17:30,986 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:30,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 355 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-07 10:17:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-07 10:17:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2024-11-07 10:17:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 153 states have (on average 1.4052287581699345) internal successors, (215), 153 states have internal predecessors, (215), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:17:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2024-11-07 10:17:31,018 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 98 [2024-11-07 10:17:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:31,018 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2024-11-07 10:17:31,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 10:17:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2024-11-07 10:17:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 10:17:31,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:31,021 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:31,033 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 (4)] Forceful destruction successful, exit code 0 [2024-11-07 10:17:31,221 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-07 10:17:31,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:31,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash -688549779, now seen corresponding path program 1 times [2024-11-07 10:17:31,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:31,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423830108] [2024-11-07 10:17:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:31,223 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-07 10:17:31,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:31,227 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-07 10:17:31,228 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-07 10:17:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:31,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 10:17:31,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 87 proven. 18 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-07 10:17:32,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:17:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 10:17:32,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:32,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423830108] [2024-11-07 10:17:32,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423830108] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:17:32,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:17:32,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-11-07 10:17:32,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883251209] [2024-11-07 10:17:32,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:32,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:17:32,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:32,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:17:32,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:17:32,571 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 10:17:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:32,923 INFO L93 Difference]: Finished difference Result 427 states and 613 transitions. [2024-11-07 10:17:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:17:32,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-11-07 10:17:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:32,929 INFO L225 Difference]: With dead ends: 427 [2024-11-07 10:17:32,929 INFO L226 Difference]: Without dead ends: 254 [2024-11-07 10:17:32,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:17:32,934 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 49 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:32,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 487 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:17:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-07 10:17:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2024-11-07 10:17:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 221 states have (on average 1.3936651583710407) internal successors, (308), 223 states have internal predecessors, (308), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:17:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 356 transitions. [2024-11-07 10:17:32,967 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 356 transitions. Word has length 98 [2024-11-07 10:17:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:32,968 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 356 transitions. [2024-11-07 10:17:32,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 10:17:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 356 transitions. [2024-11-07 10:17:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 10:17:32,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:32,970 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:32,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 10:17:33,170 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-07 10:17:33,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:33,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash -946715217, now seen corresponding path program 1 times [2024-11-07 10:17:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973480818] [2024-11-07 10:17:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:33,173 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-07 10:17:33,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:33,175 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-07 10:17:33,176 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-07 10:17:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:33,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:17:33,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 10:17:33,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:17:33,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:33,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973480818] [2024-11-07 10:17:33,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973480818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:33,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:33,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:17:33,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507866852] [2024-11-07 10:17:33,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:33,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:17:33,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:33,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:17:33,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:17:33,591 INFO L87 Difference]: Start difference. First operand 250 states and 356 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 10:17:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:33,647 INFO L93 Difference]: Finished difference Result 505 states and 721 transitions. [2024-11-07 10:17:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:17:33,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-11-07 10:17:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:33,654 INFO L225 Difference]: With dead ends: 505 [2024-11-07 10:17:33,654 INFO L226 Difference]: Without dead ends: 258 [2024-11-07 10:17:33,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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-07 10:17:33,657 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:33,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:17:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-07 10:17:33,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-07 10:17:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 229 states have (on average 1.3799126637554586) internal successors, (316), 231 states have internal predecessors, (316), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:17:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 364 transitions. [2024-11-07 10:17:33,701 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 364 transitions. Word has length 98 [2024-11-07 10:17:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:33,702 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 364 transitions. [2024-11-07 10:17:33,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 10:17:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 364 transitions. [2024-11-07 10:17:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 10:17:33,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:33,707 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:33,723 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-07 10:17:33,907 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-07 10:17:33,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:33,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:33,908 INFO L85 PathProgramCache]: Analyzing trace with hash -571556598, now seen corresponding path program 1 times [2024-11-07 10:17:33,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:33,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692727585] [2024-11-07 10:17:33,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:33,909 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-07 10:17:33,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:33,912 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-07 10:17:33,914 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-07 10:17:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:34,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:17:34,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:34,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:17:34,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 67 [2024-11-07 10:17:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:17:34,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:17:34,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:34,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692727585] [2024-11-07 10:17:34,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692727585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:34,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:34,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:17:34,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227224387] [2024-11-07 10:17:34,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:34,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:17:34,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:34,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:17:34,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:17:34,660 INFO L87 Difference]: Start difference. First operand 258 states and 364 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:36,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:17:37,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:17:40,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:17:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:41,460 INFO L93 Difference]: Finished difference Result 515 states and 727 transitions. [2024-11-07 10:17:41,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:17:41,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2024-11-07 10:17:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:41,463 INFO L225 Difference]: With dead ends: 515 [2024-11-07 10:17:41,463 INFO L226 Difference]: Without dead ends: 260 [2024-11-07 10:17:41,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:17:41,465 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 109 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:41,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 380 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-07 10:17:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-07 10:17:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2024-11-07 10:17:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 229 states have (on average 1.3711790393013101) internal successors, (314), 231 states have internal predecessors, (314), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:17:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 362 transitions. [2024-11-07 10:17:41,487 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 362 transitions. Word has length 100 [2024-11-07 10:17:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:41,487 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 362 transitions. [2024-11-07 10:17:41,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 362 transitions. [2024-11-07 10:17:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 10:17:41,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:41,491 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:41,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-07 10:17:41,692 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-07 10:17:41,692 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:41,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:41,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1465191154, now seen corresponding path program 1 times [2024-11-07 10:17:41,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:41,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733974819] [2024-11-07 10:17:41,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:41,693 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-07 10:17:41,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:41,695 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-07 10:17:41,696 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-07 10:17:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:42,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:17:42,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-07 10:17:42,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:17:42,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733974819] [2024-11-07 10:17:42,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733974819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:42,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:42,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:17:42,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605894828] [2024-11-07 10:17:42,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:42,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:17:42,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:42,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:17:42,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:17:42,256 INFO L87 Difference]: Start difference. First operand 258 states and 362 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-07 10:17:42,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:42,467 INFO L93 Difference]: Finished difference Result 525 states and 735 transitions. [2024-11-07 10:17:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:17:42,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2024-11-07 10:17:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:42,471 INFO L225 Difference]: With dead ends: 525 [2024-11-07 10:17:42,471 INFO L226 Difference]: Without dead ends: 266 [2024-11-07 10:17:42,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:17:42,472 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:42,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 543 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:17:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-07 10:17:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2024-11-07 10:17:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 229 states have (on average 1.3624454148471616) internal successors, (312), 231 states have internal predecessors, (312), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:17:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 360 transitions. [2024-11-07 10:17:42,496 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 360 transitions. Word has length 102 [2024-11-07 10:17:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:42,496 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 360 transitions. [2024-11-07 10:17:42,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-07 10:17:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 360 transitions. [2024-11-07 10:17:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 10:17:42,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:42,498 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:42,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 10:17:42,699 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-07 10:17:42,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:42,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash 921318352, now seen corresponding path program 1 times [2024-11-07 10:17:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010634626] [2024-11-07 10:17:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:42,700 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-07 10:17:42,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:42,703 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-07 10:17:42,704 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-07 10:17:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:43,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:17:43,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:43,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:17:43,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-07 10:17:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-07 10:17:43,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:17:43,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:43,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010634626] [2024-11-07 10:17:43,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010634626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:43,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:43,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:17:43,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214193254] [2024-11-07 10:17:43,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:43,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:17:43,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:43,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:17:43,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:17:43,446 INFO L87 Difference]: Start difference. First operand 258 states and 360 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:45,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:17:48,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:17:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:49,090 INFO L93 Difference]: Finished difference Result 515 states and 719 transitions. [2024-11-07 10:17:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:17:49,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2024-11-07 10:17:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:49,092 INFO L225 Difference]: With dead ends: 515 [2024-11-07 10:17:49,092 INFO L226 Difference]: Without dead ends: 260 [2024-11-07 10:17:49,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:17:49,093 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 99 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:49,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 369 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-07 10:17:49,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-07 10:17:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2024-11-07 10:17:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 229 states have (on average 1.3537117903930131) internal successors, (310), 231 states have internal predecessors, (310), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:17:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 358 transitions. [2024-11-07 10:17:49,116 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 358 transitions. Word has length 102 [2024-11-07 10:17:49,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:49,116 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 358 transitions. [2024-11-07 10:17:49,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 358 transitions. [2024-11-07 10:17:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:17:49,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:49,118 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:49,145 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-07 10:17:49,318 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-07 10:17:49,319 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:49,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1515475638, now seen corresponding path program 1 times [2024-11-07 10:17:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:49,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954664289] [2024-11-07 10:17:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:49,320 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-07 10:17:49,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:49,322 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-07 10:17:49,324 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-07 10:17:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:49,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:17:49,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:49,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-07 10:17:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:17:49,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:17:49,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:49,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954664289] [2024-11-07 10:17:49,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954664289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:49,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:49,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:17:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820385409] [2024-11-07 10:17:49,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:49,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:17:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:49,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:17:49,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:17:49,950 INFO L87 Difference]: Start difference. First operand 258 states and 358 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:51,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:17:53,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:17:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:53,615 INFO L93 Difference]: Finished difference Result 513 states and 713 transitions. [2024-11-07 10:17:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:17:53,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2024-11-07 10:17:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:53,618 INFO L225 Difference]: With dead ends: 513 [2024-11-07 10:17:53,618 INFO L226 Difference]: Without dead ends: 258 [2024-11-07 10:17:53,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:17:53,619 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 91 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:53,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 353 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-07 10:17:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-07 10:17:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 254. [2024-11-07 10:17:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 225 states have (on average 1.3511111111111112) internal successors, (304), 227 states have internal predecessors, (304), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:17:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 352 transitions. [2024-11-07 10:17:53,634 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 352 transitions. Word has length 104 [2024-11-07 10:17:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:53,635 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 352 transitions. [2024-11-07 10:17:53,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:17:53,635 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 352 transitions. [2024-11-07 10:17:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 10:17:53,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:53,637 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:53,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 10:17:53,837 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-07 10:17:53,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:53,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:53,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1481158802, now seen corresponding path program 1 times [2024-11-07 10:17:53,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:53,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289375279] [2024-11-07 10:17:53,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:53,839 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-07 10:17:53,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:53,843 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-07 10:17:53,844 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-07 10:17:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:54,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 10:17:54,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:54,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 40 [2024-11-07 10:17:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 24 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-07 10:17:54,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:17:54,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-11-07 10:17:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-07 10:17:54,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:54,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289375279] [2024-11-07 10:17:54,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289375279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:17:54,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:17:54,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-07 10:17:54,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292684001] [2024-11-07 10:17:54,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:17:54,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:17:54,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:54,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:17:54,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:17:54,947 INFO L87 Difference]: Start difference. First operand 254 states and 352 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-07 10:17:57,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:00,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:18:01,113 INFO L93 Difference]: Finished difference Result 535 states and 735 transitions. [2024-11-07 10:18:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 10:18:01,115 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 106 [2024-11-07 10:18:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:18:01,118 INFO L225 Difference]: With dead ends: 535 [2024-11-07 10:18:01,118 INFO L226 Difference]: Without dead ends: 262 [2024-11-07 10:18:01,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:18:01,120 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 107 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:18:01,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 534 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-07 10:18:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-07 10:18:01,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2024-11-07 10:18:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 225 states have (on average 1.3333333333333333) internal successors, (300), 227 states have internal predecessors, (300), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:18:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 348 transitions. [2024-11-07 10:18:01,138 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 348 transitions. Word has length 106 [2024-11-07 10:18:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:18:01,139 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 348 transitions. [2024-11-07 10:18:01,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) internal successors, (95), 12 states have internal predecessors, (95), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-07 10:18:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 348 transitions. [2024-11-07 10:18:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 10:18:01,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:18:01,140 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:18:01,159 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-07 10:18:01,341 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-07 10:18:01,341 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:18:01,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:18:01,341 INFO L85 PathProgramCache]: Analyzing trace with hash 94373392, now seen corresponding path program 1 times [2024-11-07 10:18:01,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:18:01,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709224387] [2024-11-07 10:18:01,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:18:01,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:18:01,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:18:01,344 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-07 10:18:01,345 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-07 10:18:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:18:01,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:18:01,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:18:01,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-07 10:18:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-07 10:18:01,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:18:01,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:18:01,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709224387] [2024-11-07 10:18:01,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709224387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:18:01,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:18:01,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:18:01,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870648921] [2024-11-07 10:18:01,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:18:01,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:18:01,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:18:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:18:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:18:01,965 INFO L87 Difference]: Start difference. First operand 254 states and 348 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:18:03,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:05,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:09,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:18:09,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:18:09,989 INFO L93 Difference]: Finished difference Result 507 states and 695 transitions. [2024-11-07 10:18:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:18:09,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2024-11-07 10:18:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:18:09,992 INFO L225 Difference]: With dead ends: 507 [2024-11-07 10:18:09,992 INFO L226 Difference]: Without dead ends: 256 [2024-11-07 10:18:09,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:18:09,993 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 79 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:18:09,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 340 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-07 10:18:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-07 10:18:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2024-11-07 10:18:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 225 states have (on average 1.3244444444444445) internal successors, (298), 227 states have internal predecessors, (298), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:18:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 346 transitions. [2024-11-07 10:18:10,005 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 346 transitions. Word has length 106 [2024-11-07 10:18:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:18:10,005 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 346 transitions. [2024-11-07 10:18:10,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 10:18:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 346 transitions. [2024-11-07 10:18:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:18:10,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:18:10,006 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:18:10,025 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-07 10:18:10,210 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-07 10:18:10,211 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:18:10,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:18:10,211 INFO L85 PathProgramCache]: Analyzing trace with hash 584822154, now seen corresponding path program 1 times [2024-11-07 10:18:10,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:18:10,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051051966] [2024-11-07 10:18:10,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:18:10,212 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-07 10:18:10,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:18:10,214 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-07 10:18:10,216 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-07 10:18:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:18:29,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 10:18:29,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:18:29,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:18:29,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 32 [2024-11-07 10:18:31,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:18:31,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 99 [2024-11-07 10:18:36,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:18:36,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 343 treesize of output 127 [2024-11-07 10:18:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 104 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-07 10:18:37,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:18:47,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:18:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051051966] [2024-11-07 10:18:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051051966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:18:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1899031902] [2024-11-07 10:18:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:18:47,355 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:18:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:18:47,358 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:18:47,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process