./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.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 f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:16:13,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:16:13,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:16:13,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:16:13,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:16:13,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:16:13,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:16:13,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:16:13,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:16:13,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:16:13,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:16:13,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:16:13,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:16:13,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:16:13,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:16:13,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:16:13,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:16:13,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:16:13,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:16:13,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:16:13,065 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:16:13,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:16:13,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:16:13,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:16:13,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:16:13,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:16:13,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:16:13,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:16:13,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:16:13,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:16:13,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:16:13,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:16:13,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:16:13,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:16:13,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:16:13,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:16:13,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:16:13,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:16:13,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:16:13,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:16:13,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:16:13,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:16:13,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 14:16:13,104 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:16:13,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:16:13,105 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:16:13,105 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:16:13,106 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:16:13,106 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:16:13,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:16:13,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:16:13,107 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:16:13,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:16:13,108 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:16:13,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 14:16:13,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:16:13,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:16:13,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:16:13,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:16:13,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:16:13,109 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:16:13,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:16:13,110 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:16:13,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:16:13,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:16:13,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:16:13,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:16:13,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:16:13,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:16:13,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:16:13,111 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:16:13,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 14:16:13,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 14:16:13,112 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:16:13,112 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:16:13,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:16:13,112 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 -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2022-07-13 14:16:13,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:16:13,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:16:13,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:16:13,294 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:16:13,295 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:16:13,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-07-13 14:16:13,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c384543/7e74d2aabdfb42a88ea177fc99ebab14/FLAG04efd47ec [2022-07-13 14:16:13,725 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:16:13,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-07-13 14:16:13,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c384543/7e74d2aabdfb42a88ea177fc99ebab14/FLAG04efd47ec [2022-07-13 14:16:14,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c384543/7e74d2aabdfb42a88ea177fc99ebab14 [2022-07-13 14:16:14,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:16:14,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:16:14,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:16:14,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:16:14,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:16:14,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:16:14" (1/1) ... [2022-07-13 14:16:14,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ac7c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14, skipping insertion in model container [2022-07-13 14:16:14,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:16:14" (1/1) ... [2022-07-13 14:16:14,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:16:14,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:16:14,319 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.c.p+cfa-reducer.c[2006,2019] [2022-07-13 14:16:14,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:16:14,331 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:16:14,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2022-07-13 14:16:14,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:16:14,384 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:16:14,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14 WrapperNode [2022-07-13 14:16:14,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:16:14,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:16:14,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:16:14,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:16:14,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14" (1/1) ... [2022-07-13 14:16:14,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14" (1/1) ... [2022-07-13 14:16:14,423 INFO L137 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 98 [2022-07-13 14:16:14,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:16:14,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:16:14,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:16:14,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:16:14,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14" (1/1) ... [2022-07-13 14:16:14,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14" (1/1) ... [2022-07-13 14:16:14,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14" (1/1) ... [2022-07-13 14:16:14,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14" (1/1) ... [2022-07-13 14:16:14,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14" (1/1) ... [2022-07-13 14:16:14,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14" (1/1) ... [2022-07-13 14:16:14,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14" (1/1) ... [2022-07-13 14:16:14,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:16:14,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:16:14,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:16:14,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:16:14,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14" (1/1) ... [2022-07-13 14:16:14,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:16:14,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:16:14,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 14:16:14,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 14:16:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:16:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 14:16:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:16:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-13 14:16:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 14:16:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-13 14:16:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:16:14,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:16:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 14:16:14,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:16:14,578 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:16:14,579 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:16:14,728 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:16:14,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:16:14,732 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 14:16:14,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:16:14 BoogieIcfgContainer [2022-07-13 14:16:14,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:16:14,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:16:14,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:16:14,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:16:14,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:16:14" (1/3) ... [2022-07-13 14:16:14,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b2888a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:16:14, skipping insertion in model container [2022-07-13 14:16:14,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:14" (2/3) ... [2022-07-13 14:16:14,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b2888a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:16:14, skipping insertion in model container [2022-07-13 14:16:14,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:16:14" (3/3) ... [2022-07-13 14:16:14,741 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2022-07-13 14:16:14,751 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:16:14,752 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:16:14,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:16:14,786 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@38656c01, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ccf41b4 [2022-07-13 14:16:14,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:16:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:14,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 14:16:14,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:16:14,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:16:14,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:16:14,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:16:14,813 INFO L85 PathProgramCache]: Analyzing trace with hash -938930996, now seen corresponding path program 1 times [2022-07-13 14:16:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:16:14,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98995954] [2022-07-13 14:16:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:16:14,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:16:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:16:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:16:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:16:14,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98995954] [2022-07-13 14:16:14,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98995954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:16:14,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:16:14,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:16:14,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801445137] [2022-07-13 14:16:14,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:16:14,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:16:14,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:16:15,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:16:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:16:15,019 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:15,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:16:15,076 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2022-07-13 14:16:15,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:16:15,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 14:16:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:16:15,084 INFO L225 Difference]: With dead ends: 49 [2022-07-13 14:16:15,084 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 14:16:15,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:16:15,093 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:16:15,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:16:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 14:16:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2022-07-13 14:16:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-07-13 14:16:15,123 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2022-07-13 14:16:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:16:15,123 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-13 14:16:15,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-07-13 14:16:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 14:16:15,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:16:15,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:16:15,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 14:16:15,125 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:16:15,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:16:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1250925041, now seen corresponding path program 1 times [2022-07-13 14:16:15,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:16:15,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137842123] [2022-07-13 14:16:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:16:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:16:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:16:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:16:15,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:16:15,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137842123] [2022-07-13 14:16:15,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137842123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:16:15,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:16:15,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:16:15,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631802932] [2022-07-13 14:16:15,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:16:15,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:16:15,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:16:15,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:16:15,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:16:15,228 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:16:15,306 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2022-07-13 14:16:15,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:16:15,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-07-13 14:16:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:16:15,308 INFO L225 Difference]: With dead ends: 44 [2022-07-13 14:16:15,309 INFO L226 Difference]: Without dead ends: 37 [2022-07-13 14:16:15,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:16:15,311 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:16:15,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 71 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:16:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-13 14:16:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2022-07-13 14:16:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-13 14:16:15,317 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2022-07-13 14:16:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:16:15,318 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-13 14:16:15,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-07-13 14:16:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 14:16:15,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:16:15,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:16:15,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 14:16:15,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:16:15,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:16:15,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1796523982, now seen corresponding path program 1 times [2022-07-13 14:16:15,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:16:15,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299689645] [2022-07-13 14:16:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:16:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:16:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:16:15,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 14:16:15,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:16:15,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299689645] [2022-07-13 14:16:15,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299689645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:16:15,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:16:15,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:16:15,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643858906] [2022-07-13 14:16:15,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:16:15,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:16:15,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:16:15,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:16:15,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:16:15,394 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:16:15,439 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-07-13 14:16:15,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:16:15,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-07-13 14:16:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:16:15,442 INFO L225 Difference]: With dead ends: 41 [2022-07-13 14:16:15,442 INFO L226 Difference]: Without dead ends: 35 [2022-07-13 14:16:15,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:16:15,448 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:16:15,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 79 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:16:15,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-13 14:16:15,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2022-07-13 14:16:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-07-13 14:16:15,457 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2022-07-13 14:16:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:16:15,457 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-13 14:16:15,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-07-13 14:16:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 14:16:15,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:16:15,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:16:15,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 14:16:15,459 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:16:15,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:16:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1813534643, now seen corresponding path program 1 times [2022-07-13 14:16:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:16:15,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408454124] [2022-07-13 14:16:15,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:16:15,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:16:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:16:15,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 14:16:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:16:15,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 14:16:15,517 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 14:16:15,517 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:16:15,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 14:16:15,521 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-07-13 14:16:15,523 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:16:15,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:16:15 BoogieIcfgContainer [2022-07-13 14:16:15,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:16:15,559 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:16:15,559 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:16:15,560 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:16:15,560 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:16:14" (3/4) ... [2022-07-13 14:16:15,562 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 14:16:15,562 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:16:15,563 INFO L158 Benchmark]: Toolchain (without parser) took 1410.59ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 66.1MB in the beginning and 79.2MB in the end (delta: -13.2MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2022-07-13 14:16:15,563 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 53.2MB in the beginning and 53.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:16:15,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.05ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 65.8MB in the beginning and 108.9MB in the end (delta: -43.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 14:16:15,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.64ms. Allocated memory is still 134.2MB. Free memory was 108.5MB in the beginning and 106.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:16:15,567 INFO L158 Benchmark]: Boogie Preprocessor took 32.32ms. Allocated memory is still 134.2MB. Free memory was 106.8MB in the beginning and 106.0MB in the end (delta: 851.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:16:15,567 INFO L158 Benchmark]: RCFGBuilder took 276.36ms. Allocated memory is still 134.2MB. Free memory was 105.6MB in the beginning and 94.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 14:16:15,568 INFO L158 Benchmark]: TraceAbstraction took 823.96ms. Allocated memory is still 134.2MB. Free memory was 94.3MB in the beginning and 79.9MB in the end (delta: 14.4MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-07-13 14:16:15,568 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 134.2MB. Free memory was 79.9MB in the beginning and 79.2MB in the end (delta: 629.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:16:15,572 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 53.2MB in the beginning and 53.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.05ms. Allocated memory was 96.5MB in the beginning and 134.2MB in the end (delta: 37.7MB). Free memory was 65.8MB in the beginning and 108.9MB in the end (delta: -43.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.64ms. Allocated memory is still 134.2MB. Free memory was 108.5MB in the beginning and 106.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.32ms. Allocated memory is still 134.2MB. Free memory was 106.8MB in the beginning and 106.0MB in the end (delta: 851.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 276.36ms. Allocated memory is still 134.2MB. Free memory was 105.6MB in the beginning and 94.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 823.96ms. Allocated memory is still 134.2MB. Free memory was 94.3MB in the beginning and 79.9MB in the end (delta: 14.4MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 134.2MB. Free memory was 79.9MB in the beginning and 79.2MB in the end (delta: 629.7kB). 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: 96]: 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 45, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of to_real at line 46. Possible FailurePath: [L1] int __return_main; [L17] double __return_104; VAL [__return_104=0, __return_main=0] [L20] double main__a; [L21] double main__r; [L22] main__a = __VERIFIER_nondet_double() [L23] int main____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0] [L24] COND TRUE main__a >= 20.0 VAL [__return_104=0, __return_main=0] [L26] COND TRUE main__a <= 30.0 [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_104=0, __return_main=0, main____CPAchecker_TMP_0=1] [L30] COND TRUE main____CPAchecker_TMP_0 != 0 [L33] double __tmp_1; [L34] __tmp_1 = main__a [L35] double inv__A; [L36] inv__A = __tmp_1 [L37] double inv__xi; [L38] double inv__xsi; [L39] double inv__temp; [L40] signed int inv__cond; [L41] signed int inv__exp; [L42] union double_int inv__A_u; [L43] union double_int inv__xi_u; [L44] inv__A_u.d = inv__A [L45] EXPR inv__A_u.i [L45] inv__exp = ((signed int)(((inv__A_u.i) & 2146435072) >> 20)) - 1023 [L46] inv__xi_u.d = 1 [L47] inv__xi_u.i = (1023 - inv__exp) << 20 [L48] EXPR inv__xi_u.d [L48] inv__xi = inv__xi_u.d [L49] inv__cond = 1 VAL [__return_104=0, __return_main=0, __tmp_1=2145386497, inv__A=2145386497, inv__A_u={4:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386500, inv__xi_u={5:0}, main____CPAchecker_TMP_0=1, main__a=2145386497] [L51] COND TRUE !(inv__cond == 0) [L53] inv__xsi = (2 * inv__xi) - ((inv__A * inv__xi) * inv__xi) [L54] inv__temp = inv__xsi - inv__xi [L55] int inv____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0, __tmp_1=2145386497, inv__A=2145386497, inv__A_u={4:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386500, inv__xi_u={5:0}, main____CPAchecker_TMP_0=1, main__a=2145386497] [L56] COND FALSE !(inv__temp > 1.0E-10) VAL [__return_104=0, __return_main=0, __tmp_1=2145386497, inv__A=2145386497, inv__A_u={4:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386500, inv__xi_u={5:0}, main____CPAchecker_TMP_0=1, main__a=2145386497] [L67] COND FALSE !(inv__temp < -1.0E-10) [L73] inv____CPAchecker_TMP_0 = 0 VAL [__return_104=0, __return_main=0, __tmp_1=2145386497, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386500, inv__xi_u={5:0}, main____CPAchecker_TMP_0=1, main__a=2145386497] [L61] inv__cond = inv____CPAchecker_TMP_0 [L62] inv__xi = inv__xsi VAL [__return_104=0, __return_main=0, __tmp_1=2145386497, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main__a=2145386497] [L51] COND FALSE !(!(inv__cond == 0)) [L80] __return_104 = inv__xi [L81] main__r = __return_104 [L82] int main____CPAchecker_TMP_1; VAL [__return_104=2145386499, __return_main=0, __tmp_1=2145386497, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main__a=2145386497, main__r=2145386499] [L83] COND FALSE !(main__r >= 0) VAL [__return_104=2145386499, __return_main=0, __tmp_1=2145386497, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main__a=2145386497, main__r=2145386499] [L108] main____CPAchecker_TMP_1 = 0 VAL [__return_104=2145386499, __return_main=0, __tmp_1=2145386497, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386497, main__r=2145386499] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_1 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [__return_104=2145386499, __return_main=0, __tmp_1=2145386497, __tmp_2=0, __VERIFIER_assert__cond=0, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386497, main__r=2145386499] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_104=2145386499, __return_main=0, __tmp_1=2145386497, __tmp_2=0, __VERIFIER_assert__cond=0, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386497, main__r=2145386499] [L96] reach_error() VAL [__return_104=2145386499, __return_main=0, __tmp_1=2145386497, __tmp_2=0, __VERIFIER_assert__cond=0, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386497, main__r=2145386499] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 71 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 19, 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, 3 MinimizatonAttempts, 46 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 59 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 14:16:15,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.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 f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:16:17,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:16:17,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:16:17,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:16:17,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:16:17,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:16:17,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:16:17,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:16:17,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:16:17,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:16:17,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:16:17,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:16:17,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:16:17,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:16:17,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:16:17,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:16:17,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:16:17,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:16:17,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:16:17,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:16:17,332 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:16:17,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:16:17,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:16:17,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:16:17,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:16:17,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:16:17,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:16:17,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:16:17,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:16:17,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:16:17,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:16:17,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:16:17,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:16:17,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:16:17,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:16:17,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:16:17,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:16:17,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:16:17,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:16:17,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:16:17,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:16:17,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:16:17,351 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 14:16:17,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:16:17,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:16:17,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:16:17,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:16:17,377 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:16:17,377 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:16:17,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:16:17,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:16:17,378 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:16:17,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:16:17,379 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:16:17,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:16:17,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:16:17,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:16:17,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:16:17,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:16:17,380 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 14:16:17,380 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 14:16:17,380 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 14:16:17,380 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:16:17,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:16:17,380 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:16:17,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:16:17,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:16:17,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:16:17,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:16:17,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:16:17,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:16:17,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:16:17,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:16:17,382 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 14:16:17,382 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 14:16:17,382 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:16:17,382 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:16:17,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:16:17,383 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 14:16:17,383 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 -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2022-07-13 14:16:17,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:16:17,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:16:17,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:16:17,654 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:16:17,654 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:16:17,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-07-13 14:16:17,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50d9836d/227d215c41ec4397ad5bf45922509cdc/FLAGadd41959f [2022-07-13 14:16:18,090 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:16:18,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-07-13 14:16:18,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50d9836d/227d215c41ec4397ad5bf45922509cdc/FLAGadd41959f [2022-07-13 14:16:18,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50d9836d/227d215c41ec4397ad5bf45922509cdc [2022-07-13 14:16:18,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:16:18,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:16:18,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:16:18,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:16:18,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:16:18,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:16:18" (1/1) ... [2022-07-13 14:16:18,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d934bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18, skipping insertion in model container [2022-07-13 14:16:18,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:16:18" (1/1) ... [2022-07-13 14:16:18,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:16:18,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:16:18,299 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.c.p+cfa-reducer.c[2006,2019] [2022-07-13 14:16:18,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:16:18,326 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:16:18,358 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.c.p+cfa-reducer.c[2006,2019] [2022-07-13 14:16:18,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:16:18,376 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:16:18,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18 WrapperNode [2022-07-13 14:16:18,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:16:18,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:16:18,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:16:18,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:16:18,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18" (1/1) ... [2022-07-13 14:16:18,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18" (1/1) ... [2022-07-13 14:16:18,416 INFO L137 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 99 [2022-07-13 14:16:18,416 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:16:18,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:16:18,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:16:18,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:16:18,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18" (1/1) ... [2022-07-13 14:16:18,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18" (1/1) ... [2022-07-13 14:16:18,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18" (1/1) ... [2022-07-13 14:16:18,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18" (1/1) ... [2022-07-13 14:16:18,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18" (1/1) ... [2022-07-13 14:16:18,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18" (1/1) ... [2022-07-13 14:16:18,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18" (1/1) ... [2022-07-13 14:16:18,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:16:18,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:16:18,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:16:18,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:16:18,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18" (1/1) ... [2022-07-13 14:16:18,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:16:18,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:16:18,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 14:16:18,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 14:16:18,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:16:18,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-13 14:16:18,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-13 14:16:18,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 14:16:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:16:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 14:16:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:16:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:16:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:16:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 14:16:18,573 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:16:18,574 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:16:20,941 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:16:20,945 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:16:20,945 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 14:16:20,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:16:20 BoogieIcfgContainer [2022-07-13 14:16:20,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:16:20,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:16:20,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:16:20,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:16:20,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:16:18" (1/3) ... [2022-07-13 14:16:20,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282b4630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:16:20, skipping insertion in model container [2022-07-13 14:16:20,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:16:18" (2/3) ... [2022-07-13 14:16:20,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282b4630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:16:20, skipping insertion in model container [2022-07-13 14:16:20,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:16:20" (3/3) ... [2022-07-13 14:16:20,958 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2022-07-13 14:16:20,967 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:16:20,967 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:16:20,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:16:21,001 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@72fbe312, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c89bcf5 [2022-07-13 14:16:21,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:16:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 14:16:21,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:16:21,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:16:21,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:16:21,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:16:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash -938930996, now seen corresponding path program 1 times [2022-07-13 14:16:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:16:21,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028150477] [2022-07-13 14:16:21,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:16:21,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:16:21,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:16:21,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:16:21,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 14:16:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:16:21,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 14:16:21,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:16:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:16:21,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:16:21,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:16:21,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028150477] [2022-07-13 14:16:21,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028150477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:16:21,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:16:21,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 14:16:21,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565918431] [2022-07-13 14:16:21,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:16:21,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 14:16:21,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:16:21,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 14:16:21,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 14:16:21,197 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:23,422 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:16:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:16:23,538 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-07-13 14:16:23,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 14:16:23,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 14:16:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:16:23,545 INFO L225 Difference]: With dead ends: 32 [2022-07-13 14:16:23,545 INFO L226 Difference]: Without dead ends: 19 [2022-07-13 14:16:23,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-07-13 14:16:23,548 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 14:16:23,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 14:16:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-13 14:16:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-13 14:16:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-07-13 14:16:23,569 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2022-07-13 14:16:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:16:23,569 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-13 14:16:23,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-07-13 14:16:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 14:16:23,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:16:23,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:16:23,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 14:16:23,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:16:23,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:16:23,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:16:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1250925041, now seen corresponding path program 1 times [2022-07-13 14:16:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:16:23,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815154348] [2022-07-13 14:16:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:16:23,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:16:23,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:16:23,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:16:23,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 14:16:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:16:24,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 14:16:24,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:16:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:16:24,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:16:24,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:16:24,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815154348] [2022-07-13 14:16:24,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815154348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:16:24,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:16:24,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:16:24,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469153290] [2022-07-13 14:16:24,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:16:24,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:16:24,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:16:24,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:16:24,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:16:24,412 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:26,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:16:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:16:26,995 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-07-13 14:16:26,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:16:26,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-07-13 14:16:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:16:26,996 INFO L225 Difference]: With dead ends: 28 [2022-07-13 14:16:26,996 INFO L226 Difference]: Without dead ends: 21 [2022-07-13 14:16:26,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:16:26,997 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 14:16:26,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 14:16:26,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-13 14:16:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-13 14:16:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-13 14:16:27,000 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2022-07-13 14:16:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:16:27,001 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-13 14:16:27,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-07-13 14:16:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 14:16:27,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:16:27,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:16:27,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 14:16:27,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:16:27,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:16:27,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:16:27,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1796523982, now seen corresponding path program 1 times [2022-07-13 14:16:27,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:16:27,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862852226] [2022-07-13 14:16:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:16:27,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:16:27,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:16:27,208 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:16:27,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 14:16:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:16:27,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 14:16:27,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:16:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 14:16:27,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:16:27,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:16:27,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862852226] [2022-07-13 14:16:27,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862852226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:16:27,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:16:27,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:16:27,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767518087] [2022-07-13 14:16:27,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:16:27,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:16:27,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:16:27,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:16:27,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:16:27,820 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:16:27,922 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-07-13 14:16:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:16:27,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-07-13 14:16:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:16:27,923 INFO L225 Difference]: With dead ends: 24 [2022-07-13 14:16:27,923 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 14:16:27,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:16:27,924 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 14:16:27,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 14:16:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 14:16:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 14:16:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-07-13 14:16:27,927 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2022-07-13 14:16:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:16:27,928 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-13 14:16:27,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:16:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-07-13 14:16:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 14:16:27,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:16:27,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:16:27,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 14:16:28,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:16:28,136 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:16:28,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:16:28,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1813534643, now seen corresponding path program 1 times [2022-07-13 14:16:28,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:16:28,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103432065] [2022-07-13 14:16:28,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:16:28,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:16:28,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:16:28,143 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:16:28,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 14:16:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:16:29,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 14:16:29,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:16:53,404 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (= |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-13 14:17:16,901 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (= |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0))))) (not (fp.gt |c_ULTIMATE.start_main_~inv__temp~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-13 14:17:44,787 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.lt .cse0 (fp.neg .cse1))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse2) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse2) .cse2)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (not (fp.gt .cse0 .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-13 14:18:12,822 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= .cse0 |c_ULTIMATE.start_main_~inv__xi~0#1|) (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-13 14:18:40,841 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= .cse2 |c_ULTIMATE.start_main_~main__r~0#1|) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-13 14:19:09,256 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~inv__A~0#1| .cse1) .cse1)))) (and (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0)))))) is different from false [2022-07-13 14:19:11,325 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~inv__A~0#1| .cse1) .cse1)))) (and (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0)))))) is different from true [2022-07-13 14:20:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 14:20:22,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 14:20:38,538 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse0 .cse1)))) is different from false [2022-07-13 14:20:40,674 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse0 .cse1)))) is different from true [2022-07-13 14:20:55,058 WARN L233 SmtUtils]: Spent 5.54s on a formula simplification. DAG size of input: 25 DAG size of output: 1 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 14:21:01,876 WARN L855 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_4| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_4|) (_ bv1023 32)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))))))) is different from true