./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 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 .............................................................................................................................................................................................................................................................................................................................................................. 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 -Xmx12G -Xms1G -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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:12:29,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:12:29,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:12:29,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:12:29,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:12:29,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:12:29,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:12:29,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:12:29,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:12:29,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:12:29,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:12:29,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:12:29,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:12:29,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:12:29,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:12:29,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:12:29,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:12:29,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:12:29,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:12:29,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:12:29,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:12:29,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:12:29,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:12:29,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:12:29,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:12:29,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:12:29,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:12:29,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:12:29,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:12:29,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:12:29,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:12:29,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:12:29,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:12:29,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:12:29,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:12:29,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:12:29,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:12:29,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:12:29,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:12:29,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:12:29,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:12:29,129 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:12:29,167 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:12:29,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:12:29,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:12:29,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:12:29,170 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:12:29,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:12:29,171 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:12:29,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:12:29,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:12:29,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:12:29,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:12:29,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:12:29,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:12:29,173 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:12:29,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:12:29,173 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:12:29,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:12:29,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:12:29,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:12:29,175 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:12:29,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:12:29,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:12:29,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:12:29,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:12:29,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:12:29,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:12:29,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:12:29,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:12:29,177 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(__VERIFIER_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 -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2019-11-19 21:12:29,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:12:29,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:12:29,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:12:29,559 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:12:29,559 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:12:29,560 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-19 21:12:29,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8627a2643/c8d0b1219707446ab59c3d3bfd1141b1/FLAGfdc5109d4 [2019-11-19 21:12:30,105 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:12:30,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-19 21:12:30,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8627a2643/c8d0b1219707446ab59c3d3bfd1141b1/FLAGfdc5109d4 [2019-11-19 21:12:30,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8627a2643/c8d0b1219707446ab59c3d3bfd1141b1 [2019-11-19 21:12:30,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:12:30,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:12:30,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:30,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:12:30,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:12:30,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:30" (1/1) ... [2019-11-19 21:12:30,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5697c405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:30, skipping insertion in model container [2019-11-19 21:12:30,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:30" (1/1) ... [2019-11-19 21:12:30,561 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:12:30,588 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:12:30,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:30,820 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:12:30,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:30,953 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:12:30,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:30 WrapperNode [2019-11-19 21:12:30,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:30,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:30,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:12:30,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:12:30,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:30" (1/1) ... [2019-11-19 21:12:30,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:30" (1/1) ... [2019-11-19 21:12:31,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:31,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:12:31,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:12:31,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:12:31,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:30" (1/1) ... [2019-11-19 21:12:31,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:30" (1/1) ... [2019-11-19 21:12:31,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:30" (1/1) ... [2019-11-19 21:12:31,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:30" (1/1) ... [2019-11-19 21:12:31,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:30" (1/1) ... [2019-11-19 21:12:31,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:30" (1/1) ... [2019-11-19 21:12:31,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:30" (1/1) ... [2019-11-19 21:12:31,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:12:31,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:12:31,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:12:31,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:12:31,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12: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 [2019-11-19 21:12:31,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:12:31,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-19 21:12:31,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:12:31,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:12:31,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 21:12:31,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:12:31,542 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:12:31,542 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-19 21:12:31,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:31 BoogieIcfgContainer [2019-11-19 21:12:31,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:12:31,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:12:31,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:12:31,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:12:31,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:12:30" (1/3) ... [2019-11-19 21:12:31,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6ef1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:31, skipping insertion in model container [2019-11-19 21:12:31,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:30" (2/3) ... [2019-11-19 21:12:31,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6ef1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:31, skipping insertion in model container [2019-11-19 21:12:31,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:31" (3/3) ... [2019-11-19 21:12:31,553 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-11-19 21:12:31,566 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:12:31,576 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:12:31,589 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:12:31,611 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:12:31,611 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:12:31,611 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:12:31,611 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:12:31,611 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:12:31,612 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:12:31,612 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:12:31,612 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:12:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-19 21:12:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 21:12:31,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:31,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:31,635 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:31,641 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-19 21:12:31,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:12:31,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914612615] [2019-11-19 21:12:31,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:12:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:31,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914612615] [2019-11-19 21:12:31,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:31,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:12:31,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338822593] [2019-11-19 21:12:31,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:12:31,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:12:31,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:12:31,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:12:31,788 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-19 21:12:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:31,811 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-19 21:12:31,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:12:31,813 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-19 21:12:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:31,825 INFO L225 Difference]: With dead ends: 62 [2019-11-19 21:12:31,825 INFO L226 Difference]: Without dead ends: 29 [2019-11-19 21:12:31,829 INFO L630 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 [2019-11-19 21:12:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-19 21:12:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-19 21:12:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 21:12:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-19 21:12:31,873 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-19 21:12:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:31,873 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-19 21:12:31,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:12:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-19 21:12:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 21:12:31,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:31,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:31,875 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:31,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:31,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-19 21:12:31,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:12:31,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391259311] [2019-11-19 21:12:31,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:12:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:31,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391259311] [2019-11-19 21:12:31,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:31,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:12:31,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471831927] [2019-11-19 21:12:31,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:12:31,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:12:31,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:12:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:12:31,974 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-11-19 21:12:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:32,064 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-19 21:12:32,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:12:32,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-19 21:12:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:32,068 INFO L225 Difference]: With dead ends: 53 [2019-11-19 21:12:32,068 INFO L226 Difference]: Without dead ends: 44 [2019-11-19 21:12:32,069 INFO L630 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 [2019-11-19 21:12:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-19 21:12:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-19 21:12:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 21:12:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-19 21:12:32,077 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-19 21:12:32,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:32,077 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-19 21:12:32,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:12:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-19 21:12:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 21:12:32,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:32,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:32,079 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:32,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:32,079 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-11-19 21:12:32,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:12:32,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799940547] [2019-11-19 21:12:32,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:12:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:32,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799940547] [2019-11-19 21:12:32,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:32,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:12:32,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697137330] [2019-11-19 21:12:32,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:12:32,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:12:32,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:12:32,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:12:32,202 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-19 21:12:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:32,262 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-11-19 21:12:32,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:12:32,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-19 21:12:32,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:32,265 INFO L225 Difference]: With dead ends: 55 [2019-11-19 21:12:32,265 INFO L226 Difference]: Without dead ends: 46 [2019-11-19 21:12:32,266 INFO L630 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 [2019-11-19 21:12:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-19 21:12:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-19 21:12:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 21:12:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-19 21:12:32,273 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-11-19 21:12:32,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:32,273 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-19 21:12:32,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:12:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-19 21:12:32,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 21:12:32,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:32,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:32,276 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:32,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:32,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-19 21:12:32,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:12:32,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328559819] [2019-11-19 21:12:32,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:12:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:12:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:12:32,396 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:12:32,396 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:12:32,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:12:32 BoogieIcfgContainer [2019-11-19 21:12:32,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:12:32,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:12:32,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:12:32,431 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:12:32,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:31" (3/4) ... [2019-11-19 21:12:32,435 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 21:12:32,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:12:32,438 INFO L168 Benchmark]: Toolchain (without parser) took 1894.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -75.4 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:32,439 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:12:32,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:32,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:12:32,441 INFO L168 Benchmark]: Boogie Preprocessor took 31.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:12:32,442 INFO L168 Benchmark]: RCFGBuilder took 497.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:32,443 INFO L168 Benchmark]: TraceAbstraction took 885.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:32,443 INFO L168 Benchmark]: Witness Printer took 4.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:12:32,447 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 411.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 497.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 885.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 85]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 79. Possible FailurePath: [L79] double x = -0.0; [L80] double y = 0.0; [L24] __uint32_t msw, lsw; [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.8s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 140 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: 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.24-678e011 [2019-11-19 21:12:34,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:12:34,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:12:34,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:12:34,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:12:34,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:12:34,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:12:34,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:12:34,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:12:34,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:12:34,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:12:34,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:12:34,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:12:34,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:12:34,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:12:34,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:12:34,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:12:34,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:12:34,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:12:34,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:12:34,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:12:34,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:12:34,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:12:34,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:12:34,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:12:34,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:12:34,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:12:34,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:12:34,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:12:34,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:12:34,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:12:34,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:12:34,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:12:34,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:12:34,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:12:34,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:12:34,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:12:34,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:12:34,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:12:34,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:12:34,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:12:34,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 21:12:34,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:12:34,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:12:34,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:12:34,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:12:34,627 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:12:34,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:12:34,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:12:34,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:12:34,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:12:34,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:12:34,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:12:34,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:12:34,629 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 21:12:34,629 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 21:12:34,630 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:12:34,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:12:34,630 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:12:34,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:12:34,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:12:34,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:12:34,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:12:34,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:12:34,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:12:34,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:12:34,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:12:34,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:12:34,633 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 21:12:34,634 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 21:12:34,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:12:34,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 21:12:34,634 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(__VERIFIER_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 -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2019-11-19 21:12:34,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:12:34,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:12:34,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:12:34,976 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:12:34,976 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:12:34,977 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-19 21:12:35,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b40fb2f9e/e0f1d3f71ae5484689aaf93f3e4f31ae/FLAGc662f1105 [2019-11-19 21:12:35,555 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:12:35,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-19 21:12:35,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b40fb2f9e/e0f1d3f71ae5484689aaf93f3e4f31ae/FLAGc662f1105 [2019-11-19 21:12:35,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b40fb2f9e/e0f1d3f71ae5484689aaf93f3e4f31ae [2019-11-19 21:12:35,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:12:35,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:12:35,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:35,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:12:35,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:12:35,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:35" (1/1) ... [2019-11-19 21:12:35,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9f6a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:35, skipping insertion in model container [2019-11-19 21:12:35,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:35" (1/1) ... [2019-11-19 21:12:35,931 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:12:35,954 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:12:36,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:36,217 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:12:36,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:36,354 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:12:36,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:36 WrapperNode [2019-11-19 21:12:36,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:36,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:36,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:12:36,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:12:36,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:36" (1/1) ... [2019-11-19 21:12:36,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:36" (1/1) ... [2019-11-19 21:12:36,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:36,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:12:36,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:12:36,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:12:36,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:36" (1/1) ... [2019-11-19 21:12:36,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:36" (1/1) ... [2019-11-19 21:12:36,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:36" (1/1) ... [2019-11-19 21:12:36,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:36" (1/1) ... [2019-11-19 21:12:36,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:36" (1/1) ... [2019-11-19 21:12:36,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:36" (1/1) ... [2019-11-19 21:12:36,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:36" (1/1) ... [2019-11-19 21:12:36,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:12:36,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:12:36,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:12:36,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:12:36,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:36" (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 [2019-11-19 21:12:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-19 21:12:36,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:12:36,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 21:12:36,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:12:36,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:12:36,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:12:37,010 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:12:37,010 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-19 21:12:37,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:37 BoogieIcfgContainer [2019-11-19 21:12:37,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:12:37,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:12:37,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:12:37,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:12:37,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:12:35" (1/3) ... [2019-11-19 21:12:37,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97e06f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:37, skipping insertion in model container [2019-11-19 21:12:37,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:36" (2/3) ... [2019-11-19 21:12:37,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97e06f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:37, skipping insertion in model container [2019-11-19 21:12:37,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:37" (3/3) ... [2019-11-19 21:12:37,024 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-11-19 21:12:37,034 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:12:37,041 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:12:37,053 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:12:37,075 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:12:37,076 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:12:37,076 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:12:37,076 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:12:37,076 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:12:37,077 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:12:37,077 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:12:37,077 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:12:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-19 21:12:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 21:12:37,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:37,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:37,098 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:37,104 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-19 21:12:37,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:37,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842752054] [2019-11-19 21:12:37,117 INFO L94 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 [2019-11-19 21:12:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:37,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 21:12:37,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:37,230 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:37,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842752054] [2019-11-19 21:12:37,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:37,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 21:12:37,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181749489] [2019-11-19 21:12:37,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:12:37,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:37,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:12:37,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:12:37,254 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-19 21:12:37,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:37,274 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-19 21:12:37,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:12:37,276 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-19 21:12:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:37,287 INFO L225 Difference]: With dead ends: 62 [2019-11-19 21:12:37,287 INFO L226 Difference]: Without dead ends: 29 [2019-11-19 21:12:37,290 INFO L630 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 [2019-11-19 21:12:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-19 21:12:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-19 21:12:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 21:12:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-19 21:12:37,328 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-19 21:12:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:37,328 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-19 21:12:37,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:12:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-19 21:12:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 21:12:37,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:37,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:37,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-19 21:12:37,540 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:37,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-19 21:12:37,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:37,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084711852] [2019-11-19 21:12:37,544 INFO L94 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 [2019-11-19 21:12:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:37,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 21:12:37,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:37,660 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:37,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084711852] [2019-11-19 21:12:37,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:37,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 21:12:37,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813618067] [2019-11-19 21:12:37,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:12:37,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:37,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:12:37,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:12:37,694 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-11-19 21:12:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:37,842 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-11-19 21:12:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:12:37,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-19 21:12:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:37,845 INFO L225 Difference]: With dead ends: 68 [2019-11-19 21:12:37,845 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 21:12:37,846 INFO L630 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 [2019-11-19 21:12:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 21:12:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-19 21:12:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 21:12:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-19 21:12:37,855 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-19 21:12:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:37,856 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-19 21:12:37,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:12:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-19 21:12:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 21:12:37,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:37,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:38,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-19 21:12:38,083 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-19 21:12:38,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:38,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112631607] [2019-11-19 21:12:38,089 INFO L94 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 [2019-11-19 21:12:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:38,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 21:12:38,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:38,228 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:38,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:38,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112631607] [2019-11-19 21:12:38,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:38,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 21:12:38,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795261326] [2019-11-19 21:12:38,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:12:38,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:38,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:12:38,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:12:38,319 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2019-11-19 21:12:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:38,440 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-19 21:12:38,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:12:38,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-19 21:12:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:38,442 INFO L225 Difference]: With dead ends: 52 [2019-11-19 21:12:38,442 INFO L226 Difference]: Without dead ends: 28 [2019-11-19 21:12:38,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:12:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-19 21:12:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-19 21:12:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 21:12:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-19 21:12:38,449 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2019-11-19 21:12:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:38,449 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-19 21:12:38,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:12:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-19 21:12:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 21:12:38,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:38,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:38,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-19 21:12:38,665 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:38,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-11-19 21:12:38,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:38,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195095111] [2019-11-19 21:12:38,668 INFO L94 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 [2019-11-19 21:12:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:38,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 21:12:38,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:38,790 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:38,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195095111] [2019-11-19 21:12:38,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:38,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 21:12:38,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200471449] [2019-11-19 21:12:38,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:12:38,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:38,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:12:38,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:12:38,810 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-11-19 21:12:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:38,911 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-11-19 21:12:38,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:12:38,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-19 21:12:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:38,913 INFO L225 Difference]: With dead ends: 65 [2019-11-19 21:12:38,913 INFO L226 Difference]: Without dead ends: 56 [2019-11-19 21:12:38,914 INFO L630 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 [2019-11-19 21:12:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-19 21:12:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-11-19 21:12:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-19 21:12:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-19 21:12:38,920 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-11-19 21:12:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:38,921 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-19 21:12:38,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:12:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-19 21:12:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 21:12:38,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:38,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:39,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-19 21:12:39,130 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:39,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:39,131 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-11-19 21:12:39,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:39,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994683602] [2019-11-19 21:12:39,132 INFO L94 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 [2019-11-19 21:12:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:39,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 21:12:39,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:39,277 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:39,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994683602] [2019-11-19 21:12:39,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:39,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 21:12:39,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044522760] [2019-11-19 21:12:39,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:12:39,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:39,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:12:39,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:12:39,331 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2019-11-19 21:12:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:39,355 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-19 21:12:39,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:12:39,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-19 21:12:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:39,359 INFO L225 Difference]: With dead ends: 40 [2019-11-19 21:12:39,359 INFO L226 Difference]: Without dead ends: 30 [2019-11-19 21:12:39,361 INFO L630 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 [2019-11-19 21:12:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-19 21:12:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-19 21:12:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-19 21:12:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-19 21:12:39,370 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-11-19 21:12:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:39,371 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-19 21:12:39,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:12:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-19 21:12:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 21:12:39,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:39,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:39,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-19 21:12:39,573 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:39,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:39,574 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-11-19 21:12:39,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:39,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916380476] [2019-11-19 21:12:39,576 INFO L94 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 [2019-11-19 21:12:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:39,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 21:12:39,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:39,734 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:39,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:39,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916380476] [2019-11-19 21:12:39,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:39,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-19 21:12:39,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29542725] [2019-11-19 21:12:39,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 21:12:39,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:39,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 21:12:39,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:12:39,793 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2019-11-19 21:12:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:39,950 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-11-19 21:12:39,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:12:39,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-19 21:12:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:39,952 INFO L225 Difference]: With dead ends: 42 [2019-11-19 21:12:39,952 INFO L226 Difference]: Without dead ends: 39 [2019-11-19 21:12:39,953 INFO L630 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 [2019-11-19 21:12:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-19 21:12:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-11-19 21:12:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 21:12:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-19 21:12:39,960 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2019-11-19 21:12:39,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:39,961 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-19 21:12:39,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 21:12:39,961 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-19 21:12:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 21:12:39,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:39,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:40,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-19 21:12:40,183 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:40,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:40,183 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-11-19 21:12:40,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:40,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382957596] [2019-11-19 21:12:40,184 INFO L94 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 [2019-11-19 21:12:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:40,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 21:12:40,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:40,372 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:40,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382957596] [2019-11-19 21:12:40,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:40,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-19 21:12:40,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696785153] [2019-11-19 21:12:40,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 21:12:40,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:40,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 21:12:40,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:12:40,467 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2019-11-19 21:12:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:40,610 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-11-19 21:12:40,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:12:40,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-19 21:12:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:40,615 INFO L225 Difference]: With dead ends: 45 [2019-11-19 21:12:40,616 INFO L226 Difference]: Without dead ends: 27 [2019-11-19 21:12:40,616 INFO L630 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 [2019-11-19 21:12:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-19 21:12:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-19 21:12:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 21:12:40,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-19 21:12:40,622 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-11-19 21:12:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:40,622 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-19 21:12:40,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 21:12:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-19 21:12:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:12:40,623 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:40,623 INFO L410 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] [2019-11-19 21:12:40,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-19 21:12:40,837 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:40,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-11-19 21:12:40,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:40,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136314863] [2019-11-19 21:12:40,840 INFO L94 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 [2019-11-19 21:12:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:40,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-19 21:12:40,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:41,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:41,086 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:41,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:41,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136314863] [2019-11-19 21:12:41,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:41,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-19 21:12:41,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436089748] [2019-11-19 21:12:41,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 21:12:41,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:41,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 21:12:41,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-19 21:12:41,345 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-11-19 21:12:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:41,681 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-19 21:12:41,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:12:41,682 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-19 21:12:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:41,683 INFO L225 Difference]: With dead ends: 27 [2019-11-19 21:12:41,683 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:12:41,684 INFO L630 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 [2019-11-19 21:12:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:12:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:12:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:12:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:12:41,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-19 21:12:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:41,685 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:12:41,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 21:12:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:12:41,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:12:41,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-19 21:12:41,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:12:42,272 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-19 21:12:42,272 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 53) no Hoare annotation was computed. [2019-11-19 21:12:42,272 INFO L440 ceAbstractionStarter]: At program point L69(lines 60 70) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (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)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short11| (exists ((v_skolemized_v_prenex_5_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_5_3)) (= (_ +zero 11 53) (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))))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-19 21:12:42,272 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2019-11-19 21:12:42,273 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 36 47) no Hoare annotation was computed. [2019-11-19 21:12:42,273 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:12:42,273 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:12:42,273 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 55) no Hoare annotation was computed. [2019-11-19 21:12:42,273 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2019-11-19 21:12:42,273 INFO L440 ceAbstractionStarter]: At program point L63-2(lines 63 67) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (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)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-19 21:12:42,274 INFO L444 ceAbstractionStarter]: For program point L63-3(lines 63 67) no Hoare annotation was computed. [2019-11-19 21:12:42,274 INFO L440 ceAbstractionStarter]: At program point L47(lines 23 48) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.neg (_ +zero 11 53))))) (= ULTIMATE.start_fmax_double_~x .cse0) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-11-19 21:12:42,274 INFO L440 ceAbstractionStarter]: At program point L47-1(lines 23 48) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (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)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-19 21:12:42,274 INFO L444 ceAbstractionStarter]: For program point L39(lines 39 47) no Hoare annotation was computed. [2019-11-19 21:12:42,274 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 39 47) no Hoare annotation was computed. [2019-11-19 21:12:42,275 INFO L447 ceAbstractionStarter]: At program point L89(lines 72 90) the Hoare annotation is: true [2019-11-19 21:12:42,275 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:12:42,275 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-19 21:12:42,275 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2019-11-19 21:12:42,278 INFO L444 ceAbstractionStarter]: For program point L57-2(line 57) no Hoare annotation was computed. [2019-11-19 21:12:42,278 INFO L440 ceAbstractionStarter]: At program point L57-3(lines 50 58) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (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)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-19 21:12:42,278 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:12:42,279 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 26 31) no Hoare annotation was computed. [2019-11-19 21:12:42,279 INFO L440 ceAbstractionStarter]: At program point L26-2(lines 26 31) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmax_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-11-19 21:12:42,279 INFO L444 ceAbstractionStarter]: For program point L26-3(lines 23 48) no Hoare annotation was computed. [2019-11-19 21:12:42,279 INFO L444 ceAbstractionStarter]: For program point L26-5(lines 26 31) no Hoare annotation was computed. [2019-11-19 21:12:42,279 INFO L440 ceAbstractionStarter]: At program point L26-6(lines 26 31) the Hoare annotation is: (and (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-19 21:12:42,280 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-19 21:12:42,280 INFO L444 ceAbstractionStarter]: For program point L26-7(lines 23 48) no Hoare annotation was computed. [2019-11-19 21:12:42,280 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 84 87) no Hoare annotation was computed. [2019-11-19 21:12:42,280 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-11-19 21:12:42,281 INFO L444 ceAbstractionStarter]: For program point L43-1(lines 43 47) no Hoare annotation was computed. [2019-11-19 21:12:42,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:12:42 BoogieIcfgContainer [2019-11-19 21:12:42,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:12:42,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:12:42,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:12:42,379 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:12:42,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:37" (3/4) ... [2019-11-19 21:12:42,386 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:12:42,405 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-19 21:12:42,406 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-19 21:12:42,406 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 21:12:42,437 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: v_skolemized_v_prenex_2_3[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-19 21:12:42,437 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~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() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() [2019-11-19 21:12:42,440 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~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() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() [2019-11-19 21:12:42,440 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~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() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && \result == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~Pluszero~LONGDOUBLE() == ~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]))) && x == ~Pluszero~LONGDOUBLE() [2019-11-19 21:12:42,441 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~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() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() [2019-11-19 21:12:42,489 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:12:42,489 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:12:42,493 INFO L168 Benchmark]: Toolchain (without parser) took 6578.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -232.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:12:42,493 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:12:42,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:42,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:12:42,494 INFO L168 Benchmark]: Boogie Preprocessor took 39.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:12:42,499 INFO L168 Benchmark]: RCFGBuilder took 542.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:42,500 INFO L168 Benchmark]: TraceAbstraction took 5366.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.4 MB). Peak memory consumption was 289.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:42,500 INFO L168 Benchmark]: Witness Printer took 110.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:42,506 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 441.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 542.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5366.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.4 MB). Peak memory consumption was 289.2 MB. Max. memory is 11.5 GB. * Witness Printer took 110.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 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_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_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_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] - 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: 85]: 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: 23]: Loop Invariant [2019-11-19 21:12:42,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-19 21:12:42,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: v_skolemized_v_prenex_2_3[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 60]: Loop Invariant [2019-11-19 21:12:42,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:12:42,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] Derived loop invariant: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~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() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && \result == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~Pluszero~LONGDOUBLE() == ~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]))) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 50]: Loop Invariant [2019-11-19 21:12:42,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~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() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 63]: Loop Invariant [2019-11-19 21:12:42,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~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() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 23]: Loop Invariant [2019-11-19 21:12:42,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:12:42,528 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~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() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 5.2s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 252 SDtfs, 332 SDslu, 546 SDs, 0 SdLazy, 173 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 206 HoareAnnotationTreeSize, 8 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 29 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 18200 SizeOfPredicates, 38 NumberOfNonLiveVariables, 465 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, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...