./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0930.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0930.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 d0cec7ddb8a2645a0ba1656999ba73d1a21b29e3fbe1129f436b67dd30c2f050 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:32:45,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:32:45,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:32:46,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:32:46,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:32:46,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:32:46,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:32:46,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:32:46,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:32:46,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:32:46,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:32:46,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:32:46,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:32:46,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:32:46,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:32:46,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:32:46,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:32:46,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:32:46,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:32:46,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:32:46,031 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:32:46,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:32:46,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:32:46,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:32:46,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:32:46,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:32:46,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:32:46,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:32:46,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:32:46,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:32:46,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:32:46,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:32:46,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:32:46,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:32:46,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:32:46,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:32:46,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:32:46,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:32:46,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:32:46,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:32:46,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:32:46,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:32:46,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:32:46,077 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:32:46,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:32:46,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:32:46,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:32:46,079 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:32:46,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:32:46,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:32:46,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:32:46,080 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:32:46,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:32:46,081 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:32:46,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:32:46,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:32:46,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:32:46,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:32:46,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:32:46,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:32:46,082 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:32:46,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:32:46,083 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:32:46,084 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:32:46,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:32:46,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:32:46,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:32:46,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:32:46,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:32:46,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:32:46,085 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:32:46,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:32:46,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:32:46,085 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:32:46,085 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:32:46,086 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:32:46,086 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> d0cec7ddb8a2645a0ba1656999ba73d1a21b29e3fbe1129f436b67dd30c2f050 [2022-07-22 14:32:46,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:32:46,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:32:46,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:32:46,337 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:32:46,338 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:32:46,339 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0930.c [2022-07-22 14:32:46,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1413b5f/d1490312ce654bf293ee1db1184d164b/FLAGdaba58c37 [2022-07-22 14:32:46,761 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:32:46,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0930.c [2022-07-22 14:32:46,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1413b5f/d1490312ce654bf293ee1db1184d164b/FLAGdaba58c37 [2022-07-22 14:32:47,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1413b5f/d1490312ce654bf293ee1db1184d164b [2022-07-22 14:32:47,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:32:47,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:32:47,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:32:47,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:32:47,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:32:47,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:32:47" (1/1) ... [2022-07-22 14:32:47,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413f28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47, skipping insertion in model container [2022-07-22 14:32:47,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:32:47" (1/1) ... [2022-07-22 14:32:47,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:32:47,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:32:47,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0930.c[3104,3117] [2022-07-22 14:32:47,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:32:47,382 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:32:47,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0930.c[3104,3117] [2022-07-22 14:32:47,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:32:47,439 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:32:47,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47 WrapperNode [2022-07-22 14:32:47,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:32:47,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:32:47,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:32:47,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:32:47,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47" (1/1) ... [2022-07-22 14:32:47,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47" (1/1) ... [2022-07-22 14:32:47,487 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2022-07-22 14:32:47,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:32:47,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:32:47,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:32:47,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:32:47,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47" (1/1) ... [2022-07-22 14:32:47,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47" (1/1) ... [2022-07-22 14:32:47,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47" (1/1) ... [2022-07-22 14:32:47,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47" (1/1) ... [2022-07-22 14:32:47,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47" (1/1) ... [2022-07-22 14:32:47,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47" (1/1) ... [2022-07-22 14:32:47,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47" (1/1) ... [2022-07-22 14:32:47,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:32:47,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:32:47,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:32:47,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:32:47,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47" (1/1) ... [2022-07-22 14:32:47,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:32:47,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:32:47,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:32:47,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:32:47,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:32:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:32:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:32:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-22 14:32:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:32:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-22 14:32:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:32:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:32:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 14:32:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:32:47,718 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:32:47,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:32:47,925 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:32:47,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:32:47,930 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-22 14:32:47,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:32:47 BoogieIcfgContainer [2022-07-22 14:32:47,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:32:47,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:32:47,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:32:47,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:32:47,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:32:47" (1/3) ... [2022-07-22 14:32:47,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497e3efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:32:47, skipping insertion in model container [2022-07-22 14:32:47,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:47" (2/3) ... [2022-07-22 14:32:47,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497e3efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:32:47, skipping insertion in model container [2022-07-22 14:32:47,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:32:47" (3/3) ... [2022-07-22 14:32:47,946 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0930.c [2022-07-22 14:32:47,957 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:32:47,959 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:32:47,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:32:48,004 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49d8836, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3cfd300c [2022-07-22 14:32:48,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:32:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:32:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 14:32:48,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:32:48,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:32:48,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:32:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:32:48,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1903470238, now seen corresponding path program 1 times [2022-07-22 14:32:48,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:32:48,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462559277] [2022-07-22 14:32:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:32:48,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:32:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:32:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:32:48,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:32:48,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462559277] [2022-07-22 14:32:48,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462559277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:32:48,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:32:48,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:32:48,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031700440] [2022-07-22 14:32:48,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:32:48,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:32:48,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:32:48,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:32:48,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:32:48,229 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:32:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:32:48,247 INFO L93 Difference]: Finished difference Result 74 states and 122 transitions. [2022-07-22 14:32:48,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:32:48,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 14:32:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:32:48,255 INFO L225 Difference]: With dead ends: 74 [2022-07-22 14:32:48,255 INFO L226 Difference]: Without dead ends: 35 [2022-07-22 14:32:48,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:32:48,260 INFO L413 NwaCegarLoop]: 51 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, 51 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 [2022-07-22 14:32:48,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:32:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-22 14:32:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-22 14:32:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:32:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2022-07-22 14:32:48,288 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 9 [2022-07-22 14:32:48,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:32:48,289 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2022-07-22 14:32:48,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:32:48,290 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-07-22 14:32:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 14:32:48,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:32:48,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:32:48,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:32:48,291 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:32:48,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:32:48,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1484880575, now seen corresponding path program 1 times [2022-07-22 14:32:48,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:32:48,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461051716] [2022-07-22 14:32:48,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:32:48,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:32:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 14:32:48,341 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 14:32:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 14:32:48,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 14:32:48,409 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 14:32:48,411 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 14:32:48,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:32:48,417 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-22 14:32:48,420 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 14:32:48,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 02:32:48 BoogieIcfgContainer [2022-07-22 14:32:48,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 14:32:48,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 14:32:48,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 14:32:48,456 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 14:32:48,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:32:47" (3/4) ... [2022-07-22 14:32:48,458 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 14:32:48,459 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 14:32:48,460 INFO L158 Benchmark]: Toolchain (without parser) took 1277.89ms. Allocated memory is still 132.1MB. Free memory was 102.0MB in the beginning and 91.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-07-22 14:32:48,460 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 48.1MB in the beginning and 48.1MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:32:48,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.48ms. Allocated memory is still 132.1MB. Free memory was 101.6MB in the beginning and 106.1MB in the end (delta: -4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 14:32:48,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.39ms. Allocated memory is still 132.1MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:32:48,466 INFO L158 Benchmark]: Boogie Preprocessor took 44.81ms. Allocated memory is still 132.1MB. Free memory was 104.0MB in the beginning and 102.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:32:48,467 INFO L158 Benchmark]: RCFGBuilder took 405.17ms. Allocated memory is still 132.1MB. Free memory was 102.5MB in the beginning and 88.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 14:32:48,467 INFO L158 Benchmark]: TraceAbstraction took 513.90ms. Allocated memory is still 132.1MB. Free memory was 87.3MB in the beginning and 91.9MB in the end (delta: -4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:32:48,467 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 132.1MB. Free memory was 91.9MB in the beginning and 91.2MB in the end (delta: 614.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:32:48,469 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 92.3MB. Free memory was 48.1MB in the beginning and 48.1MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.48ms. Allocated memory is still 132.1MB. Free memory was 101.6MB in the beginning and 106.1MB in the end (delta: -4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.39ms. Allocated memory is still 132.1MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.81ms. Allocated memory is still 132.1MB. Free memory was 104.0MB in the beginning and 102.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 405.17ms. Allocated memory is still 132.1MB. Free memory was 102.5MB in the beginning and 88.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 513.90ms. Allocated memory is still 132.1MB. Free memory was 87.3MB in the beginning and 91.9MB in the end (delta: -4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 132.1MB. Free memory was 91.9MB in the beginning and 91.2MB in the end (delta: 614.2kB). 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: 123]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryArithmeticFLOAToperation at line 34, overapproximation of bitwiseAnd at line 33. Possible FailurePath: [L14-L18] static const float ln2_hi_log = 6.9313812256e-01, ln2_lo_log = 9.0580006145e-06, two25_log = 3.355443200e+07, Lg1_log = 6.6666668653e-01, Lg2_log = 4.0000000596e-01, Lg3_log = 2.8571429849e-01, Lg4_log = 2.2222198546e-01, Lg5_log = 1.8183572590e-01, Lg6_log = 1.5313838422e-01, Lg7_log = 1.4798198640e-01; [L20] static const float zero_log = 0.0; VAL [Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, zero_log=0] [L118] float x = 1.0f; [L119] CALL, EXPR __ieee754_logf(x) [L23] float hfsq, f, s, z, R, w, t1, t2, dk; [L24] __int32_t k, ix, i, j; VAL [\old(x)=1, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, x=1, zero_log=0] [L27] ieee_float_shape_type gf_u; [L28] gf_u.value = (x) [L29] EXPR gf_u.word [L29] (ix) = gf_u.word [L32] k = 0 VAL [\old(x)=1, ix=-1, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, x=1, zero_log=0] [L33] COND TRUE ((ix & 0x7fffffff) == 0) [L34] return -two25_log / zero_log; VAL [\old(x)=1, ix=-1, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, x=1, zero_log=0] [L119] RET, EXPR __ieee754_logf(x) [L119] float res = __ieee754_logf(x); [L122] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, res=4294967296, res == 0.0f && __signbit_float(res) == 0=0, two25_log=33554432, x=1, zero_log=0] [L122] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L123] reach_error() VAL [Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, res=4294967296, two25_log=33554432, x=1, zero_log=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 51 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 [2022-07-22 14:32:48,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0930.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 d0cec7ddb8a2645a0ba1656999ba73d1a21b29e3fbe1129f436b67dd30c2f050 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:32:50,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:32:50,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:32:50,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:32:50,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:32:50,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:32:50,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:32:50,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:32:50,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:32:50,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:32:50,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:32:50,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:32:50,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:32:50,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:32:50,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:32:50,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:32:50,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:32:50,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:32:50,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:32:50,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:32:50,349 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:32:50,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:32:50,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:32:50,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:32:50,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:32:50,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:32:50,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:32:50,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:32:50,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:32:50,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:32:50,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:32:50,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:32:50,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:32:50,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:32:50,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:32:50,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:32:50,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:32:50,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:32:50,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:32:50,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:32:50,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:32:50,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:32:50,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 14:32:50,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:32:50,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:32:50,398 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:32:50,398 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:32:50,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:32:50,399 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:32:50,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:32:50,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:32:50,399 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:32:50,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:32:50,400 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:32:50,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:32:50,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:32:50,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:32:50,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:32:50,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:32:50,401 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 14:32:50,402 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 14:32:50,402 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 14:32:50,403 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:32:50,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:32:50,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:32:50,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:32:50,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:32:50,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:32:50,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:32:50,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:32:50,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:32:50,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:32:50,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:32:50,409 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 14:32:50,409 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 14:32:50,409 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:32:50,409 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:32:50,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:32:50,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 14:32:50,410 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> d0cec7ddb8a2645a0ba1656999ba73d1a21b29e3fbe1129f436b67dd30c2f050 [2022-07-22 14:32:50,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:32:50,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:32:50,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:32:50,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:32:50,705 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:32:50,706 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0930.c [2022-07-22 14:32:50,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ce5b8bf/56e21f4683f244ddb4e6aa3651d9d578/FLAG7cd4509e1 [2022-07-22 14:32:51,113 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:32:51,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0930.c [2022-07-22 14:32:51,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ce5b8bf/56e21f4683f244ddb4e6aa3651d9d578/FLAG7cd4509e1 [2022-07-22 14:32:51,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ce5b8bf/56e21f4683f244ddb4e6aa3651d9d578 [2022-07-22 14:32:51,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:32:51,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:32:51,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:32:51,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:32:51,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:32:51,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:32:51" (1/1) ... [2022-07-22 14:32:51,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8f3da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51, skipping insertion in model container [2022-07-22 14:32:51,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:32:51" (1/1) ... [2022-07-22 14:32:51,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:32:51,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:32:51,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0930.c[3104,3117] [2022-07-22 14:32:51,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:32:51,737 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:32:51,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0930.c[3104,3117] [2022-07-22 14:32:51,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:32:51,788 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:32:51,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51 WrapperNode [2022-07-22 14:32:51,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:32:51,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:32:51,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:32:51,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:32:51,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51" (1/1) ... [2022-07-22 14:32:51,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51" (1/1) ... [2022-07-22 14:32:51,836 INFO L137 Inliner]: procedures = 20, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 157 [2022-07-22 14:32:51,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:32:51,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:32:51,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:32:51,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:32:51,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51" (1/1) ... [2022-07-22 14:32:51,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51" (1/1) ... [2022-07-22 14:32:51,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51" (1/1) ... [2022-07-22 14:32:51,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51" (1/1) ... [2022-07-22 14:32:51,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51" (1/1) ... [2022-07-22 14:32:51,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51" (1/1) ... [2022-07-22 14:32:51,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51" (1/1) ... [2022-07-22 14:32:51,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:32:51,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:32:51,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:32:51,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:32:51,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51" (1/1) ... [2022-07-22 14:32:51,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:32:51,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:32:51,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:32:51,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:32:51,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:32:51,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 14:32:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:32:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-22 14:32:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 14:32:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:32:51,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:32:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-07-22 14:32:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 14:32:51,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:32:52,079 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:32:52,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:33:10,448 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:33:10,452 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:33:10,452 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-22 14:33:10,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:33:10 BoogieIcfgContainer [2022-07-22 14:33:10,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:33:10,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:33:10,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:33:10,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:33:10,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:32:51" (1/3) ... [2022-07-22 14:33:10,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f5c4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:33:10, skipping insertion in model container [2022-07-22 14:33:10,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:32:51" (2/3) ... [2022-07-22 14:33:10,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f5c4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:33:10, skipping insertion in model container [2022-07-22 14:33:10,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:33:10" (3/3) ... [2022-07-22 14:33:10,458 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0930.c [2022-07-22 14:33:10,468 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:33:10,468 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:33:10,499 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:33:10,503 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1423ef00, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ddfe396 [2022-07-22 14:33:10,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:33:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 14:33:10,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:33:10,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:33:10,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:33:10,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:33:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1904085918, now seen corresponding path program 1 times [2022-07-22 14:33:10,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:33:10,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667930356] [2022-07-22 14:33:10,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:33:10,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:33:10,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:33:10,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:33:10,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 14:33:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:33:10,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 14:33:10,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:33:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:33:10,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:33:10,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:33:10,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667930356] [2022-07-22 14:33:10,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667930356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:33:10,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:33:10,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:33:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294784633] [2022-07-22 14:33:10,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:33:10,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:33:10,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:33:10,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:33:10,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:33:10,940 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:10,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:33:10,950 INFO L93 Difference]: Finished difference Result 66 states and 106 transitions. [2022-07-22 14:33:10,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:33:10,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 14:33:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:33:10,957 INFO L225 Difference]: With dead ends: 66 [2022-07-22 14:33:10,957 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 14:33:10,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:33:10,961 INFO L413 NwaCegarLoop]: 45 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, 45 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 [2022-07-22 14:33:10,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:33:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 14:33:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-22 14:33:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-07-22 14:33:10,995 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 9 [2022-07-22 14:33:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:33:10,995 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-07-22 14:33:10,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-07-22 14:33:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 14:33:10,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:33:10,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:33:11,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:33:11,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:33:11,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:33:11,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:33:11,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1484264895, now seen corresponding path program 1 times [2022-07-22 14:33:11,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:33:11,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352635915] [2022-07-22 14:33:11,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:33:11,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:33:11,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:33:11,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:33:11,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 14:33:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:33:11,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 14:33:11,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:33:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:33:11,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:33:11,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:33:11,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352635915] [2022-07-22 14:33:11,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352635915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:33:11,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:33:11,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:33:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136036654] [2022-07-22 14:33:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:33:11,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:33:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:33:11,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:33:11,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:33:11,842 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:33:11,847 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-07-22 14:33:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:33:11,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-22 14:33:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:33:11,847 INFO L225 Difference]: With dead ends: 40 [2022-07-22 14:33:11,847 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 14:33:11,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:33:11,848 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:33:11,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-07-22 14:33:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 14:33:11,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-22 14:33:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-07-22 14:33:11,852 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2022-07-22 14:33:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:33:11,853 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-07-22 14:33:11,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-07-22 14:33:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 14:33:11,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:33:11,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:33:11,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:33:12,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:33:12,068 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:33:12,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:33:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1245957376, now seen corresponding path program 1 times [2022-07-22 14:33:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:33:12,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323632722] [2022-07-22 14:33:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:33:12,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:33:12,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:33:12,071 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:33:12,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 14:33:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:33:12,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 14:33:12,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:33:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:33:12,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:33:12,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:33:12,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323632722] [2022-07-22 14:33:12,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323632722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:33:12,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:33:12,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:33:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38305465] [2022-07-22 14:33:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:33:12,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:33:12,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:33:12,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:33:12,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:33:12,659 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:33:12,662 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-07-22 14:33:12,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:33:12,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-22 14:33:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:33:12,663 INFO L225 Difference]: With dead ends: 40 [2022-07-22 14:33:12,663 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 14:33:12,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:33:12,664 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:33:12,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-07-22 14:33:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 14:33:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-22 14:33:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-07-22 14:33:12,673 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 11 [2022-07-22 14:33:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:33:12,674 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-07-22 14:33:12,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-07-22 14:33:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 14:33:12,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:33:12,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:33:12,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:33:12,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:33:12,898 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:33:12,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:33:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash 21115748, now seen corresponding path program 1 times [2022-07-22 14:33:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:33:12,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114264735] [2022-07-22 14:33:12,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:33:12,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:33:12,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:33:12,903 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:33:12,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 14:33:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:33:13,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 14:33:13,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:33:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:33:13,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:33:13,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:33:13,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114264735] [2022-07-22 14:33:13,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114264735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:33:13,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:33:13,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:33:13,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952544278] [2022-07-22 14:33:13,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:33:13,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:33:13,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:33:13,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:33:13,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:33:13,339 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:33:13,342 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-07-22 14:33:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:33:13,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 14:33:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:33:13,343 INFO L225 Difference]: With dead ends: 40 [2022-07-22 14:33:13,343 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 14:33:13,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:33:13,344 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:33:13,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-07-22 14:33:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 14:33:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-22 14:33:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-22 14:33:13,349 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 12 [2022-07-22 14:33:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:33:13,349 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-22 14:33:13,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-22 14:33:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:33:13,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:33:13,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:33:13,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 14:33:13,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:33:13,565 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:33:13,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:33:13,566 INFO L85 PathProgramCache]: Analyzing trace with hash 933425138, now seen corresponding path program 1 times [2022-07-22 14:33:13,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:33:13,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066393306] [2022-07-22 14:33:13,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:33:13,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:33:13,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:33:13,568 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:33:13,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 14:33:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:33:13,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 14:33:13,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:33:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:33:14,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:33:14,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:33:14,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066393306] [2022-07-22 14:33:14,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066393306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:33:14,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:33:14,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:33:14,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547519112] [2022-07-22 14:33:14,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:33:14,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:33:14,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:33:14,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:33:14,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:33:14,386 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:14,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:33:14,420 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-22 14:33:14,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:33:14,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 14:33:14,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:33:14,422 INFO L225 Difference]: With dead ends: 45 [2022-07-22 14:33:14,422 INFO L226 Difference]: Without dead ends: 42 [2022-07-22 14:33:14,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:33:14,424 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:33:14,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 110 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-07-22 14:33:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-22 14:33:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-07-22 14:33:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-07-22 14:33:14,430 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 20 [2022-07-22 14:33:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:33:14,431 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-22 14:33:14,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-07-22 14:33:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:33:14,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:33:14,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:33:14,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-22 14:33:14,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:33:14,644 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:33:14,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:33:14,645 INFO L85 PathProgramCache]: Analyzing trace with hash 935272180, now seen corresponding path program 1 times [2022-07-22 14:33:14,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:33:14,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494213729] [2022-07-22 14:33:14,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:33:14,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:33:14,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:33:14,647 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:33:14,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 14:33:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:33:15,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 14:33:15,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:33:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:33:15,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:33:15,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:33:15,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494213729] [2022-07-22 14:33:15,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494213729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:33:15,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:33:15,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 14:33:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250601391] [2022-07-22 14:33:15,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:33:15,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:33:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:33:15,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:33:15,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:33:15,803 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:33:15,813 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-07-22 14:33:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 14:33:15,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 14:33:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:33:15,816 INFO L225 Difference]: With dead ends: 50 [2022-07-22 14:33:15,816 INFO L226 Difference]: Without dead ends: 41 [2022-07-22 14:33:15,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:33:15,817 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:33:15,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 106 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-07-22 14:33:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-22 14:33:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-07-22 14:33:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-07-22 14:33:15,823 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 20 [2022-07-22 14:33:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:33:15,823 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-07-22 14:33:15,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-07-22 14:33:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:33:15,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:33:15,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:33:15,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-22 14:33:16,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:33:16,029 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:33:16,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:33:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1142140884, now seen corresponding path program 1 times [2022-07-22 14:33:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:33:16,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475969226] [2022-07-22 14:33:16,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:33:16,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:33:16,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:33:16,032 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:33:16,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-22 14:33:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:33:16,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 14:33:16,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:33:16,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-22 14:33:17,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 93 treesize of output 57 [2022-07-22 14:33:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:33:17,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:33:17,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:33:17,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475969226] [2022-07-22 14:33:17,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475969226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:33:17,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:33:17,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 14:33:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858031611] [2022-07-22 14:33:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:33:17,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 14:33:17,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:33:17,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 14:33:17,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:33:17,793 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:20,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:22,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:24,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:27,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:29,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:31,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:33,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:35,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:37,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:39,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:41,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:43,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:45,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:33:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:33:45,595 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-07-22 14:33:45,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 14:33:45,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 14:33:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:33:45,600 INFO L225 Difference]: With dead ends: 59 [2022-07-22 14:33:45,600 INFO L226 Difference]: Without dead ends: 49 [2022-07-22 14:33:45,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-22 14:33:45,601 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 26 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2022-07-22 14:33:45,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 96 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 11 Unknown, 53 Unchecked, 27.5s Time] [2022-07-22 14:33:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-22 14:33:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2022-07-22 14:33:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-07-22 14:33:45,604 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 20 [2022-07-22 14:33:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:33:45,605 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-22 14:33:45,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-07-22 14:33:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:33:45,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:33:45,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:33:45,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-22 14:33:45,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:33:45,806 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:33:45,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:33:45,806 INFO L85 PathProgramCache]: Analyzing trace with hash -656486045, now seen corresponding path program 1 times [2022-07-22 14:33:45,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:33:45,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611550584] [2022-07-22 14:33:45,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:33:45,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:33:45,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:33:45,808 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:33:45,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-22 14:33:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:33:46,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 14:33:46,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:33:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:33:47,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:33:47,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:33:47,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611550584] [2022-07-22 14:33:47,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611550584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:33:47,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:33:47,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:33:47,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683537424] [2022-07-22 14:33:47,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:33:47,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:33:47,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:33:47,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:33:47,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:33:47,344 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:33:47,347 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-07-22 14:33:47,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:33:47,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 14:33:47,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:33:47,348 INFO L225 Difference]: With dead ends: 52 [2022-07-22 14:33:47,348 INFO L226 Difference]: Without dead ends: 40 [2022-07-22 14:33:47,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:33:47,349 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:33:47,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-07-22 14:33:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-22 14:33:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-22 14:33:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-07-22 14:33:47,354 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 20 [2022-07-22 14:33:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:33:47,355 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-07-22 14:33:47,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-07-22 14:33:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 14:33:47,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:33:47,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:33:47,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-22 14:33:47,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:33:47,571 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:33:47,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:33:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash 839503006, now seen corresponding path program 1 times [2022-07-22 14:33:47,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:33:47,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176954298] [2022-07-22 14:33:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:33:47,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:33:47,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:33:47,574 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:33:47,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-22 14:33:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:33:47,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 14:33:47,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:33:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:33:48,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:33:48,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:33:48,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176954298] [2022-07-22 14:33:48,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176954298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:33:48,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:33:48,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:33:48,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068903978] [2022-07-22 14:33:48,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:33:48,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:33:48,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:33:48,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:33:48,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:33:48,158 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:33:48,159 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-07-22 14:33:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:33:48,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-22 14:33:48,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:33:48,160 INFO L225 Difference]: With dead ends: 49 [2022-07-22 14:33:48,160 INFO L226 Difference]: Without dead ends: 25 [2022-07-22 14:33:48,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:33:48,161 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:33:48,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2022-07-22 14:33:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-22 14:33:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-22 14:33:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0) internal successors, (24), 24 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2022-07-22 14:33:48,163 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 22 [2022-07-22 14:33:48,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:33:48,163 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2022-07-22 14:33:48,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2022-07-22 14:33:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 14:33:48,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:33:48,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:33:48,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-22 14:33:48,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:33:48,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:33:48,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:33:48,365 INFO L85 PathProgramCache]: Analyzing trace with hash 722082119, now seen corresponding path program 1 times [2022-07-22 14:33:48,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:33:48,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657482929] [2022-07-22 14:33:48,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:33:48,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:33:48,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:33:48,367 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 14:33:48,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-22 14:33:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:33:48,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 14:33:48,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:33:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:33:49,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:33:49,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:33:49,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657482929] [2022-07-22 14:33:49,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657482929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:33:49,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:33:49,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 14:33:49,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752979015] [2022-07-22 14:33:49,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:33:49,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 14:33:49,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:33:49,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 14:33:49,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 14:33:49,786 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:33:49,956 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2022-07-22 14:33:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 14:33:49,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-22 14:33:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:33:49,958 INFO L225 Difference]: With dead ends: 25 [2022-07-22 14:33:49,958 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 14:33:49,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:33:49,959 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:33:49,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-22 14:33:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 14:33:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 14:33:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 14:33:49,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-07-22 14:33:49,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:33:49,961 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 14:33:49,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:33:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 14:33:49,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 14:33:49,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 14:33:49,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-22 14:33:50,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 14:33:50,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 14:33:51,151 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 96) no Hoare annotation was computed. [2022-07-22 14:33:51,151 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 65) no Hoare annotation was computed. [2022-07-22 14:33:51,151 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 97) no Hoare annotation was computed. [2022-07-22 14:33:51,151 INFO L902 garLoopResultBuilder]: At program point L127(lines 112 128) the Hoare annotation is: true [2022-07-22 14:33:51,151 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 14:33:51,151 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 14:33:51,151 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 103 107) no Hoare annotation was computed. [2022-07-22 14:33:51,151 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 38) no Hoare annotation was computed. [2022-07-22 14:33:51,151 INFO L895 garLoopResultBuilder]: At program point L103-2(lines 103 107) the Hoare annotation is: (and (or |ULTIMATE.start_main_#t~short10#1| (exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0))) (exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start___signbit_float_~x#1|))) [2022-07-22 14:33:51,151 INFO L899 garLoopResultBuilder]: For program point L103-3(lines 103 107) no Hoare annotation was computed. [2022-07-22 14:33:51,151 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 91) no Hoare annotation was computed. [2022-07-22 14:33:51,151 INFO L895 garLoopResultBuilder]: At program point L96(lines 22 98) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_logf_#res#1| ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)))) [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 47) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 47) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point L122-2(lines 122 125) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 123) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 34) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 74) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 42 46) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L895 garLoopResultBuilder]: At program point L42-2(lines 42 46) the Hoare annotation is: false [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 66) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L899 garLoopResultBuilder]: For program point L26-1(lines 26 30) no Hoare annotation was computed. [2022-07-22 14:33:51,152 INFO L895 garLoopResultBuilder]: At program point L26-2(lines 26 30) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0)) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_logf_~x#1| ((_ to_fp 8 24) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-22 14:33:51,153 INFO L899 garLoopResultBuilder]: For program point L26-3(lines 26 30) no Hoare annotation was computed. [2022-07-22 14:33:51,153 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 55) no Hoare annotation was computed. [2022-07-22 14:33:51,153 INFO L895 garLoopResultBuilder]: At program point L51-2(lines 51 55) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start___ieee754_logf_~ix~0#1_18| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start___ieee754_logf_~i~0#1| (bvand (bvadd (_ bv4913952 32) (bvand (_ bv8388607 32) |v_ULTIMATE.start___ieee754_logf_~ix~0#1_18|)) (_ bv8388608 32))) (= ((_ to_fp 8 24) currentRoundingMode 1.0) (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_logf_~ix~0#1_18|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_logf_~ix~0#1_18|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_logf_~ix~0#1_18|))) (= (bvmul (bvashr |v_ULTIMATE.start___ieee754_logf_~ix~0#1_18| (_ bv23 32)) (_ bv1 32)) (bvadd |ULTIMATE.start___ieee754_logf_~k~0#1| (_ bv127 32))))) (exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0)) (exists ((|v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15|) (_ bv0 32)))) (and (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) (= (bvand (_ bv8388607 32) .cse0) |ULTIMATE.start___ieee754_logf_~ix~0#1|)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-22 14:33:51,153 INFO L899 garLoopResultBuilder]: For program point L51-3(lines 51 55) no Hoare annotation was computed. [2022-07-22 14:33:51,153 INFO L895 garLoopResultBuilder]: At program point L109(lines 100 110) the Hoare annotation is: (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (or |ULTIMATE.start_main_#t~short10#1| (exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0)))) [2022-07-22 14:33:51,153 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 73) no Hoare annotation was computed. [2022-07-22 14:33:51,153 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 36) no Hoare annotation was computed. [2022-07-22 14:33:51,155 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:33:51,156 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 14:33:51,161 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,161 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,161 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,161 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,162 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,162 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,162 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,162 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,162 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,163 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,163 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,164 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:33:51,168 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,168 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,168 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,168 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,168 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,169 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,169 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,169 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,169 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,169 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,169 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,169 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:33:51,170 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,172 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,172 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,172 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,172 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,173 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,173 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:33:51,173 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,173 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,173 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:33:51,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 02:33:51 BoogieIcfgContainer [2022-07-22 14:33:51,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 14:33:51,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 14:33:51,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 14:33:51,175 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 14:33:51,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:33:10" (3/4) ... [2022-07-22 14:33:51,177 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 14:33:51,184 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-07-22 14:33:51,184 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-22 14:33:51,184 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 14:33:51,185 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 14:33:51,199 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-22 14:33:51,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: \result == ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE())) [2022-07-22 14:33:51,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_ULTIMATE.start___ieee754_logf_~ix~0#1_18 : bv32, currentRoundingMode : FloatRoundingMode :: (i == ~bvand32(~bvadd64(4913952bv32, ~bvand32(8388607bv32, v_ULTIMATE.start___ieee754_logf_~ix~0#1_18)), 8388608bv32) && ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0) == ~fp~LONGDOUBLE(v_ULTIMATE.start___ieee754_logf_~ix~0#1_18[31:31], v_ULTIMATE.start___ieee754_logf_~ix~0#1_18[30:23], v_ULTIMATE.start___ieee754_logf_~ix~0#1_18[22:0])) && ~bvmul32(~bvashr32(v_ULTIMATE.start___ieee754_logf_~ix~0#1_18, 23bv32), 1bv32) == ~bvadd64(k, 127bv32)) && (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log)) && (\exists v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15 : bv32 :: ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0) && ~bvand32(8388607bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32]) == ix)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-22 14:33:51,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-res == 0.0f && __signbit_float(res) == 0-aux || (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log)) && (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == x) [2022-07-22 14:33:51,201 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == 0bv32 && (aux-res == 0.0f && __signbit_float(res) == 0-aux || (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log)) [2022-07-22 14:33:51,215 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 14:33:51,216 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 14:33:51,216 INFO L158 Benchmark]: Toolchain (without parser) took 59700.65ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.7MB in the beginning and 31.1MB in the end (delta: 6.6MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-07-22 14:33:51,216 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.8MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:33:51,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.87ms. Allocated memory is still 58.7MB. Free memory was 37.6MB in the beginning and 40.3MB in the end (delta: -2.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 14:33:51,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.61ms. Allocated memory is still 58.7MB. Free memory was 40.3MB in the beginning and 38.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:33:51,217 INFO L158 Benchmark]: Boogie Preprocessor took 45.35ms. Allocated memory is still 58.7MB. Free memory was 38.2MB in the beginning and 36.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:33:51,218 INFO L158 Benchmark]: RCFGBuilder took 18569.66ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 36.4MB in the beginning and 49.0MB in the end (delta: -12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 14:33:51,218 INFO L158 Benchmark]: TraceAbstraction took 40719.29ms. Allocated memory is still 71.3MB. Free memory was 48.5MB in the beginning and 34.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2022-07-22 14:33:51,218 INFO L158 Benchmark]: Witness Printer took 41.30ms. Allocated memory is still 71.3MB. Free memory was 34.8MB in the beginning and 31.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 14:33:51,221 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.8MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.87ms. Allocated memory is still 58.7MB. Free memory was 37.6MB in the beginning and 40.3MB in the end (delta: -2.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.61ms. Allocated memory is still 58.7MB. Free memory was 40.3MB in the beginning and 38.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.35ms. Allocated memory is still 58.7MB. Free memory was 38.2MB in the beginning and 36.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 18569.66ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 36.4MB in the beginning and 49.0MB in the end (delta: -12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 40719.29ms. Allocated memory is still 71.3MB. Free memory was 48.5MB in the beginning and 34.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Witness Printer took 41.30ms. Allocated memory is still 71.3MB. Free memory was 34.8MB in the beginning and 31.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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 - PositiveResult [Line: 123]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 27.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 895 SdHoareTripleChecker+Invalid, 27.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 203 IncrementalHoareTripleChecker+Unchecked, 581 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 314 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 126 HoareAnnotationTreeSize, 7 FomulaSimplifications, 40 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 110 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 158 ConstructedInterpolants, 92 QuantifiedInterpolants, 1428 SizeOfPredicates, 62 NumberOfNonLiveVariables, 676 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 51]: Loop Invariant [2022-07-22 14:33:51,239 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,240 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,240 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,240 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,240 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,240 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,241 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,241 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,241 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,241 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,241 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:33:51,242 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,242 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,244 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,244 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-22 14:33:51,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,245 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-22 14:33:51,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((\exists v_ULTIMATE.start___ieee754_logf_~ix~0#1_18 : bv32, currentRoundingMode : FloatRoundingMode :: (i == ~bvand32(~bvadd64(4913952bv32, ~bvand32(8388607bv32, v_ULTIMATE.start___ieee754_logf_~ix~0#1_18)), 8388608bv32) && ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0) == ~fp~LONGDOUBLE(v_ULTIMATE.start___ieee754_logf_~ix~0#1_18[31:31], v_ULTIMATE.start___ieee754_logf_~ix~0#1_18[30:23], v_ULTIMATE.start___ieee754_logf_~ix~0#1_18[22:0])) && ~bvmul32(~bvashr32(v_ULTIMATE.start___ieee754_logf_~ix~0#1_18, 23bv32), 1bv32) == ~bvadd64(k, 127bv32)) && (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log)) && (\exists v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15 : bv32 :: ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0) && ~bvand32(8388607bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32]) == ix)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 100]: Loop Invariant [2022-07-22 14:33:51,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,246 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: \result == 0bv32 && (aux-res == 0.0f && __signbit_float(res) == 0-aux || (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log)) - InvariantResult [Line: 22]: Loop Invariant [2022-07-22 14:33:51,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: \result == ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 103]: Loop Invariant [2022-07-22 14:33:51,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,247 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (aux-res == 0.0f && __signbit_float(res) == 0-aux || (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log)) && (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 26]: Loop Invariant [2022-07-22 14:33:51,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,248 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-22 14:33:51,248 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,249 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-22 14:33:51,249 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-07-22 14:33:51,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE