./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/inv_Newton-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-benchs/inv_Newton-2.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 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:23:46,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:23:46,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:23:46,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:23:46,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:23:46,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:23:46,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:23:46,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:23:46,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:23:46,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:23:46,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:23:46,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:23:46,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:23:46,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:23:46,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:23:46,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:23:46,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:23:46,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:23:46,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:23:46,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:23:46,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:23:46,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:23:46,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:23:46,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:23:46,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:23:46,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:23:46,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:23:46,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:23:46,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:23:46,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:23:46,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:23:46,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:23:46,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:23:46,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:23:46,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:23:46,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:23:46,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:23:46,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:23:46,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:23:46,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:23:46,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:23:46,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:23:46,438 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:23:46,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:23:46,447 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:23:46,447 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:23:46,448 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:23:46,448 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:23:46,448 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:23:46,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:23:46,449 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:23:46,449 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:23:46,449 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:23:46,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:23:46,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:23:46,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:23:46,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:23:46,450 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:23:46,450 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:23:46,450 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:23:46,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:23:46,451 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:23:46,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:23:46,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:23:46,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:23:46,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:23:46,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:23:46,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:23:46,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:23:46,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:23:46,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:23:46,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:23:46,452 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:23:46,453 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:23:46,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:23:46,453 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 -> 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 [2022-02-20 16:23:46,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:23:46,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:23:46,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:23:46,625 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:23:46,625 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:23:46,626 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton-2.c [2022-02-20 16:23:46,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd014c29d/b4d3b7b8ac604f9ba2774b0c36159f9e/FLAG6c4d64023 [2022-02-20 16:23:47,029 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:23:47,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton-2.c [2022-02-20 16:23:47,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd014c29d/b4d3b7b8ac604f9ba2774b0c36159f9e/FLAG6c4d64023 [2022-02-20 16:23:47,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd014c29d/b4d3b7b8ac604f9ba2774b0c36159f9e [2022-02-20 16:23:47,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:23:47,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:23:47,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:23:47,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:23:47,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:23:47,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:23:47" (1/1) ... [2022-02-20 16:23:47,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af93c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47, skipping insertion in model container [2022-02-20 16:23:47,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:23:47" (1/1) ... [2022-02-20 16:23:47,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:23:47,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:23:47,187 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-benchs/inv_Newton-2.c[847,860] [2022-02-20 16:23:47,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:23:47,209 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:23:47,223 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-benchs/inv_Newton-2.c[847,860] [2022-02-20 16:23:47,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:23:47,240 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:23:47,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47 WrapperNode [2022-02-20 16:23:47,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:23:47,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:23:47,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:23:47,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:23:47,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47" (1/1) ... [2022-02-20 16:23:47,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47" (1/1) ... [2022-02-20 16:23:47,268 INFO L137 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2022-02-20 16:23:47,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:23:47,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:23:47,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:23:47,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:23:47,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47" (1/1) ... [2022-02-20 16:23:47,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47" (1/1) ... [2022-02-20 16:23:47,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47" (1/1) ... [2022-02-20 16:23:47,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47" (1/1) ... [2022-02-20 16:23:47,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47" (1/1) ... [2022-02-20 16:23:47,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47" (1/1) ... [2022-02-20 16:23:47,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47" (1/1) ... [2022-02-20 16:23:47,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:23:47,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:23:47,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:23:47,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:23:47,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47" (1/1) ... [2022-02-20 16:23:47,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:23:47,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:23:47,322 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-02-20 16:23:47,324 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-02-20 16:23:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:23:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:23:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:23:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:23:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:23:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:23:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:23:47,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:23:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:23:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:23:47,406 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:23:47,407 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:23:47,526 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:23:47,531 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:23:47,531 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:23:47,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:47 BoogieIcfgContainer [2022-02-20 16:23:47,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:23:47,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:23:47,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:23:47,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:23:47,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:23:47" (1/3) ... [2022-02-20 16:23:47,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7621a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:23:47, skipping insertion in model container [2022-02-20 16:23:47,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:47" (2/3) ... [2022-02-20 16:23:47,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7621a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:23:47, skipping insertion in model container [2022-02-20 16:23:47,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:47" (3/3) ... [2022-02-20 16:23:47,544 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton-2.c [2022-02-20 16:23:47,559 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:23:47,559 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:23:47,587 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:23:47,592 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:23:47,599 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:23:47,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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-02-20 16:23:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:23:47,622 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:47,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:47,623 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-02-20 16:23:47,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:23:47,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286818798] [2022-02-20 16:23:47,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:47,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:23:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:47,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {17#true} is VALID [2022-02-20 16:23:47,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~a~0#1, main_~r~0#1;havoc main_~a~0#1;havoc main_~r~0#1;main_~a~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~a~0#1, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0#1, 30.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {17#true} is VALID [2022-02-20 16:23:47,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {17#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {18#false} is VALID [2022-02-20 16:23:47,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {18#false} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_inv } true;inv_#in~A#1 := main_~a~0#1;havoc inv_#res#1;havoc inv_#t~mem4#1, inv_#t~mem5#1, inv_~A#1, inv_~xi~0#1, inv_~xsi~0#1, inv_~temp~0#1, inv_~cond~0#1, inv_~exp~0#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset;inv_~A#1 := inv_#in~A#1;havoc inv_~xi~0#1;havoc inv_~xsi~0#1;havoc inv_~temp~0#1;havoc inv_~cond~0#1;havoc inv_~exp~0#1;call inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset := #Ultimate.allocOnStack(8);call inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset := #Ultimate.allocOnStack(8);call write~real(inv_~A#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 8);call inv_#t~mem4#1 := read~int(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 4);inv_~exp~0#1 := (if 0 == inv_#t~mem4#1 then 0 else (if 1 == inv_#t~mem4#1 then 0 else ~bitwiseAnd(inv_#t~mem4#1, 2146435072))) / 1048576 - 1023;havoc inv_#t~mem4#1;call write~real(~convertINTToDOUBLE(1), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8);call write~int(1048576 * (1023 - inv_~exp~0#1), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 4);call inv_#t~mem5#1 := read~real(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8);inv_~xi~0#1 := inv_#t~mem5#1;havoc inv_#t~mem5#1;inv_~cond~0#1 := 1; {18#false} is VALID [2022-02-20 16:23:47,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {18#false} assume !(0 != inv_~cond~0#1); {18#false} is VALID [2022-02-20 16:23:47,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {18#false} inv_#res#1 := inv_~xi~0#1;call ULTIMATE.dealloc(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset);havoc inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset;call ULTIMATE.dealloc(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset);havoc inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset; {18#false} is VALID [2022-02-20 16:23:47,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {18#false} main_#t~ret7#1 := inv_#res#1;assume { :end_inline_inv } true;main_~r~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0#1, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0#1, 0.06) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {18#false} is VALID [2022-02-20 16:23:47,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {18#false} assume 0 == __VERIFIER_assert_~cond#1; {18#false} is VALID [2022-02-20 16:23:47,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {18#false} assume !false; {18#false} is VALID [2022-02-20 16:23:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:23:47,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:23:47,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286818798] [2022-02-20 16:23:47,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286818798] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:23:47,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:23:47,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:23:47,796 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929778447] [2022-02-20 16:23:47,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:23:47,800 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-02-20 16:23:47,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:23:47,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 16:23:47,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:47,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:23:47,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:23:47,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:23:47,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:23:47,856 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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-02-20 16:23:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:47,887 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 16:23:47,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:23:47,887 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-02-20 16:23:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 16:23:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2022-02-20 16:23:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 16:23:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2022-02-20 16:23:47,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 30 transitions. [2022-02-20 16:23:47,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:47,937 INFO L225 Difference]: With dead ends: 25 [2022-02-20 16:23:47,938 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 16:23:47,940 INFO L932 BasicCegarLoop]: 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-02-20 16:23:47,943 INFO L933 BasicCegarLoop]: 14 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, 14 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-02-20 16:23:47,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:23:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 16:23:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-20 16:23:47,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:47,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-02-20 16:23:47,964 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-02-20 16:23:47,964 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-02-20 16:23:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:47,966 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 16:23:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:23:47,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:47,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:47,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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) Second operand 10 states. [2022-02-20 16:23:47,967 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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) Second operand 10 states. [2022-02-20 16:23:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:47,971 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 16:23:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:23:47,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:47,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:47,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:47,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-02-20 16:23:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-02-20 16:23:47,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-02-20 16:23:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:47,975 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-02-20 16:23:47,975 INFO L471 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-02-20 16:23:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:23:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:23:47,976 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:47,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:47,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:23:47,978 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-02-20 16:23:47,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:23:47,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036115986] [2022-02-20 16:23:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:47,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:23:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:48,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {86#true} is VALID [2022-02-20 16:23:48,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~a~0#1, main_~r~0#1;havoc main_~a~0#1;havoc main_~r~0#1;main_~a~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~a~0#1, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0#1, 30.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {86#true} is VALID [2022-02-20 16:23:48,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {86#true} assume !(0 == assume_abort_if_not_~cond#1); {86#true} is VALID [2022-02-20 16:23:48,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {86#true} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_inv } true;inv_#in~A#1 := main_~a~0#1;havoc inv_#res#1;havoc inv_#t~mem4#1, inv_#t~mem5#1, inv_~A#1, inv_~xi~0#1, inv_~xsi~0#1, inv_~temp~0#1, inv_~cond~0#1, inv_~exp~0#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset;inv_~A#1 := inv_#in~A#1;havoc inv_~xi~0#1;havoc inv_~xsi~0#1;havoc inv_~temp~0#1;havoc inv_~cond~0#1;havoc inv_~exp~0#1;call inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset := #Ultimate.allocOnStack(8);call inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset := #Ultimate.allocOnStack(8);call write~real(inv_~A#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 8);call inv_#t~mem4#1 := read~int(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 4);inv_~exp~0#1 := (if 0 == inv_#t~mem4#1 then 0 else (if 1 == inv_#t~mem4#1 then 0 else ~bitwiseAnd(inv_#t~mem4#1, 2146435072))) / 1048576 - 1023;havoc inv_#t~mem4#1;call write~real(~convertINTToDOUBLE(1), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8);call write~int(1048576 * (1023 - inv_~exp~0#1), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 4);call inv_#t~mem5#1 := read~real(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8);inv_~xi~0#1 := inv_#t~mem5#1;havoc inv_#t~mem5#1;inv_~cond~0#1 := 1; {88#(= |ULTIMATE.start_inv_~cond~0#1| 1)} is VALID [2022-02-20 16:23:48,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {88#(= |ULTIMATE.start_inv_~cond~0#1| 1)} assume !(0 != inv_~cond~0#1); {87#false} is VALID [2022-02-20 16:23:48,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {87#false} inv_#res#1 := inv_~xi~0#1;call ULTIMATE.dealloc(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset);havoc inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset;call ULTIMATE.dealloc(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset);havoc inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset; {87#false} is VALID [2022-02-20 16:23:48,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {87#false} main_#t~ret7#1 := inv_#res#1;assume { :end_inline_inv } true;main_~r~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0#1, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0#1, 0.06) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {87#false} is VALID [2022-02-20 16:23:48,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {87#false} assume 0 == __VERIFIER_assert_~cond#1; {87#false} is VALID [2022-02-20 16:23:48,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {87#false} assume !false; {87#false} is VALID [2022-02-20 16:23:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:23:48,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:23:48,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036115986] [2022-02-20 16:23:48,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036115986] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:23:48,086 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:23:48,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:23:48,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372312087] [2022-02-20 16:23:48,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:23:48,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:48,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:23:48,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:48,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:48,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:23:48,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:23:48,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:23:48,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:23:48,103 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:48,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:48,129 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 16:23:48,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:23:48,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:48,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 16:23:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 16:23:48,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2022-02-20 16:23:48,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:48,149 INFO L225 Difference]: With dead ends: 16 [2022-02-20 16:23:48,149 INFO L226 Difference]: Without dead ends: 11 [2022-02-20 16:23:48,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:23:48,151 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:23:48,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:23:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-20 16:23:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-20 16:23:48,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:48,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-02-20 16:23:48,155 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-02-20 16:23:48,155 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-02-20 16:23:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:48,156 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:23:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:23:48,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:48,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:48,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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) Second operand 11 states. [2022-02-20 16:23:48,158 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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) Second operand 11 states. [2022-02-20 16:23:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:48,160 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:23:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:23:48,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:48,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:48,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:48,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-02-20 16:23:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-02-20 16:23:48,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-02-20 16:23:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:48,164 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-02-20 16:23:48,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:23:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:23:48,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:48,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:48,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:23:48,165 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:48,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:48,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-02-20 16:23:48,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:23:48,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890383916] [2022-02-20 16:23:48,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:48,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:23:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:23:48,215 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:23:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:23:48,261 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:23:48,261 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:23:48,262 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:23:48,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:23:48,266 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:23:48,267 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:23:48,283 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:23:48,283 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:23:48,283 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:23:48,283 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:23:48,283 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:23:48,284 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-02-20 16:23:48,284 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-02-20 16:23:48,284 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-02-20 16:23:48,284 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-02-20 16:23:48,284 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:23:48,284 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:23:48,284 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:23:48,284 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:23:48,284 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:23:48,284 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-02-20 16:23:48,284 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:23:48,285 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:23:48,285 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:23:48,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:23:48 BoogieIcfgContainer [2022-02-20 16:23:48,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:23:48,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:23:48,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:23:48,286 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:23:48,286 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:47" (3/4) ... [2022-02-20 16:23:48,288 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:23:48,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:23:48,289 INFO L158 Benchmark]: Toolchain (without parser) took 1240.34ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 66.6MB in the beginning and 61.7MB in the end (delta: 4.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-02-20 16:23:48,289 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:23:48,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.76ms. Allocated memory is still 98.6MB. Free memory was 66.4MB in the beginning and 72.1MB in the end (delta: -5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:23:48,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.38ms. Allocated memory is still 98.6MB. Free memory was 72.1MB in the beginning and 70.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:23:48,291 INFO L158 Benchmark]: Boogie Preprocessor took 25.15ms. Allocated memory is still 98.6MB. Free memory was 70.1MB in the beginning and 68.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:23:48,291 INFO L158 Benchmark]: RCFGBuilder took 238.16ms. Allocated memory is still 98.6MB. Free memory was 68.7MB in the beginning and 57.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:23:48,291 INFO L158 Benchmark]: TraceAbstraction took 750.34ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 56.4MB in the beginning and 62.3MB in the end (delta: -5.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-02-20 16:23:48,292 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 119.5MB. Free memory was 62.3MB in the beginning and 61.7MB in the end (delta: 601.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:23:48,293 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.76ms. Allocated memory is still 98.6MB. Free memory was 66.4MB in the beginning and 72.1MB in the end (delta: -5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.38ms. Allocated memory is still 98.6MB. Free memory was 72.1MB in the beginning and 70.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.15ms. Allocated memory is still 98.6MB. Free memory was 70.1MB in the beginning and 68.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 238.16ms. Allocated memory is still 98.6MB. Free memory was 68.7MB in the beginning and 57.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 750.34ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 56.4MB in the beginning and 62.3MB in the end (delta: -5.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 119.5MB. Free memory was 62.3MB in the beginning and 61.7MB in the end (delta: 601.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 23]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 37, overapproximation of someBinaryArithmeticDOUBLEoperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of to_real at line 38. Possible FailurePath: [L53] double a,r; [L55] a = __VERIFIER_nondet_double() [L56] CALL assume_abort_if_not(a >= 20. && a <= 30.) [L21] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L56] RET assume_abort_if_not(a >= 20. && a <= 30.) [L58] CALL, EXPR inv(a) [L33] double xi, xsi, temp; [L34] signed int cond, exp; [L35] union double_int A_u, xi_u; [L36] A_u.d = A [L37] EXPR A_u.i [L37] exp = (signed int) ((A_u.i & 0x7FF00000) >> 20) - 1023 [L38] xi_u.d = 1 [L39] xi_u.i = ((1023-exp) << 20) [L40] EXPR xi_u.d [L40] xi = xi_u.d [L41] cond = 1 VAL [\old(A)=2145386501, A=2145386501, A_u={4:0}, cond=1, exp=-1023, xi=2145386500, xi_u={5:0}] [L42] COND TRUE \read(cond) [L43] xsi = 2*xi-A*xi*xi [L44] temp = xsi-xi [L45] cond = ((temp > 1e-10) || (temp < -1e-10)) [L46] xi = xsi VAL [\old(A)=2145386501, A=2145386501, A_u={4:0}, cond=0, exp=-1023, xi=2145386497, xi_u={5:0}, xsi=2145386497] [L42] COND FALSE !(\read(cond)) VAL [\old(A)=2145386501, A=2145386501, A_u={4:0}, cond=0, exp=-1023, xi=2145386497, xi_u={5:0}, xsi=2145386497] [L48] return xi; [L48] return xi; [L48] return xi; VAL [\old(A)=2145386501, \result=2145386497, A=2145386501, cond=0, exp=-1023, xi=2145386497, xsi=2145386497] [L58] RET, EXPR inv(a) [L58] r = inv(a) [L60] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) [L23] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L23] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 23 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-02-20 16:23:48,322 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 -ea -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-benchs/inv_Newton-2.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 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:23:49,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:23:49,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:23:49,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:23:49,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:23:49,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:23:49,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:23:49,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:23:49,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:23:49,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:23:49,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:23:49,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:23:49,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:23:49,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:23:49,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:23:49,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:23:49,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:23:49,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:23:49,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:23:49,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:23:49,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:23:49,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:23:49,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:23:49,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:23:49,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:23:49,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:23:49,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:23:49,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:23:49,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:23:49,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:23:49,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:23:49,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:23:49,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:23:49,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:23:49,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:23:49,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:23:49,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:23:49,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:23:49,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:23:49,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:23:49,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:23:49,993 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:23:50,023 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:23:50,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:23:50,024 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:23:50,024 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:23:50,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:23:50,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:23:50,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:23:50,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:23:50,026 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:23:50,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:23:50,027 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:23:50,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:23:50,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:23:50,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:23:50,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:23:50,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:23:50,028 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:23:50,028 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:23:50,028 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:23:50,029 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:23:50,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:23:50,029 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:23:50,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:23:50,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:23:50,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:23:50,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:23:50,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:23:50,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:23:50,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:23:50,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:23:50,045 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:23:50,045 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:23:50,045 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:23:50,045 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:23:50,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:23:50,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:23:50,046 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 -> 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 [2022-02-20 16:23:50,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:23:50,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:23:50,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:23:50,322 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:23:50,324 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:23:50,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton-2.c [2022-02-20 16:23:50,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb0130e2/608791b2e44745bc845bbfaec25ef9fe/FLAG5933422c7 [2022-02-20 16:23:50,712 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:23:50,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton-2.c [2022-02-20 16:23:50,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb0130e2/608791b2e44745bc845bbfaec25ef9fe/FLAG5933422c7 [2022-02-20 16:23:50,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdb0130e2/608791b2e44745bc845bbfaec25ef9fe [2022-02-20 16:23:50,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:23:50,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:23:50,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:23:50,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:23:50,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:23:50,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:23:50" (1/1) ... [2022-02-20 16:23:50,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@220a114c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50, skipping insertion in model container [2022-02-20 16:23:50,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:23:50" (1/1) ... [2022-02-20 16:23:50,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:23:50,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:23:50,848 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-benchs/inv_Newton-2.c[847,860] [2022-02-20 16:23:50,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:23:50,875 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:23:50,898 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-benchs/inv_Newton-2.c[847,860] [2022-02-20 16:23:50,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:23:50,924 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:23:50,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50 WrapperNode [2022-02-20 16:23:50,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:23:50,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:23:50,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:23:50,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:23:50,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50" (1/1) ... [2022-02-20 16:23:50,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50" (1/1) ... [2022-02-20 16:23:50,957 INFO L137 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2022-02-20 16:23:50,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:23:50,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:23:50,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:23:50,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:23:50,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50" (1/1) ... [2022-02-20 16:23:50,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50" (1/1) ... [2022-02-20 16:23:50,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50" (1/1) ... [2022-02-20 16:23:50,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50" (1/1) ... [2022-02-20 16:23:50,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50" (1/1) ... [2022-02-20 16:23:50,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50" (1/1) ... [2022-02-20 16:23:50,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50" (1/1) ... [2022-02-20 16:23:50,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:23:50,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:23:50,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:23:50,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:23:50,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50" (1/1) ... [2022-02-20 16:23:50,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:23:51,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:23:51,016 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-02-20 16:23:51,035 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-02-20 16:23:51,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:23:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-02-20 16:23:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:23:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:23:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:23:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:23:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:23:51,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:23:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:23:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:23:51,114 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:23:51,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:23:53,455 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:23:53,459 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:23:53,460 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:23:53,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:53 BoogieIcfgContainer [2022-02-20 16:23:53,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:23:53,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:23:53,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:23:53,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:23:53,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:23:50" (1/3) ... [2022-02-20 16:23:53,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b73bd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:23:53, skipping insertion in model container [2022-02-20 16:23:53,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:23:50" (2/3) ... [2022-02-20 16:23:53,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b73bd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:23:53, skipping insertion in model container [2022-02-20 16:23:53,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:23:53" (3/3) ... [2022-02-20 16:23:53,468 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton-2.c [2022-02-20 16:23:53,471 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:23:53,471 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:23:53,507 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:23:53,513 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:23:53,514 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:23:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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-02-20 16:23:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:23:53,526 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:53,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:53,527 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:53,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:53,530 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-02-20 16:23:53,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:23:53,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713154832] [2022-02-20 16:23:53,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:53,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:23:53,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:23:53,541 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-02-20 16:23:53,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:23:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:53,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:23:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:53,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:23:53,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {17#true} is VALID [2022-02-20 16:23:53,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~a~0#1, main_~r~0#1;havoc main_~a~0#1;havoc main_~r~0#1;main_~a~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~a~0#1, ~to_fp~DOUBLE(currentRoundingMode, 20.0)) && ~fp.leq~DOUBLE(main_~a~0#1, ~to_fp~DOUBLE(currentRoundingMode, 30.0)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {17#true} is VALID [2022-02-20 16:23:53,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {17#true} assume 0bv32 == assume_abort_if_not_~cond#1;assume false; {18#false} is VALID [2022-02-20 16:23:53,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {18#false} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_inv } true;inv_#in~A#1 := main_~a~0#1;havoc inv_#res#1;havoc inv_#t~mem4#1, inv_#t~mem5#1, inv_~A#1, inv_~xi~0#1, inv_~xsi~0#1, inv_~temp~0#1, inv_~cond~0#1, inv_~exp~0#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset;inv_~A#1 := inv_#in~A#1;havoc inv_~xi~0#1;havoc inv_~xsi~0#1;havoc inv_~temp~0#1;havoc inv_~cond~0#1;havoc inv_~exp~0#1;call inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(inv_~A#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 8bv32);call inv_#t~mem4#1 := read~intINTTYPE4(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 4bv32);inv_~exp~0#1 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, inv_#t~mem4#1), 20bv32), 1023bv32);havoc inv_#t~mem4#1;call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, 1bv32), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8bv32);call write~intINTTYPE4(~bvshl32(~bvsub32(1023bv32, inv_~exp~0#1), 20bv32), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 4bv32);call inv_#t~mem5#1 := read~intFLOATTYPE8(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8bv32);inv_~xi~0#1 := inv_#t~mem5#1;havoc inv_#t~mem5#1;inv_~cond~0#1 := 1bv32; {18#false} is VALID [2022-02-20 16:23:53,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {18#false} assume !(0bv32 != inv_~cond~0#1); {18#false} is VALID [2022-02-20 16:23:53,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {18#false} inv_#res#1 := inv_~xi~0#1;call ULTIMATE.dealloc(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset);havoc inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset;call ULTIMATE.dealloc(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset);havoc inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset; {18#false} is VALID [2022-02-20 16:23:53,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {18#false} main_#t~ret7#1 := inv_#res#1;assume { :end_inline_inv } true;main_~r~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~r~0#1, ~convertINTToDOUBLE(currentRoundingMode, 0bv32)) && ~fp.leq~DOUBLE(main_~r~0#1, ~to_fp~DOUBLE(currentRoundingMode, 0.06)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {18#false} is VALID [2022-02-20 16:23:53,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {18#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {18#false} is VALID [2022-02-20 16:23:53,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {18#false} assume !false; {18#false} is VALID [2022-02-20 16:23:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:23:53,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:23:53,717 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:23:53,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713154832] [2022-02-20 16:23:53,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713154832] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:23:53,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:23:53,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:23:53,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147343887] [2022-02-20 16:23:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:23:53,738 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-02-20 16:23:53,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:23:53,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 16:23:53,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:53,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:23:53,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:23:53,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:23:53,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:23:53,783 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 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-02-20 16:23:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:55,992 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 16:23:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:23:55,992 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-02-20 16:23:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 16:23:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2022-02-20 16:23:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 16:23:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2022-02-20 16:23:55,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 30 transitions. [2022-02-20 16:23:56,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:56,650 INFO L225 Difference]: With dead ends: 25 [2022-02-20 16:23:56,650 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 16:23:56,652 INFO L932 BasicCegarLoop]: 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-02-20 16:23:56,654 INFO L933 BasicCegarLoop]: 14 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, 14 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-02-20 16:23:56,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:23:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 16:23:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-20 16:23:56,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:56,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-02-20 16:23:56,671 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-02-20 16:23:56,672 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-02-20 16:23:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:56,673 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 16:23:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:23:56,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:56,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:56,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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) Second operand 10 states. [2022-02-20 16:23:56,674 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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) Second operand 10 states. [2022-02-20 16:23:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:56,675 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 16:23:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:23:56,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:56,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:56,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:56,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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-02-20 16:23:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-02-20 16:23:56,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-02-20 16:23:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:56,678 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-02-20 16:23:56,678 INFO L471 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-02-20 16:23:56,678 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:23:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:23:56,679 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:56,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:56,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:23:56,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:23:56,889 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:56,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-02-20 16:23:56,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:23:56,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063793803] [2022-02-20 16:23:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:56,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:23:56,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:23:56,893 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-02-20 16:23:56,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:23:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:56,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:23:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:56,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:23:57,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {110#true} is VALID [2022-02-20 16:23:57,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~a~0#1, main_~r~0#1;havoc main_~a~0#1;havoc main_~r~0#1;main_~a~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~a~0#1, ~to_fp~DOUBLE(currentRoundingMode, 20.0)) && ~fp.leq~DOUBLE(main_~a~0#1, ~to_fp~DOUBLE(currentRoundingMode, 30.0)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {110#true} is VALID [2022-02-20 16:23:57,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {110#true} is VALID [2022-02-20 16:23:57,065 INFO L290 TraceCheckUtils]: 3: Hoare triple {110#true} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_inv } true;inv_#in~A#1 := main_~a~0#1;havoc inv_#res#1;havoc inv_#t~mem4#1, inv_#t~mem5#1, inv_~A#1, inv_~xi~0#1, inv_~xsi~0#1, inv_~temp~0#1, inv_~cond~0#1, inv_~exp~0#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset;inv_~A#1 := inv_#in~A#1;havoc inv_~xi~0#1;havoc inv_~xsi~0#1;havoc inv_~temp~0#1;havoc inv_~cond~0#1;havoc inv_~exp~0#1;call inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(inv_~A#1, inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 8bv32);call inv_#t~mem4#1 := read~intINTTYPE4(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset, 4bv32);inv_~exp~0#1 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, inv_#t~mem4#1), 20bv32), 1023bv32);havoc inv_#t~mem4#1;call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, 1bv32), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8bv32);call write~intINTTYPE4(~bvshl32(~bvsub32(1023bv32, inv_~exp~0#1), 20bv32), inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 4bv32);call inv_#t~mem5#1 := read~intFLOATTYPE8(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset, 8bv32);inv_~xi~0#1 := inv_#t~mem5#1;havoc inv_#t~mem5#1;inv_~cond~0#1 := 1bv32; {124#(= |ULTIMATE.start_inv_~cond~0#1| (_ bv1 32))} is VALID [2022-02-20 16:23:57,066 INFO L290 TraceCheckUtils]: 4: Hoare triple {124#(= |ULTIMATE.start_inv_~cond~0#1| (_ bv1 32))} assume !(0bv32 != inv_~cond~0#1); {111#false} is VALID [2022-02-20 16:23:57,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {111#false} inv_#res#1 := inv_~xi~0#1;call ULTIMATE.dealloc(inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset);havoc inv_~#A_u~0#1.base, inv_~#A_u~0#1.offset;call ULTIMATE.dealloc(inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset);havoc inv_~#xi_u~0#1.base, inv_~#xi_u~0#1.offset; {111#false} is VALID [2022-02-20 16:23:57,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {111#false} main_#t~ret7#1 := inv_#res#1;assume { :end_inline_inv } true;main_~r~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~r~0#1, ~convertINTToDOUBLE(currentRoundingMode, 0bv32)) && ~fp.leq~DOUBLE(main_~r~0#1, ~to_fp~DOUBLE(currentRoundingMode, 0.06)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {111#false} is VALID [2022-02-20 16:23:57,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {111#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {111#false} is VALID [2022-02-20 16:23:57,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#false} assume !false; {111#false} is VALID [2022-02-20 16:23:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:23:57,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:23:57,067 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:23:57,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063793803] [2022-02-20 16:23:57,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063793803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:23:57,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:23:57,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:23:57,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393080594] [2022-02-20 16:23:57,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:23:57,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:57,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:23:57,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:57,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:57,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:23:57,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:23:57,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:23:57,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:23:57,088 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:59,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:23:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:59,529 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 16:23:59,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:23:59,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:59,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 16:23:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:23:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 16:23:59,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2022-02-20 16:24:00,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:00,177 INFO L225 Difference]: With dead ends: 16 [2022-02-20 16:24:00,177 INFO L226 Difference]: Without dead ends: 11 [2022-02-20 16:24:00,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:24:00,178 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:24:00,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 16:24:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-20 16:24:00,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-20 16:24:00,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:24:00,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-02-20 16:24:00,180 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-02-20 16:24:00,180 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-02-20 16:24:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:00,181 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:24:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:24:00,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:00,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:00,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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) Second operand 11 states. [2022-02-20 16:24:00,181 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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) Second operand 11 states. [2022-02-20 16:24:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:00,182 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 16:24:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:24:00,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:00,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:00,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:24:00,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:24:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-02-20 16:24:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-02-20 16:24:00,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-02-20 16:24:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:24:00,184 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-02-20 16:24:00,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-02-20 16:24:00,185 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 16:24:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:24:00,185 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:00,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:00,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:24:00,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:24:00,386 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:00,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-02-20 16:24:00,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:24:00,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774236574] [2022-02-20 16:24:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:00,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:24:00,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:24:00,388 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-02-20 16:24:00,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:24:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:01,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 16:24:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-02-20 16:24:03,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:24:04,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 216 [2022-02-20 16:24:04,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:24:04,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 216 [2022-02-20 16:24:04,156 INFO L356 Elim1Store]: treesize reduction 19, result has 24.0 percent of original size [2022-02-20 16:24:04,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 300 [2022-02-20 16:24:04,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4