./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1231.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/float_req_bl_1231.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 65a8838494b0fa2a560742eb829642f08a5d8cc8 ...................................................................................................................................................................................................................................................................................................................................................................... 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/float_req_bl_1231.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 65a8838494b0fa2a560742eb829642f08a5d8cc8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 16:55:11,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:55:11,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:55:11,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:55:11,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:55:11,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:55:11,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:55:11,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:55:11,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:55:11,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:55:11,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:55:11,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:55:11,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:55:11,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:55:11,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:55:11,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:55:11,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:55:11,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:55:11,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:55:11,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:55:11,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:55:11,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:55:11,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:55:11,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:55:11,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:55:11,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:55:11,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:55:11,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:55:11,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:55:11,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:55:11,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:55:11,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:55:11,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:55:11,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:55:11,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:55:11,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:55:11,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:55:11,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:55:11,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:55:11,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:55:11,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:55:11,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:55:11,618 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:55:11,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:55:11,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:55:11,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:55:11,621 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:55:11,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:55:11,621 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:55:11,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:55:11,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:55:11,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:55:11,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:55:11,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:55:11,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:55:11,623 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:55:11,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:55:11,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:55:11,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:55:11,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:55:11,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:55:11,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:55:11,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:55:11,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:55:11,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:55:11,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:55:11,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:55:11,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:55:11,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:55:11,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:55:11,628 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:55:11,628 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 -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2019-11-28 16:55:11,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:55:11,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:55:11,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:55:11,979 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:55:11,981 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:55:11,982 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-28 16:55:12,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20ac8043b/7afe2b5d0ffa4ba79c10df70922db639/FLAGaa9b0e8f8 [2019-11-28 16:55:12,547 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:55:12,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-28 16:55:12,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20ac8043b/7afe2b5d0ffa4ba79c10df70922db639/FLAGaa9b0e8f8 [2019-11-28 16:55:12,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20ac8043b/7afe2b5d0ffa4ba79c10df70922db639 [2019-11-28 16:55:12,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:55:12,917 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:55:12,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:55:12,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:55:12,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:55:12,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:55:12" (1/1) ... [2019-11-28 16:55:12,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a288275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:12, skipping insertion in model container [2019-11-28 16:55:12,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:55:12" (1/1) ... [2019-11-28 16:55:12,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:55:12,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:55:13,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:55:13,264 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:55:13,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:55:13,409 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:55:13,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:13 WrapperNode [2019-11-28 16:55:13,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:55:13,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:55:13,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:55:13,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:55:13,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:13" (1/1) ... [2019-11-28 16:55:13,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:13" (1/1) ... [2019-11-28 16:55:13,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:55:13,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:55:13,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:55:13,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:55:13,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:13" (1/1) ... [2019-11-28 16:55:13,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:13" (1/1) ... [2019-11-28 16:55:13,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:13" (1/1) ... [2019-11-28 16:55:13,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:13" (1/1) ... [2019-11-28 16:55:13,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:13" (1/1) ... [2019-11-28 16:55:13,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:13" (1/1) ... [2019-11-28 16:55:13,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:13" (1/1) ... [2019-11-28 16:55:13,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:55:13,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:55:13,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:55:13,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:55:13,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:13" (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-28 16:55:13,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:55:13,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-28 16:55:13,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:55:13,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:55:13,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:55:13,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:55:14,046 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:55:14,046 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-28 16:55:14,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:55:14 BoogieIcfgContainer [2019-11-28 16:55:14,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:55:14,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:55:14,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:55:14,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:55:14,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:55:12" (1/3) ... [2019-11-28 16:55:14,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6ecb88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:55:14, skipping insertion in model container [2019-11-28 16:55:14,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:13" (2/3) ... [2019-11-28 16:55:14,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6ecb88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:55:14, skipping insertion in model container [2019-11-28 16:55:14,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:55:14" (3/3) ... [2019-11-28 16:55:14,057 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-11-28 16:55:14,066 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:55:14,073 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 16:55:14,086 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-28 16:55:14,108 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:55:14,108 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:55:14,109 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:55:14,109 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:55:14,110 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:55:14,111 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:55:14,111 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:55:14,111 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:55:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-28 16:55:14,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 16:55:14,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:14,134 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:55:14,134 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:14,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-28 16:55:14,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:55:14,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009439165] [2019-11-28 16:55:14,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:55:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:14,315 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-28 16:55:14,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009439165] [2019-11-28 16:55:14,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:14,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:55:14,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720958910] [2019-11-28 16:55:14,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:55:14,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:55:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:55:14,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:55:14,337 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-11-28 16:55:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:14,438 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-11-28 16:55:14,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:55:14,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 16:55:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:14,452 INFO L225 Difference]: With dead ends: 90 [2019-11-28 16:55:14,453 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 16:55:14,456 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-28 16:55:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 16:55:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-28 16:55:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 16:55:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-28 16:55:14,498 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-11-28 16:55:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:14,499 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-28 16:55:14,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:55:14,499 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-28 16:55:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:55:14,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:14,500 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-28 16:55:14,501 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:14,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:14,501 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-28 16:55:14,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:55:14,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745525572] [2019-11-28 16:55:14,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:55:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:14,592 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-28 16:55:14,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745525572] [2019-11-28 16:55:14,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:14,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:55:14,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755360351] [2019-11-28 16:55:14,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:55:14,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:55:14,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:55:14,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:55:14,603 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-11-28 16:55:14,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:14,687 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-11-28 16:55:14,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:55:14,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 16:55:14,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:14,690 INFO L225 Difference]: With dead ends: 77 [2019-11-28 16:55:14,690 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 16:55:14,692 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-28 16:55:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 16:55:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-11-28 16:55:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 16:55:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-28 16:55:14,701 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-28 16:55:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:14,702 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-28 16:55:14,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:55:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-28 16:55:14,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 16:55:14,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:14,704 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] [2019-11-28 16:55:14,704 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:14,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-28 16:55:14,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:55:14,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516824410] [2019-11-28 16:55:14,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:55:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:14,795 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-28 16:55:14,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516824410] [2019-11-28 16:55:14,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:14,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:55:14,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386273374] [2019-11-28 16:55:14,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:55:14,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:55:14,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:55:14,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:55:14,797 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-11-28 16:55:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:14,815 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-11-28 16:55:14,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:55:14,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 16:55:14,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:14,817 INFO L225 Difference]: With dead ends: 50 [2019-11-28 16:55:14,817 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 16:55:14,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:55:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 16:55:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-28 16:55:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 16:55:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-11-28 16:55:14,825 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-11-28 16:55:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:14,825 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-11-28 16:55:14,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:55:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-11-28 16:55:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 16:55:14,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:14,829 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-28 16:55:14,829 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:14,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:14,829 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-28 16:55:14,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:55:14,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509437844] [2019-11-28 16:55:14,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:55:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:55:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:55:14,960 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:55:14,960 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:55:14,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:55:14 BoogieIcfgContainer [2019-11-28 16:55:14,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:55:14,998 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:55:14,998 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:55:14,999 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:55:15,000 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:55:14" (3/4) ... [2019-11-28 16:55:15,004 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 16:55:15,004 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:55:15,007 INFO L168 Benchmark]: Toolchain (without parser) took 2088.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -75.6 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:55:15,008 INFO L168 Benchmark]: CDTParser took 0.96 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-28 16:55:15,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 491.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 16:55:15,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.45 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-28 16:55:15,010 INFO L168 Benchmark]: Boogie Preprocessor took 30.39 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-28 16:55:15,011 INFO L168 Benchmark]: RCFGBuilder took 540.01 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.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2019-11-28 16:55:15,012 INFO L168 Benchmark]: TraceAbstraction took 948.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2019-11-28 16:55:15,012 INFO L168 Benchmark]: Witness Printer took 5.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:55:15,017 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.96 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 491.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.45 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 30.39 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 540.01 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.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 948.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.75 ms. Allocated memory is still 1.2 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: 75]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 74. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L57] return x != x; [L68] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L68] EXPR isnan_float(x) && !isnan_float(y) [L68-L69] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L68-L69] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L13] __uint32_t w; [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; [L71] float res = fmin_float(x, y); [L57] return x != x; [L74] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L74] EXPR isnan_float(x) && !isnan_float(y) [L74] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L75] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: UNSAFE, OverallTime: 0.8s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 189 SDtfs, 37 SDslu, 269 SDs, 0 SdLazy, 42 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=3, 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, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 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.25-f470102 [2019-11-28 16:55:17,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:55:17,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:55:17,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:55:17,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:55:17,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:55:17,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:55:17,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:55:17,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:55:17,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:55:17,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:55:17,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:55:17,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:55:17,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:55:17,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:55:17,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:55:17,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:55:17,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:55:17,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:55:17,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:55:17,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:55:17,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:55:17,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:55:17,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:55:17,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:55:17,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:55:17,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:55:17,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:55:17,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:55:17,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:55:17,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:55:17,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:55:17,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:55:17,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:55:17,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:55:17,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:55:17,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:55:17,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:55:17,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:55:17,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:55:17,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:55:17,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-28 16:55:17,182 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:55:17,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:55:17,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:55:17,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:55:17,185 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:55:17,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:55:17,186 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:55:17,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:55:17,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:55:17,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:55:17,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:55:17,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:55:17,188 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 16:55:17,189 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 16:55:17,189 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:55:17,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:55:17,189 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:55:17,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:55:17,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:55:17,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:55:17,190 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:55:17,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:55:17,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:55:17,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:55:17,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:55:17,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:55:17,192 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 16:55:17,192 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 16:55:17,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:55:17,192 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:55:17,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 16:55:17,193 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 -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2019-11-28 16:55:17,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:55:17,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:55:17,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:55:17,541 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:55:17,542 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:55:17,542 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-28 16:55:17,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64feae554/13fb42bbecdc4bd5927773b5506f2bd6/FLAG653dfb4ef [2019-11-28 16:55:18,051 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:55:18,052 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-28 16:55:18,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64feae554/13fb42bbecdc4bd5927773b5506f2bd6/FLAG653dfb4ef [2019-11-28 16:55:18,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64feae554/13fb42bbecdc4bd5927773b5506f2bd6 [2019-11-28 16:55:18,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:55:18,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:55:18,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:55:18,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:55:18,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:55:18,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:55:18" (1/1) ... [2019-11-28 16:55:18,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cff6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18, skipping insertion in model container [2019-11-28 16:55:18,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:55:18" (1/1) ... [2019-11-28 16:55:18,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:55:18,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:55:18,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:55:18,734 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:55:18,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:55:18,862 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:55:18,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18 WrapperNode [2019-11-28 16:55:18,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:55:18,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:55:18,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:55:18,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:55:18,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18" (1/1) ... [2019-11-28 16:55:18,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18" (1/1) ... [2019-11-28 16:55:18,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:55:18,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:55:18,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:55:18,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:55:18,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18" (1/1) ... [2019-11-28 16:55:18,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18" (1/1) ... [2019-11-28 16:55:18,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18" (1/1) ... [2019-11-28 16:55:18,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18" (1/1) ... [2019-11-28 16:55:18,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18" (1/1) ... [2019-11-28 16:55:18,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18" (1/1) ... [2019-11-28 16:55:18,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18" (1/1) ... [2019-11-28 16:55:18,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:55:18,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:55:18,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:55:18,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:55:18,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18" (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-28 16:55:19,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:55:19,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 16:55:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:55:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:55:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-28 16:55:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:55:19,517 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:55:19,518 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-28 16:55:19,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:55:19 BoogieIcfgContainer [2019-11-28 16:55:19,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:55:19,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:55:19,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:55:19,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:55:19,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:55:18" (1/3) ... [2019-11-28 16:55:19,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e205ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:55:19, skipping insertion in model container [2019-11-28 16:55:19,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:55:18" (2/3) ... [2019-11-28 16:55:19,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e205ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:55:19, skipping insertion in model container [2019-11-28 16:55:19,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:55:19" (3/3) ... [2019-11-28 16:55:19,529 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-11-28 16:55:19,540 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:55:19,549 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 16:55:19,561 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-28 16:55:19,583 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:55:19,584 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:55:19,584 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:55:19,584 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:55:19,584 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:55:19,584 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:55:19,585 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:55:19,585 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:55:19,598 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-28 16:55:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 16:55:19,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:19,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:55:19,607 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:19,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-28 16:55:19,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:19,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272581752] [2019-11-28 16:55:19,628 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-28 16:55:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:19,728 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-28 16:55:19,734 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:19,748 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-28 16:55:19,749 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:19,755 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-28 16:55:19,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272581752] [2019-11-28 16:55:19,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:19,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 16:55:19,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626807907] [2019-11-28 16:55:19,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:55:19,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:19,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:55:19,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:55:19,778 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-28 16:55:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:19,802 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-11-28 16:55:19,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:55:19,803 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 16:55:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:19,815 INFO L225 Difference]: With dead ends: 82 [2019-11-28 16:55:19,815 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 16:55:19,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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-28 16:55:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 16:55:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 16:55:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 16:55:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-28 16:55:19,864 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-11-28 16:55:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:19,865 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-28 16:55:19,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:55:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-11-28 16:55:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 16:55:19,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:19,866 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:55:20,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 16:55:20,082 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:20,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:20,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-11-28 16:55:20,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:20,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767581154] [2019-11-28 16:55:20,086 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-28 16:55:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:20,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 16:55:20,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:20,198 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-28 16:55:20,203 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:20,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:20,217 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-28 16:55:20,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767581154] [2019-11-28 16:55:20,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:20,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 16:55:20,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638869920] [2019-11-28 16:55:20,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:55:20,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:55:20,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:55:20,223 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-11-28 16:55:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:20,323 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-11-28 16:55:20,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:55:20,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 16:55:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:20,328 INFO L225 Difference]: With dead ends: 82 [2019-11-28 16:55:20,329 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 16:55:20,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-28 16:55:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 16:55:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-28 16:55:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 16:55:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-28 16:55:20,351 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-11-28 16:55:20,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:20,351 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-28 16:55:20,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:55:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-28 16:55:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:55:20,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:20,354 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-28 16:55:20,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 16:55:20,556 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:20,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:20,557 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-28 16:55:20,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:20,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561477153] [2019-11-28 16:55:20,559 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-28 16:55:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:20,634 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 16:55:20,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:20,665 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-28 16:55:20,667 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:20,692 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-28 16:55:20,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561477153] [2019-11-28 16:55:20,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:20,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 16:55:20,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535654398] [2019-11-28 16:55:20,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:55:20,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:55:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:55:20,695 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-11-28 16:55:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:20,820 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-11-28 16:55:20,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:55:20,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-28 16:55:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:20,822 INFO L225 Difference]: With dead ends: 96 [2019-11-28 16:55:20,822 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 16:55:20,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 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-28 16:55:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 16:55:20,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-11-28 16:55:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 16:55:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-28 16:55:20,831 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-28 16:55:20,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:20,832 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-28 16:55:20,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:55:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-28 16:55:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 16:55:20,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:20,833 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] [2019-11-28 16:55:21,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 16:55:21,049 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:21,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:21,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-28 16:55:21,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:21,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506867825] [2019-11-28 16:55:21,052 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-28 16:55:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:21,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 16:55:21,129 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:21,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:21,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:21,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:21,222 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-28 16:55:21,222 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:21,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:21,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:21,297 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-28 16:55:21,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506867825] [2019-11-28 16:55:21,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:21,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-28 16:55:21,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380236706] [2019-11-28 16:55:21,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:55:21,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:21,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:55:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:55:21,300 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-11-28 16:55:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:23,908 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2019-11-28 16:55:23,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 16:55:23,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-28 16:55:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:23,911 INFO L225 Difference]: With dead ends: 146 [2019-11-28 16:55:23,912 INFO L226 Difference]: Without dead ends: 137 [2019-11-28 16:55:23,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-28 16:55:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-28 16:55:23,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 75. [2019-11-28 16:55:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-28 16:55:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-28 16:55:23,928 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-11-28 16:55:23,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:23,928 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-28 16:55:23,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:55:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-28 16:55:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 16:55:23,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:23,930 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-28 16:55:24,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 16:55:24,145 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:24,146 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-28 16:55:24,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:24,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044816735] [2019-11-28 16:55:24,148 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-28 16:55:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:24,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 16:55:24,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:24,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:24,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:24,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:24,434 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-28 16:55:24,434 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:24,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:24,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:24,588 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-28 16:55:24,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044816735] [2019-11-28 16:55:24,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:24,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-28 16:55:24,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622520127] [2019-11-28 16:55:24,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 16:55:24,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:24,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 16:55:24,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-28 16:55:24,591 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-28 16:55:24,891 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-28 16:55:25,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:25,885 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-11-28 16:55:25,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 16:55:25,889 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-28 16:55:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:25,892 INFO L225 Difference]: With dead ends: 180 [2019-11-28 16:55:25,892 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 16:55:25,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-11-28 16:55:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 16:55:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-11-28 16:55:25,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 16:55:25,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-11-28 16:55:25,909 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-11-28 16:55:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:25,909 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-11-28 16:55:25,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 16:55:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-11-28 16:55:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 16:55:25,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:25,911 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, 1] [2019-11-28 16:55:26,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 16:55:26,123 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:26,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-11-28 16:55:26,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:26,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666211846] [2019-11-28 16:55:26,125 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-28 16:55:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:26,201 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 16:55:26,203 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:26,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:26,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:26,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:26,293 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-28 16:55:26,295 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:26,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:26,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:26,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:26,346 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-28 16:55:26,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666211846] [2019-11-28 16:55:26,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:26,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-28 16:55:26,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014291229] [2019-11-28 16:55:26,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 16:55:26,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:26,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 16:55:26,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:55:26,351 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-11-28 16:55:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:26,969 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-11-28 16:55:26,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 16:55:26,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-28 16:55:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:26,971 INFO L225 Difference]: With dead ends: 166 [2019-11-28 16:55:26,971 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 16:55:26,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-28 16:55:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 16:55:26,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-11-28 16:55:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 16:55:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-11-28 16:55:26,985 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-11-28 16:55:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:26,986 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-11-28 16:55:26,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 16:55:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-11-28 16:55:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 16:55:26,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:26,987 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, 1, 1] [2019-11-28 16:55:27,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 16:55:27,201 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:27,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:27,201 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-11-28 16:55:27,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:27,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024263631] [2019-11-28 16:55:27,202 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-28 16:55:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:27,266 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 16:55:27,268 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:27,286 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-28 16:55:27,287 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:27,302 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-28 16:55:27,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024263631] [2019-11-28 16:55:27,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:27,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 16:55:27,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536509059] [2019-11-28 16:55:27,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:55:27,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:27,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:55:27,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:55:27,306 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-11-28 16:55:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:27,403 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-11-28 16:55:27,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:55:27,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 16:55:27,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:27,404 INFO L225 Difference]: With dead ends: 157 [2019-11-28 16:55:27,405 INFO L226 Difference]: Without dead ends: 141 [2019-11-28 16:55:27,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 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-28 16:55:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-28 16:55:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-11-28 16:55:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 16:55:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-28 16:55:27,417 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-28 16:55:27,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:27,417 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-28 16:55:27,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:55:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-28 16:55:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 16:55:27,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:27,419 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, 1, 1] [2019-11-28 16:55:27,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 16:55:27,632 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:27,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-11-28 16:55:27,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:27,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360025744] [2019-11-28 16:55:27,633 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-28 16:55:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:27,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 16:55:27,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:27,720 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-28 16:55:27,720 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:27,722 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-28 16:55:27,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360025744] [2019-11-28 16:55:27,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:27,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 16:55:27,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107628738] [2019-11-28 16:55:27,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:55:27,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:27,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:55:27,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:55:27,724 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-11-28 16:55:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:27,762 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-11-28 16:55:27,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:55:27,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 16:55:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:27,764 INFO L225 Difference]: With dead ends: 96 [2019-11-28 16:55:27,764 INFO L226 Difference]: Without dead ends: 94 [2019-11-28 16:55:27,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:55:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-28 16:55:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-11-28 16:55:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-28 16:55:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-28 16:55:27,777 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-28 16:55:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:27,777 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-28 16:55:27,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:55:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-28 16:55:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 16:55:27,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:27,779 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, 1, 1, 1] [2019-11-28 16:55:27,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 16:55:27,993 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:27,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:27,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-11-28 16:55:27,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:27,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535722341] [2019-11-28 16:55:27,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-28 16:55:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:28,053 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 16:55:28,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:28,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:28,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:28,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:28,129 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-28 16:55:28,129 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:28,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:28,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:28,193 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-28 16:55:28,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535722341] [2019-11-28 16:55:28,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:28,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-28 16:55:28,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492907151] [2019-11-28 16:55:28,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:55:28,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:55:28,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:55:28,195 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-11-28 16:55:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:28,546 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-11-28 16:55:28,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:55:28,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-28 16:55:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:28,549 INFO L225 Difference]: With dead ends: 131 [2019-11-28 16:55:28,549 INFO L226 Difference]: Without dead ends: 118 [2019-11-28 16:55:28,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-28 16:55:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-28 16:55:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-11-28 16:55:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 16:55:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-11-28 16:55:28,558 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-11-28 16:55:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:28,559 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-11-28 16:55:28,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:55:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-11-28 16:55:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 16:55:28,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:28,560 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, 1, 1, 1] [2019-11-28 16:55:28,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 16:55:28,773 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:28,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:28,774 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-11-28 16:55:28,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:28,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714266808] [2019-11-28 16:55:28,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-28 16:55:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:28,835 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 16:55:28,839 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:28,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:28,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:28,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:28,913 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-28 16:55:28,913 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:28,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:28,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:28,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:28,976 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-28 16:55:28,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714266808] [2019-11-28 16:55:28,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:28,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-28 16:55:28,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325697033] [2019-11-28 16:55:28,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 16:55:28,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:28,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 16:55:28,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-28 16:55:28,978 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-11-28 16:55:29,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:29,396 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-11-28 16:55:29,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 16:55:29,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-28 16:55:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:29,398 INFO L225 Difference]: With dead ends: 114 [2019-11-28 16:55:29,398 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 16:55:29,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-11-28 16:55:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 16:55:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-28 16:55:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 16:55:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-28 16:55:29,406 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-11-28 16:55:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:29,406 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-28 16:55:29,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 16:55:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-28 16:55:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 16:55:29,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:29,407 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, 1, 1, 1] [2019-11-28 16:55:29,612 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 16:55:29,618 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:29,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:29,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-11-28 16:55:29,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:29,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52929447] [2019-11-28 16:55:29,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-28 16:55:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:29,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 16:55:29,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:29,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:29,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:29,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:29,746 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-28 16:55:29,747 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:29,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:29,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:29,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:29,788 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-28 16:55:29,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52929447] [2019-11-28 16:55:29,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:29,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-28 16:55:29,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150742082] [2019-11-28 16:55:29,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 16:55:29,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:29,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 16:55:29,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:55:29,790 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-11-28 16:55:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:30,090 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-11-28 16:55:30,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 16:55:30,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-28 16:55:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:30,093 INFO L225 Difference]: With dead ends: 84 [2019-11-28 16:55:30,093 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 16:55:30,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-28 16:55:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 16:55:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 16:55:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 16:55:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-28 16:55:30,101 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-11-28 16:55:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:30,102 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-28 16:55:30,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 16:55:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-28 16:55:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 16:55:30,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:30,103 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, 1, 1, 1, 1] [2019-11-28 16:55:30,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-28 16:55:30,316 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:30,317 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-11-28 16:55:30,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:30,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796037871] [2019-11-28 16:55:30,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-28 16:55:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:30,384 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 16:55:30,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:30,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:30,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:30,449 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-28 16:55:30,449 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:30,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:30,770 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-28 16:55:30,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796037871] [2019-11-28 16:55:30,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:30,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-28 16:55:30,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121281618] [2019-11-28 16:55:30,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:55:30,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:30,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:55:30,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:55:30,773 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-11-28 16:55:31,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:31,110 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-11-28 16:55:31,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 16:55:31,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-28 16:55:31,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:31,112 INFO L225 Difference]: With dead ends: 82 [2019-11-28 16:55:31,112 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 16:55:31,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 16:55:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 16:55:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 16:55:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 16:55:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-11-28 16:55:31,124 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-11-28 16:55:31,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:31,124 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-11-28 16:55:31,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:55:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-11-28 16:55:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 16:55:31,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:31,126 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, 1, 1, 1, 1] [2019-11-28 16:55:31,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-28 16:55:31,332 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:31,333 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-11-28 16:55:31,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:31,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951445551] [2019-11-28 16:55:31,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-28 16:55:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:31,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 16:55:31,406 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:31,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:31,589 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-28 16:55:31,589 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:31,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:31,826 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-28 16:55:31,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951445551] [2019-11-28 16:55:31,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:31,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-28 16:55:31,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717860093] [2019-11-28 16:55:31,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 16:55:31,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:31,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 16:55:31,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:55:31,829 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-11-28 16:55:33,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:33,193 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-11-28 16:55:33,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 16:55:33,194 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-28 16:55:33,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:33,195 INFO L225 Difference]: With dead ends: 154 [2019-11-28 16:55:33,195 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 16:55:33,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-11-28 16:55:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 16:55:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2019-11-28 16:55:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 16:55:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-11-28 16:55:33,205 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2019-11-28 16:55:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:33,205 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-11-28 16:55:33,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 16:55:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-11-28 16:55:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 16:55:33,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:33,206 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, 1, 1, 1, 1, 1] [2019-11-28 16:55:33,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-28 16:55:33,420 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:33,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:33,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-11-28 16:55:33,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:33,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092452340] [2019-11-28 16:55:33,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-28 16:55:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:33,484 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 16:55:33,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:33,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:33,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:33,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:33,840 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-28 16:55:33,847 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-28 16:55:33,847 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:33,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:34,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:34,036 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-28 16:55:34,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092452340] [2019-11-28 16:55:34,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:34,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-11-28 16:55:34,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539208289] [2019-11-28 16:55:34,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 16:55:34,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:34,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 16:55:34,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-28 16:55:34,039 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2019-11-28 16:55:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:36,334 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2019-11-28 16:55:36,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-28 16:55:36,336 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-28 16:55:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:36,337 INFO L225 Difference]: With dead ends: 195 [2019-11-28 16:55:36,338 INFO L226 Difference]: Without dead ends: 158 [2019-11-28 16:55:36,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 16:55:36,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-28 16:55:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2019-11-28 16:55:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 16:55:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-11-28 16:55:36,345 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-11-28 16:55:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:36,345 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-28 16:55:36,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 16:55:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-11-28 16:55:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 16:55:36,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:36,346 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, 1, 1, 1, 1, 1, 1] [2019-11-28 16:55:36,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-28 16:55:36,546 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:36,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-11-28 16:55:36,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:36,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422001673] [2019-11-28 16:55:36,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-28 16:55:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:36,609 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 16:55:36,610 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:36,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:36,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:36,848 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-28 16:55:36,848 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:36,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:36,997 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-28 16:55:36,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422001673] [2019-11-28 16:55:36,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:36,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-11-28 16:55:36,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557455023] [2019-11-28 16:55:36,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 16:55:36,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:36,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 16:55:36,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-28 16:55:36,999 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-11-28 16:55:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:38,059 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-11-28 16:55:38,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 16:55:38,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-28 16:55:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:38,061 INFO L225 Difference]: With dead ends: 125 [2019-11-28 16:55:38,062 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 16:55:38,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-11-28 16:55:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 16:55:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2019-11-28 16:55:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 16:55:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-11-28 16:55:38,069 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2019-11-28 16:55:38,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:38,069 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-28 16:55:38,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 16:55:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-11-28 16:55:38,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 16:55:38,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:38,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:55:38,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-28 16:55:38,284 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:38,284 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-11-28 16:55:38,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:38,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809504585] [2019-11-28 16:55:38,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-28 16:55:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:38,369 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 16:55:38,370 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:38,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:38,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:38,433 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-28 16:55:38,433 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:38,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:38,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:38,649 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-28 16:55:38,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809504585] [2019-11-28 16:55:38,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:38,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-28 16:55:38,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115376249] [2019-11-28 16:55:38,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:55:38,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:55:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:55:38,651 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-11-28 16:55:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:39,246 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-28 16:55:39,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 16:55:39,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-28 16:55:39,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:39,247 INFO L225 Difference]: With dead ends: 52 [2019-11-28 16:55:39,247 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 16:55:39,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-28 16:55:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 16:55:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 16:55:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 16:55:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-28 16:55:39,256 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-11-28 16:55:39,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:39,256 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-28 16:55:39,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:55:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-11-28 16:55:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 16:55:39,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:39,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:55:39,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-28 16:55:39,458 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:39,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:39,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-11-28 16:55:39,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:39,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609797592] [2019-11-28 16:55:39,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-28 16:55:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:39,550 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 16:55:39,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:39,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:39,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:39,645 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-28 16:55:39,645 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:39,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:39,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:39,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:39,791 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-28 16:55:39,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609797592] [2019-11-28 16:55:39,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:39,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-28 16:55:39,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706432731] [2019-11-28 16:55:39,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 16:55:39,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:39,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 16:55:39,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-28 16:55:39,793 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-11-28 16:55:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:40,586 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-28 16:55:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 16:55:40,587 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-28 16:55:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:40,587 INFO L225 Difference]: With dead ends: 55 [2019-11-28 16:55:40,588 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 16:55:40,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-11-28 16:55:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 16:55:40,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-28 16:55:40,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 16:55:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 16:55:40,594 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-11-28 16:55:40,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:40,594 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 16:55:40,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 16:55:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 16:55:40,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 16:55:40,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:40,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:55:40,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-28 16:55:40,800 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-11-28 16:55:40,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:40,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804066106] [2019-11-28 16:55:40,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-28 16:55:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:40,894 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 16:55:40,895 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:40,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:41,000 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-28 16:55:41,000 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:41,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:55:41,135 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-28 16:55:41,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804066106] [2019-11-28 16:55:41,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:41,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-28 16:55:41,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522180989] [2019-11-28 16:55:41,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 16:55:41,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:41,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 16:55:41,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 16:55:41,138 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-11-28 16:55:41,454 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-28 16:55:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:41,873 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-28 16:55:41,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 16:55:41,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-28 16:55:41,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:41,875 INFO L225 Difference]: With dead ends: 79 [2019-11-28 16:55:41,875 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 16:55:41,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-28 16:55:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 16:55:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-11-28 16:55:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 16:55:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-28 16:55:41,882 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-11-28 16:55:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:41,883 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-28 16:55:41,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 16:55:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-28 16:55:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 16:55:41,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:55:41,884 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:55:42,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-28 16:55:42,087 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:55:42,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:55:42,088 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-11-28 16:55:42,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:55:42,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605146925] [2019-11-28 16:55:42,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 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-28 16:55:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:55:42,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 16:55:42,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:55:42,173 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-28 16:55:42,173 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:55:42,175 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-28 16:55:42,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605146925] [2019-11-28 16:55:42,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:55:42,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 16:55:42,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056463901] [2019-11-28 16:55:42,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:55:42,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:55:42,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:55:42,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:55:42,177 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-11-28 16:55:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:55:42,215 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-28 16:55:42,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:55:42,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-28 16:55:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:55:42,215 INFO L225 Difference]: With dead ends: 39 [2019-11-28 16:55:42,215 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 16:55:42,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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-28 16:55:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 16:55:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 16:55:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 16:55:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 16:55:42,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-28 16:55:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:55:42,217 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 16:55:42,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:55:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 16:55:42,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 16:55:42,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-28 16:55:42,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 16:55:42,649 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 87 [2019-11-28 16:55:42,781 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 135 [2019-11-28 16:55:43,591 WARN L192 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-11-28 16:55:44,831 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 135 DAG size of output: 27 [2019-11-28 16:55:45,393 WARN L192 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-11-28 16:55:45,676 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2019-11-28 16:55:45,968 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-11-28 16:55:46,278 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-11-28 16:55:46,843 WARN L192 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2019-11-28 16:55:47,572 WARN L192 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 34 [2019-11-28 16:55:47,820 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-11-28 16:55:47,863 INFO L246 CegarLoopResult]: For program point L68-3(lines 68 69) no Hoare annotation was computed. [2019-11-28 16:55:47,863 INFO L246 CegarLoopResult]: For program point L68-5(lines 68 84) no Hoare annotation was computed. [2019-11-28 16:55:47,863 INFO L246 CegarLoopResult]: For program point L68-7(lines 68 84) no Hoare annotation was computed. [2019-11-28 16:55:47,863 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2019-11-28 16:55:47,863 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-28 16:55:47,864 INFO L246 CegarLoopResult]: For program point L36(lines 36 37) no Hoare annotation was computed. [2019-11-28 16:55:47,864 INFO L246 CegarLoopResult]: For program point L69-2(line 69) no Hoare annotation was computed. [2019-11-28 16:55:47,864 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 16:55:47,864 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 16:55:47,864 INFO L249 CegarLoopResult]: At program point L86(lines 59 87) the Hoare annotation is: true [2019-11-28 16:55:47,864 INFO L246 CegarLoopResult]: For program point L29(lines 29 32) no Hoare annotation was computed. [2019-11-28 16:55:47,865 INFO L246 CegarLoopResult]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2019-11-28 16:55:47,865 INFO L246 CegarLoopResult]: For program point L38(lines 38 39) no Hoare annotation was computed. [2019-11-28 16:55:47,865 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-28 16:55:47,865 INFO L246 CegarLoopResult]: For program point L80-2(lines 80 83) no Hoare annotation was computed. [2019-11-28 16:55:47,865 INFO L246 CegarLoopResult]: For program point L23(lines 23 32) no Hoare annotation was computed. [2019-11-28 16:55:47,865 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2019-11-28 16:55:47,865 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-28 16:55:47,865 INFO L246 CegarLoopResult]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2019-11-28 16:55:47,865 INFO L242 CegarLoopResult]: At program point L15-2(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (not .cse1) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)) (and .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-28 16:55:47,865 INFO L246 CegarLoopResult]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2019-11-28 16:55:47,866 INFO L246 CegarLoopResult]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2019-11-28 16:55:47,866 INFO L242 CegarLoopResult]: At program point L15-6(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse1) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-28 16:55:47,867 INFO L246 CegarLoopResult]: For program point L15-7(lines 12 33) no Hoare annotation was computed. [2019-11-28 16:55:47,867 INFO L242 CegarLoopResult]: At program point L32(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= ULTIMATE.start_fmin_float_~x (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) .cse1 (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (not .cse2) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)) (and .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 (not .cse1) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-28 16:55:47,867 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 16:55:47,867 INFO L242 CegarLoopResult]: At program point L32-1(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse2 (= ULTIMATE.start_fmin_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (.cse3 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (or (and .cse0 .cse1 .cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse3 (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and .cse0 .cse1 .cse2 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (not .cse3) (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2019-11-28 16:55:47,867 INFO L242 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) [2019-11-28 16:55:47,867 INFO L242 CegarLoopResult]: At program point L57-1(line 57) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short11| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-11-28 16:55:47,867 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2019-11-28 16:55:47,867 INFO L242 CegarLoopResult]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse1 (not |ULTIMATE.start_main_#t~short15|)) (.cse2 (not |ULTIMATE.start_main_#t~short11|)) (.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 .cse1 .cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse1 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) .cse2 (not .cse0)))) [2019-11-28 16:55:47,868 INFO L242 CegarLoopResult]: At program point L57-3(line 57) the Hoare annotation is: (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short15|) (not |ULTIMATE.start_main_#t~short11|) (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) |ULTIMATE.start_main_#t~short14|) [2019-11-28 16:55:47,868 INFO L242 CegarLoopResult]: At program point L57-4(line 57) the Hoare annotation is: (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse3 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y .cse1) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 .cse3 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse1 .cse1))) (and .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse2 .cse3 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)))) [2019-11-28 16:55:47,868 INFO L242 CegarLoopResult]: At program point L57-5(line 57) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))) (or (and .cse0 |ULTIMATE.start_main_#t~short19| (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse2) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) |ULTIMATE.start_main_#t~short19| (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 .cse2 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)))) [2019-11-28 16:55:47,868 INFO L242 CegarLoopResult]: At program point L57-6(line 57) the Hoare annotation is: (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))))) [2019-11-28 16:55:47,868 INFO L242 CegarLoopResult]: At program point L57-7(line 57) the Hoare annotation is: (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0)))) [2019-11-28 16:55:47,868 INFO L246 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-28 16:55:47,868 INFO L246 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2019-11-28 16:55:47,869 INFO L246 CegarLoopResult]: For program point L74-2(lines 74 77) no Hoare annotation was computed. [2019-11-28 16:55:47,869 INFO L246 CegarLoopResult]: For program point L41-2(line 41) no Hoare annotation was computed. [2019-11-28 16:55:47,869 INFO L242 CegarLoopResult]: At program point L41-3(lines 35 42) the Hoare annotation is: (let ((.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (or (and .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~y .cse2) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2))))) [2019-11-28 16:55:47,869 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 16:55:47,870 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-28 16:55:47,870 INFO L246 CegarLoopResult]: For program point L26(lines 26 32) no Hoare annotation was computed. [2019-11-28 16:55:47,870 INFO L246 CegarLoopResult]: For program point L26-1(lines 26 32) no Hoare annotation was computed. [2019-11-28 16:55:47,870 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-28 16:55:47,870 INFO L246 CegarLoopResult]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-11-28 16:55:47,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:55:47 BoogieIcfgContainer [2019-11-28 16:55:47,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:55:47,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:55:47,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:55:47,903 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:55:47,903 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:55:19" (3/4) ... [2019-11-28 16:55:47,907 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 16:55:47,923 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-11-28 16:55:47,924 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-28 16:55:47,924 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 16:55:47,959 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-11-28 16:55:47,960 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) [2019-11-28 16:55:47,960 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((1bv32 == \result && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !~fp.eq~FLOAT(y, y)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) [2019-11-28 16:55:47,961 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux [2019-11-28 16:55:47,961 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-28 16:55:47,961 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((y == y && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-28 16:55:47,962 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y))) || ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-11-28 16:55:47,962 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-28 16:55:47,962 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((y == y && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])))) || (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) [2019-11-28 16:55:47,963 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2019-11-28 16:55:47,963 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == y && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) || ((((((((y == y && y == x) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, y)) [2019-11-28 16:55:47,964 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-11-28 16:55:47,964 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2019-11-28 16:55:47,999 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:55:47,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:55:48,001 INFO L168 Benchmark]: Toolchain (without parser) took 29557.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 154.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:55:48,001 INFO L168 Benchmark]: CDTParser took 0.27 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-28 16:55:48,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 16:55:48,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.16 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-28 16:55:48,002 INFO L168 Benchmark]: Boogie Preprocessor took 38.93 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-28 16:55:48,003 INFO L168 Benchmark]: RCFGBuilder took 564.29 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: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:55:48,003 INFO L168 Benchmark]: TraceAbstraction took 28381.16 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 213.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.5 MB). Peak memory consumption was 442.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:55:48,003 INFO L168 Benchmark]: Witness Printer took 96.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:55:48,005 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.27 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 417.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.16 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 38.93 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 564.29 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: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28381.16 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 213.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.5 MB). Peak memory consumption was 442.5 MB. Max. memory is 11.5 GB. * Witness Printer took 96.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 81]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 75]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y))) || ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((y == y && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((y == y && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) || ((((((((y == y && y == x) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, y)) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((y == y && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])))) || (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((y == y && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((1bv32 == \result && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !~fp.eq~FLOAT(y, y)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((y == y && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: SAFE, OverallTime: 22.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, HoareTripleCheckerStatistics: 1147 SDtfs, 2730 SDslu, 4439 SDs, 0 SdLazy, 1925 SolverSat, 267 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 575 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 605 HoareAnnotationTreeSize, 14 FomulaSimplifications, 572522 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 14 FomulaSimplificationsInter, 62940 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 93581 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1413 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...