./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.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 23f3104f6bf674f4cf2d86feffb86c85d21d7d18 .................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.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 23f3104f6bf674f4cf2d86feffb86c85d21d7d18 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 00:33:24,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:33:24,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:33:24,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:33:24,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:33:24,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:33:24,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:33:24,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:33:24,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:33:24,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:33:24,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:33:24,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:33:24,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:33:24,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:33:24,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:33:24,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:33:24,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:33:24,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:33:24,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:33:24,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:33:24,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:33:24,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:33:24,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:33:24,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:33:24,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:33:24,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:33:24,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:33:24,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:33:24,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:33:24,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:33:24,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:33:24,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:33:24,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:33:24,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:33:24,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:33:24,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:33:24,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:33:24,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:33:24,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:33:24,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:33:24,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:33:24,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 00:33:24,129 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:33:24,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:33:24,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:33:24,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:33:24,131 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:33:24,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:33:24,131 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:33:24,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 00:33:24,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:33:24,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:33:24,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:33:24,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:33:24,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:33:24,133 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:33:24,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:33:24,133 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:33:24,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:33:24,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:33:24,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:33:24,134 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:33:24,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:33:24,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:33:24,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:33:24,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:33:24,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:33:24,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 00:33:24,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 00:33:24,135 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:33:24,135 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:33:24,135 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 23f3104f6bf674f4cf2d86feffb86c85d21d7d18 [2020-10-20 00:33:24,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:33:24,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:33:24,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:33:24,344 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:33:24,345 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:33:24,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2020-10-20 00:33:24,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd3dbcf22/ddd50692bccb4ad98b11cf9504789f8d/FLAGad7fd48b8 [2020-10-20 00:33:24,851 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:33:24,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2020-10-20 00:33:24,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd3dbcf22/ddd50692bccb4ad98b11cf9504789f8d/FLAGad7fd48b8 [2020-10-20 00:33:25,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd3dbcf22/ddd50692bccb4ad98b11cf9504789f8d [2020-10-20 00:33:25,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:33:25,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:33:25,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:33:25,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:33:25,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:33:25,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:33:25" (1/1) ... [2020-10-20 00:33:25,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cc14f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25, skipping insertion in model container [2020-10-20 00:33:25,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:33:25" (1/1) ... [2020-10-20 00:33:25,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:33:25,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:33:25,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:33:25,564 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:33:25,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:33:25,608 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:33:25,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25 WrapperNode [2020-10-20 00:33:25,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:33:25,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:33:25,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:33:25,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:33:25,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25" (1/1) ... [2020-10-20 00:33:25,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25" (1/1) ... [2020-10-20 00:33:25,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:33:25,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:33:25,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:33:25,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:33:25,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25" (1/1) ... [2020-10-20 00:33:25,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25" (1/1) ... [2020-10-20 00:33:25,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25" (1/1) ... [2020-10-20 00:33:25,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25" (1/1) ... [2020-10-20 00:33:25,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25" (1/1) ... [2020-10-20 00:33:25,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25" (1/1) ... [2020-10-20 00:33:25,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25" (1/1) ... [2020-10-20 00:33:25,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:33:25,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:33:25,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:33:25,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:33:25,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:33:25,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 00:33:25,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:33:25,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-10-20 00:33:25,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:33:25,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:33:25,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 00:33:25,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 00:33:26,089 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:33:26,089 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-20 00:33:26,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:33:26 BoogieIcfgContainer [2020-10-20 00:33:26,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:33:26,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:33:26,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:33:26,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:33:26,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:33:25" (1/3) ... [2020-10-20 00:33:26,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18784665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:33:26, skipping insertion in model container [2020-10-20 00:33:26,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:25" (2/3) ... [2020-10-20 00:33:26,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18784665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:33:26, skipping insertion in model container [2020-10-20 00:33:26,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:33:26" (3/3) ... [2020-10-20 00:33:26,100 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2020-10-20 00:33:26,112 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:33:26,127 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 00:33:26,144 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 00:33:26,168 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:33:26,169 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:33:26,169 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:33:26,169 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:33:26,169 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:33:26,169 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:33:26,170 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:33:26,170 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:33:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-10-20 00:33:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 00:33:26,188 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:26,189 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:26,189 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:26,194 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2020-10-20 00:33:26,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:33:26,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720157564] [2020-10-20 00:33:26,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:33:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:26,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720157564] [2020-10-20 00:33:26,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:26,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 00:33:26,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23561609] [2020-10-20 00:33:26,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 00:33:26,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:33:26,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 00:33:26,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:33:26,364 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2020-10-20 00:33:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:26,384 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2020-10-20 00:33:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 00:33:26,386 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-20 00:33:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:26,397 INFO L225 Difference]: With dead ends: 63 [2020-10-20 00:33:26,397 INFO L226 Difference]: Without dead ends: 29 [2020-10-20 00:33:26,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:33:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-20 00:33:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-20 00:33:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 00:33:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-10-20 00:33:26,435 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2020-10-20 00:33:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:26,435 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-10-20 00:33:26,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 00:33:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-10-20 00:33:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 00:33:26,436 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:26,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:26,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 00:33:26,437 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:26,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:26,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2020-10-20 00:33:26,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:33:26,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367836927] [2020-10-20 00:33:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:33:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:26,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367836927] [2020-10-20 00:33:26,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:26,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:33:26,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528373783] [2020-10-20 00:33:26,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:33:26,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:33:26,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:33:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:33:26,534 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2020-10-20 00:33:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:26,628 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-10-20 00:33:26,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:33:26,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-20 00:33:26,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:26,630 INFO L225 Difference]: With dead ends: 53 [2020-10-20 00:33:26,630 INFO L226 Difference]: Without dead ends: 44 [2020-10-20 00:33:26,631 INFO L677 BasicCegarLoop]: 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 [2020-10-20 00:33:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-20 00:33:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2020-10-20 00:33:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 00:33:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-20 00:33:26,639 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2020-10-20 00:33:26,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:26,639 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-20 00:33:26,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:33:26,640 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-20 00:33:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 00:33:26,641 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:26,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:26,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 00:33:26,642 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:26,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:26,643 INFO L82 PathProgramCache]: Analyzing trace with hash 502201410, now seen corresponding path program 1 times [2020-10-20 00:33:26,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:33:26,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141486434] [2020-10-20 00:33:26,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:33:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:26,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141486434] [2020-10-20 00:33:26,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:26,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:33:26,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201895296] [2020-10-20 00:33:26,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:33:26,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:33:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:33:26,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:33:26,719 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2020-10-20 00:33:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:26,773 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2020-10-20 00:33:26,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:33:26,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-20 00:33:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:26,775 INFO L225 Difference]: With dead ends: 55 [2020-10-20 00:33:26,776 INFO L226 Difference]: Without dead ends: 46 [2020-10-20 00:33:26,776 INFO L677 BasicCegarLoop]: 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 [2020-10-20 00:33:26,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-20 00:33:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2020-10-20 00:33:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 00:33:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-20 00:33:26,783 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 12 [2020-10-20 00:33:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:26,783 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-20 00:33:26,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:33:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-20 00:33:26,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 00:33:26,785 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:26,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:26,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 00:33:26,785 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:26,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1951233721, now seen corresponding path program 1 times [2020-10-20 00:33:26,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:33:26,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642573477] [2020-10-20 00:33:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:33:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:26,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642573477] [2020-10-20 00:33:26,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:26,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:33:26,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858342856] [2020-10-20 00:33:26,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:33:26,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:33:26,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:33:26,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:33:26,848 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2020-10-20 00:33:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:26,905 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2020-10-20 00:33:26,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:33:26,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-20 00:33:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:26,907 INFO L225 Difference]: With dead ends: 57 [2020-10-20 00:33:26,907 INFO L226 Difference]: Without dead ends: 48 [2020-10-20 00:33:26,907 INFO L677 BasicCegarLoop]: 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 [2020-10-20 00:33:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-20 00:33:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2020-10-20 00:33:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 00:33:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-20 00:33:26,913 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 13 [2020-10-20 00:33:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:26,914 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-20 00:33:26,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:33:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-20 00:33:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 00:33:26,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:26,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:26,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 00:33:26,915 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:26,916 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2020-10-20 00:33:26,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:33:26,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227606692] [2020-10-20 00:33:26,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:33:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:26,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227606692] [2020-10-20 00:33:26,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:26,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:33:26,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764216665] [2020-10-20 00:33:26,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:33:26,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:33:26,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:33:26,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:33:26,963 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2020-10-20 00:33:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:27,010 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2020-10-20 00:33:27,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:33:27,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-20 00:33:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:27,012 INFO L225 Difference]: With dead ends: 55 [2020-10-20 00:33:27,012 INFO L226 Difference]: Without dead ends: 46 [2020-10-20 00:33:27,013 INFO L677 BasicCegarLoop]: 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 [2020-10-20 00:33:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-20 00:33:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2020-10-20 00:33:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 00:33:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-20 00:33:27,018 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2020-10-20 00:33:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:27,019 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-20 00:33:27,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:33:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-20 00:33:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 00:33:27,020 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:27,020 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:27,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 00:33:27,020 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:27,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2020-10-20 00:33:27,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:33:27,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264023300] [2020-10-20 00:33:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:33:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 00:33:27,049 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 00:33:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 00:33:27,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 00:33:27,108 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 00:33:27,109 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 00:33:27,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 00:33:27,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 12:33:27 BoogieIcfgContainer [2020-10-20 00:33:27,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 00:33:27,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 00:33:27,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 00:33:27,148 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 00:33:27,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:33:26" (3/4) ... [2020-10-20 00:33:27,159 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 00:33:27,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 00:33:27,162 INFO L168 Benchmark]: Toolchain (without parser) took 1916.28 ms. Allocated memory was 36.2 MB in the beginning and 53.5 MB in the end (delta: 17.3 MB). Free memory was 9.7 MB in the beginning and 37.0 MB in the end (delta: -27.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:27,163 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 35.7 MB. Free memory was 14.7 MB in the beginning and 14.7 MB in the end (delta: 49.2 kB). Peak memory consumption was 49.2 kB. Max. memory is 14.3 GB. [2020-10-20 00:33:27,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.46 ms. Allocated memory was 36.2 MB in the beginning and 45.1 MB in the end (delta: 8.9 MB). Free memory was 8.9 MB in the beginning and 26.9 MB in the end (delta: -18.0 MB). Peak memory consumption was 7.1 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:27,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.13 ms. Allocated memory is still 45.1 MB. Free memory was 26.9 MB in the beginning and 24.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:27,166 INFO L168 Benchmark]: Boogie Preprocessor took 30.57 ms. Allocated memory is still 45.1 MB. Free memory was 24.8 MB in the beginning and 23.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:27,167 INFO L168 Benchmark]: RCFGBuilder took 405.52 ms. Allocated memory was 45.1 MB in the beginning and 48.2 MB in the end (delta: 3.1 MB). Free memory was 23.0 MB in the beginning and 16.6 MB in the end (delta: 6.3 MB). Peak memory consumption was 12.8 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:27,168 INFO L168 Benchmark]: TraceAbstraction took 1054.98 ms. Allocated memory was 48.2 MB in the beginning and 51.4 MB in the end (delta: 3.1 MB). Free memory was 16.4 MB in the beginning and 12.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.0 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:27,169 INFO L168 Benchmark]: Witness Printer took 11.60 ms. Allocated memory was 51.4 MB in the beginning and 53.5 MB in the end (delta: 2.1 MB). Free memory was 12.5 MB in the beginning and 37.0 MB in the end (delta: -24.5 MB). Peak memory consumption was 143.7 kB. Max. memory is 14.3 GB. [2020-10-20 00:33:27,174 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.25 ms. Allocated memory is still 35.7 MB. Free memory was 14.7 MB in the beginning and 14.7 MB in the end (delta: 49.2 kB). Peak memory consumption was 49.2 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 358.46 ms. Allocated memory was 36.2 MB in the beginning and 45.1 MB in the end (delta: 8.9 MB). Free memory was 8.9 MB in the beginning and 26.9 MB in the end (delta: -18.0 MB). Peak memory consumption was 7.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 45.13 ms. Allocated memory is still 45.1 MB. Free memory was 26.9 MB in the beginning and 24.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 30.57 ms. Allocated memory is still 45.1 MB. Free memory was 24.8 MB in the beginning and 23.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 405.52 ms. Allocated memory was 45.1 MB in the beginning and 48.2 MB in the end (delta: 3.1 MB). Free memory was 23.0 MB in the beginning and 16.6 MB in the end (delta: 6.3 MB). Peak memory consumption was 12.8 MB. Max. memory is 14.3 GB. * TraceAbstraction took 1054.98 ms. Allocated memory was 48.2 MB in the beginning and 51.4 MB in the end (delta: 3.1 MB). Free memory was 16.4 MB in the beginning and 12.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.0 MB. Max. memory is 14.3 GB. * Witness Printer took 11.60 ms. Allocated memory was 51.4 MB in the beginning and 53.5 MB in the end (delta: 2.1 MB). Free memory was 12.5 MB in the beginning and 37.0 MB in the end (delta: -24.5 MB). Peak memory consumption was 143.7 kB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someUnaryDOUBLEoperation at line 81. Possible FailurePath: [L81] double x = -0.0; [L82] double y = 0.0; [L26] __uint32_t msw, lsw; [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L38-L39] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L41-L42] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L45-L46] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L49] return 0; [L54] COND TRUE __fpclassify_double(x) == 0 [L55] return y; [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L3] __assert_fail("0", "double_req_bl_1252a.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.9s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 64 SDslu, 298 SDs, 0 SdLazy, 84 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, 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, 5 MinimizatonAttempts, 60 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 00:33:29,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:33:29,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:33:29,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:33:29,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:33:29,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:33:29,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:33:29,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:33:29,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:33:29,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:33:29,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:33:29,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:33:29,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:33:29,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:33:29,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:33:29,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:33:29,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:33:29,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:33:29,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:33:29,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:33:29,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:33:29,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:33:29,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:33:29,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:33:29,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:33:29,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:33:29,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:33:29,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:33:29,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:33:29,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:33:29,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:33:29,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:33:29,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:33:29,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:33:29,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:33:29,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:33:29,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:33:29,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:33:29,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:33:29,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:33:29,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:33:29,343 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-20 00:33:29,364 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:33:29,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:33:29,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:33:29,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:33:29,366 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:33:29,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:33:29,367 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:33:29,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:33:29,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:33:29,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:33:29,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:33:29,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:33:29,368 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-20 00:33:29,368 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-20 00:33:29,368 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:33:29,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:33:29,368 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:33:29,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:33:29,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:33:29,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:33:29,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:33:29,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:33:29,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:33:29,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:33:29,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:33:29,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:33:29,370 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-20 00:33:29,370 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-20 00:33:29,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:33:29,371 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:33:29,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-20 00:33:29,371 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 23f3104f6bf674f4cf2d86feffb86c85d21d7d18 [2020-10-20 00:33:29,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:33:29,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:33:29,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:33:29,616 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:33:29,617 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:33:29,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2020-10-20 00:33:29,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0a99e83/0b21a4199172458a8c61c1ef20655abe/FLAG6d236d9d1 [2020-10-20 00:33:30,098 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:33:30,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2020-10-20 00:33:30,106 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0a99e83/0b21a4199172458a8c61c1ef20655abe/FLAG6d236d9d1 [2020-10-20 00:33:30,530 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f0a99e83/0b21a4199172458a8c61c1ef20655abe [2020-10-20 00:33:30,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:33:30,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:33:30,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:33:30,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:33:30,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:33:30,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:33:30" (1/1) ... [2020-10-20 00:33:30,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63522197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30, skipping insertion in model container [2020-10-20 00:33:30,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:33:30" (1/1) ... [2020-10-20 00:33:30,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:33:30,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:33:30,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:33:30,853 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:33:30,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:33:30,904 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:33:30,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30 WrapperNode [2020-10-20 00:33:30,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:33:30,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:33:30,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:33:30,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:33:30,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30" (1/1) ... [2020-10-20 00:33:30,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30" (1/1) ... [2020-10-20 00:33:30,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:33:30,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:33:30,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:33:30,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:33:30,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30" (1/1) ... [2020-10-20 00:33:30,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30" (1/1) ... [2020-10-20 00:33:30,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30" (1/1) ... [2020-10-20 00:33:30,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30" (1/1) ... [2020-10-20 00:33:30,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30" (1/1) ... [2020-10-20 00:33:30,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30" (1/1) ... [2020-10-20 00:33:30,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30" (1/1) ... [2020-10-20 00:33:30,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:33:30,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:33:30,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:33:30,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:33:30,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:33:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-10-20 00:33:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-20 00:33:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:33:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-20 00:33:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:33:31,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:33:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 00:33:31,507 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:33:31,507 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-20 00:33:31,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:33:31 BoogieIcfgContainer [2020-10-20 00:33:31,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:33:31,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:33:31,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:33:31,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:33:31,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:33:30" (1/3) ... [2020-10-20 00:33:31,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3bf73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:33:31, skipping insertion in model container [2020-10-20 00:33:31,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:33:30" (2/3) ... [2020-10-20 00:33:31,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3bf73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:33:31, skipping insertion in model container [2020-10-20 00:33:31,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:33:31" (3/3) ... [2020-10-20 00:33:31,517 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2020-10-20 00:33:31,538 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:33:31,545 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 00:33:31,559 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 00:33:31,587 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:33:31,587 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:33:31,587 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:33:31,587 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:33:31,588 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:33:31,588 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:33:31,588 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:33:31,588 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:33:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-10-20 00:33:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 00:33:31,623 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:31,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:31,625 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:31,629 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2020-10-20 00:33:31,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:33:31,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782511944] [2020-10-20 00:33:31,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-20 00:33:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:31,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-20 00:33:31,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:33:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:31,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:33:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:31,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782511944] [2020-10-20 00:33:31,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:31,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-20 00:33:31,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207434031] [2020-10-20 00:33:31,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 00:33:31,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:33:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 00:33:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:33:31,798 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2020-10-20 00:33:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:31,819 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2020-10-20 00:33:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 00:33:31,820 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-20 00:33:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:31,831 INFO L225 Difference]: With dead ends: 63 [2020-10-20 00:33:31,832 INFO L226 Difference]: Without dead ends: 29 [2020-10-20 00:33:31,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:33:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-20 00:33:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-20 00:33:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-20 00:33:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-10-20 00:33:31,887 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2020-10-20 00:33:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:31,887 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-10-20 00:33:31,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 00:33:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-10-20 00:33:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 00:33:31,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:31,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:32,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-20 00:33:32,103 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:32,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2020-10-20 00:33:32,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:33:32,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745936551] [2020-10-20 00:33:32,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-20 00:33:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:32,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 00:33:32,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:33:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:32,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:33:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:32,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745936551] [2020-10-20 00:33:32,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:32,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-20 00:33:32,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828298150] [2020-10-20 00:33:32,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 00:33:32,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:33:32,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 00:33:32,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:33:32,260 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2020-10-20 00:33:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:32,361 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2020-10-20 00:33:32,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:33:32,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-20 00:33:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:32,363 INFO L225 Difference]: With dead ends: 68 [2020-10-20 00:33:32,363 INFO L226 Difference]: Without dead ends: 59 [2020-10-20 00:33:32,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 00:33:32,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-20 00:33:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2020-10-20 00:33:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 00:33:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-20 00:33:32,371 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2020-10-20 00:33:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:32,372 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-20 00:33:32,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 00:33:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-20 00:33:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 00:33:32,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:32,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:32,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-20 00:33:32,594 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:32,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:32,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2020-10-20 00:33:32,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:33:32,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193360181] [2020-10-20 00:33:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-20 00:33:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:32,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 00:33:32,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:33:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:32,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:33:32,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:33:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:32,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193360181] [2020-10-20 00:33:32,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:32,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-20 00:33:32,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600787052] [2020-10-20 00:33:32,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 00:33:32,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:33:32,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 00:33:32,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:33:32,830 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2020-10-20 00:33:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:32,972 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2020-10-20 00:33:32,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:33:32,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-20 00:33:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:32,974 INFO L225 Difference]: With dead ends: 52 [2020-10-20 00:33:32,974 INFO L226 Difference]: Without dead ends: 28 [2020-10-20 00:33:32,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:33:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-10-20 00:33:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-10-20 00:33:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 00:33:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-10-20 00:33:32,980 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2020-10-20 00:33:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:32,980 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-10-20 00:33:32,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 00:33:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-10-20 00:33:32,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 00:33:32,981 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:32,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:33,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-20 00:33:33,197 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:33,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:33,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2020-10-20 00:33:33,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:33:33,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313886968] [2020-10-20 00:33:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-20 00:33:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:33,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 00:33:33,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:33:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:33,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:33:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:33,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313886968] [2020-10-20 00:33:33,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:33,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-20 00:33:33,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351002733] [2020-10-20 00:33:33,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 00:33:33,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:33:33,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 00:33:33,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:33:33,353 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2020-10-20 00:33:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:33,527 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-10-20 00:33:33,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:33:33,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-20 00:33:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:33,530 INFO L225 Difference]: With dead ends: 65 [2020-10-20 00:33:33,530 INFO L226 Difference]: Without dead ends: 56 [2020-10-20 00:33:33,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 00:33:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-20 00:33:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2020-10-20 00:33:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-20 00:33:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-10-20 00:33:33,537 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2020-10-20 00:33:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:33,537 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-10-20 00:33:33,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 00:33:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-10-20 00:33:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 00:33:33,539 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:33,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:33,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-20 00:33:33,754 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:33,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:33,754 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2020-10-20 00:33:33,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:33:33,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838941550] [2020-10-20 00:33:33,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-20 00:33:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:33,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 00:33:33,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:33:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:33,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:33:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:33,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838941550] [2020-10-20 00:33:33,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:33,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-20 00:33:33,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71723967] [2020-10-20 00:33:33,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:33:33,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:33:33,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:33:33,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:33:33,928 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2020-10-20 00:33:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:33,940 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-10-20 00:33:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:33:33,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-20 00:33:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:33,942 INFO L225 Difference]: With dead ends: 40 [2020-10-20 00:33:33,942 INFO L226 Difference]: Without dead ends: 30 [2020-10-20 00:33:33,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:33:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-10-20 00:33:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-10-20 00:33:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-20 00:33:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2020-10-20 00:33:33,947 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2020-10-20 00:33:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:33,947 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-10-20 00:33:33,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:33:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-10-20 00:33:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 00:33:33,948 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:33,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:34,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-20 00:33:34,149 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:34,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:34,150 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2020-10-20 00:33:34,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:33:34,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842079912] [2020-10-20 00:33:34,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-20 00:33:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:34,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 00:33:34,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:33:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:34,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:33:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:34,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842079912] [2020-10-20 00:33:34,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:34,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-10-20 00:33:34,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448717785] [2020-10-20 00:33:34,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 00:33:34,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:33:34,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 00:33:34,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:33:34,374 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2020-10-20 00:33:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:34,482 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-10-20 00:33:34,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 00:33:34,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-10-20 00:33:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:34,483 INFO L225 Difference]: With dead ends: 42 [2020-10-20 00:33:34,483 INFO L226 Difference]: Without dead ends: 39 [2020-10-20 00:33:34,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-10-20 00:33:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-20 00:33:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2020-10-20 00:33:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-20 00:33:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2020-10-20 00:33:34,489 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2020-10-20 00:33:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:34,490 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2020-10-20 00:33:34,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 00:33:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-10-20 00:33:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 00:33:34,490 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:34,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:34,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-20 00:33:34,702 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:34,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:34,703 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2020-10-20 00:33:34,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:33:34,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362151155] [2020-10-20 00:33:34,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-20 00:33:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:34,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 00:33:34,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:33:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:34,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:33:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:34,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362151155] [2020-10-20 00:33:34,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:34,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-10-20 00:33:34,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519357609] [2020-10-20 00:33:34,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 00:33:34,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:33:34,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 00:33:34,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-20 00:33:34,918 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2020-10-20 00:33:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:35,039 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-10-20 00:33:35,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:33:35,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-10-20 00:33:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:35,042 INFO L225 Difference]: With dead ends: 45 [2020-10-20 00:33:35,042 INFO L226 Difference]: Without dead ends: 27 [2020-10-20 00:33:35,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-20 00:33:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-20 00:33:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-20 00:33:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 00:33:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-10-20 00:33:35,055 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2020-10-20 00:33:35,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:35,055 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-10-20 00:33:35,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 00:33:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-10-20 00:33:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 00:33:35,057 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:33:35,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:33:35,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-20 00:33:35,258 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:33:35,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:33:35,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2020-10-20 00:33:35,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:33:35,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81773702] [2020-10-20 00:33:35,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-20 00:33:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:33:35,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-20 00:33:35,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:33:35,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:33:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:35,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:33:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:33:35,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81773702] [2020-10-20 00:33:35,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:33:35,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2020-10-20 00:33:35,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792849775] [2020-10-20 00:33:35,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 00:33:35,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:33:35,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 00:33:35,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-10-20 00:33:35,753 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2020-10-20 00:33:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:33:36,014 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-10-20 00:33:36,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 00:33:36,014 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2020-10-20 00:33:36,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:33:36,015 INFO L225 Difference]: With dead ends: 27 [2020-10-20 00:33:36,015 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 00:33:36,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2020-10-20 00:33:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 00:33:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 00:33:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 00:33:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 00:33:36,017 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-20 00:33:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:33:36,018 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 00:33:36,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 00:33:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 00:33:36,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 00:33:36,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-20 00:33:36,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-20 00:33:36,547 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-20 00:33:36,547 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-20 00:33:36,547 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-20 00:33:36,547 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-20 00:33:36,547 INFO L274 CegarLoopResult]: For program point L28-1(lines 28 33) no Hoare annotation was computed. [2020-10-20 00:33:36,548 INFO L270 CegarLoopResult]: At program point L28-2(lines 28 33) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= .cse0 ULTIMATE.start_fmax_double_~x))) [2020-10-20 00:33:36,548 INFO L274 CegarLoopResult]: For program point L28-3(lines 25 50) no Hoare annotation was computed. [2020-10-20 00:33:36,548 INFO L274 CegarLoopResult]: For program point L28-5(lines 28 33) no Hoare annotation was computed. [2020-10-20 00:33:36,548 INFO L270 CegarLoopResult]: At program point L28-6(lines 28 33) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x)) [2020-10-20 00:33:36,548 INFO L274 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-10-20 00:33:36,548 INFO L274 CegarLoopResult]: For program point L28-7(lines 25 50) no Hoare annotation was computed. [2020-10-20 00:33:36,548 INFO L274 CegarLoopResult]: For program point L86-2(lines 86 89) no Hoare annotation was computed. [2020-10-20 00:33:36,549 INFO L274 CegarLoopResult]: For program point L45(lines 45 49) no Hoare annotation was computed. [2020-10-20 00:33:36,549 INFO L274 CegarLoopResult]: For program point L45-1(lines 45 49) no Hoare annotation was computed. [2020-10-20 00:33:36,549 INFO L274 CegarLoopResult]: For program point L54(lines 54 55) no Hoare annotation was computed. [2020-10-20 00:33:36,549 INFO L270 CegarLoopResult]: At program point L71(lines 62 72) the Hoare annotation is: (and (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res|) |ULTIMATE.start_main_#t~short18| (= (_ +zero 11 53) ULTIMATE.start_main_~res~0) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (exists ((v_skolemized_v_prenex_5_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_5_3) ((_ extract 62 52) v_skolemized_v_prenex_5_3) ((_ extract 51 0) v_skolemized_v_prenex_5_3)) (_ +zero 11 53)) (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_5_3)))) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (_ +zero 11 53) (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|))))) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start___signbit_double_~x (_ +zero 11 53))) [2020-10-20 00:33:36,549 INFO L274 CegarLoopResult]: For program point L38(lines 38 49) no Hoare annotation was computed. [2020-10-20 00:33:36,549 INFO L274 CegarLoopResult]: For program point L38-1(lines 38 49) no Hoare annotation was computed. [2020-10-20 00:33:36,549 INFO L274 CegarLoopResult]: For program point L56(lines 56 57) no Hoare annotation was computed. [2020-10-20 00:33:36,551 INFO L274 CegarLoopResult]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2020-10-20 00:33:36,551 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-20 00:33:36,553 INFO L270 CegarLoopResult]: At program point L65-2(lines 65 69) the Hoare annotation is: (and (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res|) |ULTIMATE.start_main_#t~short18| (= (_ +zero 11 53) ULTIMATE.start_main_~res~0) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (_ +zero 11 53) (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|))))) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start___signbit_double_~x (_ +zero 11 53))) [2020-10-20 00:33:36,553 INFO L274 CegarLoopResult]: For program point L65-3(lines 65 69) no Hoare annotation was computed. [2020-10-20 00:33:36,554 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 00:33:36,554 INFO L270 CegarLoopResult]: At program point L49(lines 25 50) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.neg (_ +zero 11 53))))) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= .cse0 ULTIMATE.start_fmax_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)))) [2020-10-20 00:33:36,554 INFO L270 CegarLoopResult]: At program point L49-1(lines 25 50) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (_ +zero 11 53) (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|))))) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|))) [2020-10-20 00:33:36,554 INFO L274 CegarLoopResult]: For program point L41(lines 41 49) no Hoare annotation was computed. [2020-10-20 00:33:36,554 INFO L274 CegarLoopResult]: For program point L41-1(lines 41 49) no Hoare annotation was computed. [2020-10-20 00:33:36,554 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-20 00:33:36,555 INFO L277 CegarLoopResult]: At program point L91(lines 74 92) the Hoare annotation is: true [2020-10-20 00:33:36,555 INFO L274 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2020-10-20 00:33:36,555 INFO L274 CegarLoopResult]: For program point L59-2(line 59) no Hoare annotation was computed. [2020-10-20 00:33:36,556 INFO L270 CegarLoopResult]: At program point L59-3(lines 52 60) the Hoare annotation is: (and (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (_ +zero 11 53) (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|))))) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x)) [2020-10-20 00:33:36,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 12:33:36 BoogieIcfgContainer [2020-10-20 00:33:36,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 00:33:36,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 00:33:36,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 00:33:36,591 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 00:33:36,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:33:31" (3/4) ... [2020-10-20 00:33:36,595 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 00:33:36,607 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2020-10-20 00:33:36,607 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-10-20 00:33:36,607 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-20 00:33:36,608 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 00:33:36,636 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_1_3 : bv64 :: v_skolemized_v_prenex_1_3[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_v_prenex_1_3[63:63], v_skolemized_v_prenex_1_3[62:52], v_skolemized_v_prenex_1_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == y) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && !(0bv32 == \result) [2020-10-20 00:33:36,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~Pluszero~LONGDOUBLE() == \result && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x [2020-10-20 00:33:36,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~Pluszero~LONGDOUBLE() == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && x == ~Pluszero~LONGDOUBLE() [2020-10-20 00:33:36,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~Pluszero~LONGDOUBLE() == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == y) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~Pluszero~LONGDOUBLE() && msw == v_skolemized_v_prenex_5_3[63:32])) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && \result == 0bv32) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && x == ~Pluszero~LONGDOUBLE() [2020-10-20 00:33:36,638 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~Pluszero~LONGDOUBLE() == y && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result) [2020-10-20 00:33:36,687 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 00:33:36,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 00:33:36,690 INFO L168 Benchmark]: Toolchain (without parser) took 6155.29 ms. Allocated memory was 35.1 MB in the beginning and 56.6 MB in the end (delta: 21.5 MB). Free memory was 12.7 MB in the beginning and 36.3 MB in the end (delta: -23.7 MB). Peak memory consumption was 23.6 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:36,691 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 34.1 MB. Free memory was 19.4 MB in the beginning and 19.4 MB in the end (delta: 31.6 kB). Peak memory consumption was 31.6 kB. Max. memory is 14.3 GB. [2020-10-20 00:33:36,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.46 ms. Allocated memory was 35.1 MB in the beginning and 43.5 MB in the end (delta: 8.4 MB). Free memory was 11.7 MB in the beginning and 22.2 MB in the end (delta: -10.5 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:36,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.88 ms. Allocated memory is still 43.5 MB. Free memory was 22.0 MB in the beginning and 20.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:36,693 INFO L168 Benchmark]: Boogie Preprocessor took 41.63 ms. Allocated memory is still 43.5 MB. Free memory was 20.1 MB in the beginning and 18.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:36,693 INFO L168 Benchmark]: RCFGBuilder took 513.81 ms. Allocated memory was 43.5 MB in the beginning and 45.6 MB in the end (delta: 2.1 MB). Free memory was 18.0 MB in the beginning and 22.3 MB in the end (delta: -4.3 MB). Peak memory consumption was 9.2 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:36,694 INFO L168 Benchmark]: TraceAbstraction took 5080.16 ms. Allocated memory was 45.6 MB in the beginning and 54.5 MB in the end (delta: 8.9 MB). Free memory was 21.9 MB in the beginning and 12.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:36,695 INFO L168 Benchmark]: Witness Printer took 97.21 ms. Allocated memory was 54.5 MB in the beginning and 56.6 MB in the end (delta: 2.1 MB). Free memory was 12.8 MB in the beginning and 36.3 MB in the end (delta: -23.6 MB). Peak memory consumption was 4.3 MB. Max. memory is 14.3 GB. [2020-10-20 00:33:36,699 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.24 ms. Allocated memory is still 34.1 MB. Free memory was 19.4 MB in the beginning and 19.4 MB in the end (delta: 31.6 kB). Peak memory consumption was 31.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 365.46 ms. Allocated memory was 35.1 MB in the beginning and 43.5 MB in the end (delta: 8.4 MB). Free memory was 11.7 MB in the beginning and 22.2 MB in the end (delta: -10.5 MB). Peak memory consumption was 10.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 46.88 ms. Allocated memory is still 43.5 MB. Free memory was 22.0 MB in the beginning and 20.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 41.63 ms. Allocated memory is still 43.5 MB. Free memory was 20.1 MB in the beginning and 18.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * RCFGBuilder took 513.81 ms. Allocated memory was 43.5 MB in the beginning and 45.6 MB in the end (delta: 2.1 MB). Free memory was 18.0 MB in the beginning and 22.3 MB in the end (delta: -4.3 MB). Peak memory consumption was 9.2 MB. Max. memory is 14.3 GB. * TraceAbstraction took 5080.16 ms. Allocated memory was 45.6 MB in the beginning and 54.5 MB in the end (delta: 8.9 MB). Free memory was 21.9 MB in the beginning and 12.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 14.3 GB. * Witness Printer took 97.21 ms. Allocated memory was 54.5 MB in the beginning and 56.6 MB in the end (delta: 2.1 MB). Free memory was 12.8 MB in the beginning and 36.3 MB in the end (delta: -23.6 MB). Peak memory consumption was 4.3 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant [2020-10-20 00:33:36,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((((~Pluszero~LONGDOUBLE() == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == y && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 25]: Loop Invariant [2020-10-20 00:33:36,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((~Pluszero~LONGDOUBLE() == y && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == y && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 25]: Loop Invariant [2020-10-20 00:33:36,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-20 00:33:36,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_v_prenex_1_3 : bv64 :: v_skolemized_v_prenex_1_3[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_v_prenex_1_3[63:63], v_skolemized_v_prenex_1_3[62:52], v_skolemized_v_prenex_1_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == y) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && !(0bv32 == \result) - InvariantResult [Line: 62]: Loop Invariant [2020-10-20 00:33:36,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-20 00:33:36,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((((((~Pluszero~LONGDOUBLE() == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == y) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~Pluszero~LONGDOUBLE() && msw == v_skolemized_v_prenex_5_3[63:32])) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && \result == 0bv32) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 52]: Loop Invariant [2020-10-20 00:33:36,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-20 00:33:36,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((~Pluszero~LONGDOUBLE() == \result && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.6s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 252 SDtfs, 287 SDslu, 527 SDs, 0 SdLazy, 183 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, 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, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 205 HoareAnnotationTreeSize, 8 FomulaSimplifications, 47 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 35 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 18200 SizeOfPredicates, 38 NumberOfNonLiveVariables, 555 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...