./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/float_req_bl_1231_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/float-newlib/float_req_bl_1231_true-unreach-call.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: 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 /storage/repos/svcomp/c/float-newlib/float_req_bl_1231_true-unreach-call.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.24-0ed9222-m [2019-01-12 09:16:34,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:16:34,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:16:34,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:16:34,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:16:34,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:16:34,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:16:34,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:16:34,141 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:16:34,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:16:34,143 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:16:34,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:16:34,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:16:34,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:16:34,147 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:16:34,148 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:16:34,149 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:16:34,151 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:16:34,153 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:16:34,155 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:16:34,156 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:16:34,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:16:34,164 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:16:34,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:16:34,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:16:34,170 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:16:34,171 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:16:34,172 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:16:34,173 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:16:34,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:16:34,177 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:16:34,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:16:34,180 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:16:34,180 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:16:34,182 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:16:34,182 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:16:34,183 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:16:34,217 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:16:34,218 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:16:34,219 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:16:34,219 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:16:34,219 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:16:34,220 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:16:34,220 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:16:34,220 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:16:34,220 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:16:34,220 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:16:34,220 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:16:34,221 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:16:34,221 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:16:34,221 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:16:34,221 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:16:34,221 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:16:34,222 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:16:34,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:16:34,222 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:16:34,222 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:16:34,222 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:16:34,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:16:34,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:16:34,223 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:16:34,223 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:16:34,223 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:16:34,223 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:16:34,224 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:16:34,224 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-01-12 09:16:34,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:16:34,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:16:34,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:16:34,281 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:16:34,282 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:16:34,282 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2019-01-12 09:16:34,349 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f696667c6/62541a0ed8e44583922a88b6485d7f19/FLAGd2acdc671 [2019-01-12 09:16:34,774 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:16:34,775 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2019-01-12 09:16:34,783 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f696667c6/62541a0ed8e44583922a88b6485d7f19/FLAGd2acdc671 [2019-01-12 09:16:35,124 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f696667c6/62541a0ed8e44583922a88b6485d7f19 [2019-01-12 09:16:35,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:16:35,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:16:35,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:35,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:16:35,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:16:35,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:35" (1/1) ... [2019-01-12 09:16:35,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f9cd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35, skipping insertion in model container [2019-01-12 09:16:35,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:35" (1/1) ... [2019-01-12 09:16:35,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:16:35,173 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:16:35,373 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:35,383 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:16:35,444 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:35,482 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:16:35,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35 WrapperNode [2019-01-12 09:16:35,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:35,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:35,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:16:35,484 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:16:35,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35" (1/1) ... [2019-01-12 09:16:35,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35" (1/1) ... [2019-01-12 09:16:35,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:35,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:16:35,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:16:35,659 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:16:35,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35" (1/1) ... [2019-01-12 09:16:35,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35" (1/1) ... [2019-01-12 09:16:35,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35" (1/1) ... [2019-01-12 09:16:35,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35" (1/1) ... [2019-01-12 09:16:35,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35" (1/1) ... [2019-01-12 09:16:35,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35" (1/1) ... [2019-01-12 09:16:35,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35" (1/1) ... [2019-01-12 09:16:35,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:16:35,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:16:35,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:16:35,705 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:16:35,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35" (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-01-12 09:16:35,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:16:35,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:16:35,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:16:35,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:16:35,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:16:35,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:16:36,443 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:16:36,443 INFO L286 CfgBuilder]: Removed 30 assue(true) statements. [2019-01-12 09:16:36,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:36 BoogieIcfgContainer [2019-01-12 09:16:36,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:16:36,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:16:36,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:16:36,449 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:16:36,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:16:35" (1/3) ... [2019-01-12 09:16:36,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afbb93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:36, skipping insertion in model container [2019-01-12 09:16:36,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:35" (2/3) ... [2019-01-12 09:16:36,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afbb93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:36, skipping insertion in model container [2019-01-12 09:16:36,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:36" (3/3) ... [2019-01-12 09:16:36,453 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231_true-unreach-call.c [2019-01-12 09:16:36,463 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:16:36,472 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 09:16:36,490 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 09:16:36,519 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:16:36,519 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:16:36,520 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:16:36,520 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:16:36,521 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:16:36,521 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:16:36,521 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:16:36,521 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:16:36,522 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:16:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-01-12 09:16:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:16:36,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:36,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:36,548 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:36,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:36,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-01-12 09:16:36,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:36,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:36,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:36,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:36,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:36,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:36,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:36,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:36,728 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-01-12 09:16:36,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:36,905 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-01-12 09:16:36,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:16:36,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-01-12 09:16:36,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:36,919 INFO L225 Difference]: With dead ends: 90 [2019-01-12 09:16:36,919 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 09:16:36,923 INFO L631 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-01-12 09:16:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 09:16:36,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-01-12 09:16:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 09:16:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-01-12 09:16:36,965 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-01-12 09:16:36,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:36,965 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-01-12 09:16:36,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-01-12 09:16:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:16:36,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:36,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:36,967 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:36,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:36,968 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-01-12 09:16:36,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:36,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:36,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:36,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:36,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:37,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:37,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:37,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:37,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:37,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:37,091 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-01-12 09:16:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:37,366 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-01-12 09:16:37,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:37,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-12 09:16:37,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:37,369 INFO L225 Difference]: With dead ends: 77 [2019-01-12 09:16:37,370 INFO L226 Difference]: Without dead ends: 64 [2019-01-12 09:16:37,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:37,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-12 09:16:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-01-12 09:16:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 09:16:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-01-12 09:16:37,380 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-01-12 09:16:37,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:37,380 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-01-12 09:16:37,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-01-12 09:16:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:16:37,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:37,382 INFO L402 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-01-12 09:16:37,382 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:37,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-01-12 09:16:37,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:37,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:37,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:37,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:37,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:37,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:16:37,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:16:37,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:16:37,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:16:37,464 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-01-12 09:16:37,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:37,532 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-01-12 09:16:37,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:16:37,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-12 09:16:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:37,535 INFO L225 Difference]: With dead ends: 50 [2019-01-12 09:16:37,535 INFO L226 Difference]: Without dead ends: 48 [2019-01-12 09:16:37,536 INFO L631 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-01-12 09:16:37,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-12 09:16:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-12 09:16:37,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-12 09:16:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-01-12 09:16:37,544 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-01-12 09:16:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:37,544 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-01-12 09:16:37,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:16:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-01-12 09:16:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:16:37,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:37,546 INFO L402 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-01-12 09:16:37,546 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-01-12 09:16:37,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:37,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:37,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:16:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:16:37,648 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:16:37,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:16:37 BoogieIcfgContainer [2019-01-12 09:16:37,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:16:37,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:16:37,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:16:37,694 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:16:37,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:36" (3/4) ... [2019-01-12 09:16:37,699 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:16:37,699 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:16:37,700 INFO L168 Benchmark]: Toolchain (without parser) took 2568.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -92.0 MB). Peak memory consumption was 42.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:37,702 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:16:37,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.32 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:37,704 INFO L168 Benchmark]: Boogie Procedure Inliner took 174.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:37,705 INFO L168 Benchmark]: Boogie Preprocessor took 46.12 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:37,706 INFO L168 Benchmark]: RCFGBuilder took 739.94 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:37,707 INFO L168 Benchmark]: TraceAbstraction took 1247.40 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:37,708 INFO L168 Benchmark]: Witness Printer took 5.90 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-01-12 09:16:37,715 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.32 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 174.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.12 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 739.94 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1247.40 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.90 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. UNSAFE Result, 1.1s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 189 SDtfs, 37 SDslu, 269 SDs, 0 SdLazy, 42 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:16:40,037 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:16:40,039 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:16:40,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:16:40,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:16:40,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:16:40,058 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:16:40,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:16:40,062 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:16:40,063 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:16:40,064 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:16:40,064 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:16:40,073 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:16:40,074 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:16:40,075 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:16:40,076 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:16:40,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:16:40,079 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:16:40,082 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:16:40,083 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:16:40,084 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:16:40,086 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:16:40,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:16:40,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:16:40,091 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:16:40,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:16:40,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:16:40,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:16:40,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:16:40,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:16:40,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:16:40,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:16:40,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:16:40,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:16:40,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:16:40,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:16:40,101 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:16:40,115 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:16:40,119 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:16:40,120 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:16:40,120 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:16:40,120 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:16:40,121 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:16:40,121 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:16:40,121 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:16:40,121 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:16:40,121 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:16:40,122 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:16:40,122 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:16:40,122 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:16:40,122 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:16:40,122 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:16:40,122 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:16:40,123 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:16:40,124 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:16:40,124 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:16:40,124 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:16:40,125 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:16:40,125 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:16:40,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:16:40,125 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:16:40,125 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:16:40,126 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:16:40,126 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:16:40,126 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:16:40,126 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:16:40,127 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:16:40,127 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-01-12 09:16:40,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:16:40,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:16:40,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:16:40,207 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:16:40,208 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:16:40,209 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2019-01-12 09:16:40,266 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1428f050b/c4fae495d3054aa9b64529478ba97f63/FLAG33f69c4cb [2019-01-12 09:16:40,736 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:16:40,736 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2019-01-12 09:16:40,744 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1428f050b/c4fae495d3054aa9b64529478ba97f63/FLAG33f69c4cb [2019-01-12 09:16:41,116 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1428f050b/c4fae495d3054aa9b64529478ba97f63 [2019-01-12 09:16:41,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:16:41,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:16:41,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:41,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:16:41,127 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:16:41,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:41" (1/1) ... [2019-01-12 09:16:41,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43fcd915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41, skipping insertion in model container [2019-01-12 09:16:41,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:41" (1/1) ... [2019-01-12 09:16:41,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:16:41,164 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:16:41,435 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:41,444 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:16:41,489 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:41,523 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:16:41,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41 WrapperNode [2019-01-12 09:16:41,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:41,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:41,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:16:41,525 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:16:41,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41" (1/1) ... [2019-01-12 09:16:41,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41" (1/1) ... [2019-01-12 09:16:41,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:41,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:16:41,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:16:41,575 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:16:41,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41" (1/1) ... [2019-01-12 09:16:41,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41" (1/1) ... [2019-01-12 09:16:41,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41" (1/1) ... [2019-01-12 09:16:41,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41" (1/1) ... [2019-01-12 09:16:41,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41" (1/1) ... [2019-01-12 09:16:41,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41" (1/1) ... [2019-01-12 09:16:41,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41" (1/1) ... [2019-01-12 09:16:41,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:16:41,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:16:41,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:16:41,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:16:41,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41" (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-01-12 09:16:41,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:16:41,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:16:41,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:16:41,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:16:41,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-01-12 09:16:41,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:16:42,237 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:42,315 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:42,432 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:16:42,433 INFO L286 CfgBuilder]: Removed 30 assue(true) statements. [2019-01-12 09:16:42,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:42 BoogieIcfgContainer [2019-01-12 09:16:42,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:16:42,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:16:42,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:16:42,439 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:16:42,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:16:41" (1/3) ... [2019-01-12 09:16:42,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101f9805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:42, skipping insertion in model container [2019-01-12 09:16:42,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:41" (2/3) ... [2019-01-12 09:16:42,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101f9805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:42, skipping insertion in model container [2019-01-12 09:16:42,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:42" (3/3) ... [2019-01-12 09:16:42,444 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231_true-unreach-call.c [2019-01-12 09:16:42,454 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:16:42,463 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 09:16:42,481 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 09:16:42,513 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:16:42,514 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:16:42,514 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:16:42,515 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:16:42,515 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:16:42,515 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:16:42,515 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:16:42,515 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:16:42,516 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:16:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-01-12 09:16:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:16:42,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:42,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:42,543 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:42,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:42,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-01-12 09:16:42,555 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:42,556 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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) [2019-01-12 09:16:42,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:42,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:42,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:42,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:42,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:16:42,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:16:42,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:16:42,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:42,691 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-01-12 09:16:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:42,710 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-01-12 09:16:42,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:16:42,712 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 09:16:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:42,725 INFO L225 Difference]: With dead ends: 82 [2019-01-12 09:16:42,725 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 09:16:42,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-01-12 09:16:42,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 09:16:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-12 09:16:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-12 09:16:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-01-12 09:16:42,763 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-01-12 09:16:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:42,764 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-01-12 09:16:42,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:16:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-01-12 09:16:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:16:42,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:42,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:42,766 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:42,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-01-12 09:16:42,768 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:42,768 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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) [2019-01-12 09:16:42,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:42,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:42,895 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:42,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:42,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:42,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:42,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:42,911 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-01-12 09:16:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:43,250 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-01-12 09:16:43,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:16:43,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-12 09:16:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:43,253 INFO L225 Difference]: With dead ends: 82 [2019-01-12 09:16:43,253 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 09:16:43,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-01-12 09:16:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 09:16:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-01-12 09:16:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 09:16:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-01-12 09:16:43,263 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-01-12 09:16:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:43,264 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-01-12 09:16:43,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-01-12 09:16:43,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:16:43,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:43,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:43,266 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:43,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:43,266 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-01-12 09:16:43,267 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:43,267 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:43,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:43,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:43,396 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:43,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:43,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:43,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:43,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:43,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:43,412 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-01-12 09:16:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:43,526 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-01-12 09:16:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:43,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-12 09:16:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:43,529 INFO L225 Difference]: With dead ends: 77 [2019-01-12 09:16:43,529 INFO L226 Difference]: Without dead ends: 64 [2019-01-12 09:16:43,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-01-12 09:16:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-12 09:16:43,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-01-12 09:16:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 09:16:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-01-12 09:16:43,538 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-01-12 09:16:43,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:43,538 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-01-12 09:16:43,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-01-12 09:16:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:16:43,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:43,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:43,541 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:43,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:43,541 INFO L82 PathProgramCache]: Analyzing trace with hash -674173253, now seen corresponding path program 1 times [2019-01-12 09:16:43,542 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:43,542 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:43,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:43,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:43,683 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:43,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:43,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:43,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:43,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:43,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:43,695 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2019-01-12 09:16:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:43,842 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2019-01-12 09:16:43,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:43,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-12 09:16:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:43,845 INFO L225 Difference]: With dead ends: 79 [2019-01-12 09:16:43,845 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 09:16:43,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 09:16:43,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2019-01-12 09:16:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 09:16:43,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-01-12 09:16:43,855 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2019-01-12 09:16:43,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:43,855 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-01-12 09:16:43,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:43,856 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-01-12 09:16:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:16:43,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:43,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:43,859 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:43,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:43,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1345927737, now seen corresponding path program 1 times [2019-01-12 09:16:43,859 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:43,859 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:43,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:43,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:43,956 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:43,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:43,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:43,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:43,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:43,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:43,968 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2019-01-12 09:16:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:44,062 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2019-01-12 09:16:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:44,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-12 09:16:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:44,071 INFO L225 Difference]: With dead ends: 79 [2019-01-12 09:16:44,071 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 09:16:44,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-01-12 09:16:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 09:16:44,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2019-01-12 09:16:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 09:16:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-01-12 09:16:44,079 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 20 [2019-01-12 09:16:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:44,080 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-01-12 09:16:44,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-01-12 09:16:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:16:44,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:44,082 INFO L402 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-01-12 09:16:44,083 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:44,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-01-12 09:16:44,083 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:44,084 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:44,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:44,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:44,376 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:16:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:44,549 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:44,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:44,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:16:44,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:16:44,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:16:44,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:16:44,563 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 7 states. [2019-01-12 09:16:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:45,577 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2019-01-12 09:16:45,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 09:16:45,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 09:16:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:45,580 INFO L225 Difference]: With dead ends: 149 [2019-01-12 09:16:45,580 INFO L226 Difference]: Without dead ends: 140 [2019-01-12 09:16:45,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:16:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-12 09:16:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2019-01-12 09:16:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-12 09:16:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-01-12 09:16:45,595 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-01-12 09:16:45,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:45,596 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-01-12 09:16:45,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:16:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-01-12 09:16:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:16:45,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:45,599 INFO L402 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-01-12 09:16:45,599 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-01-12 09:16:45,600 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:45,601 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:45,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:45,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:46,016 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:46,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:46,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 09:16:46,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 09:16:46,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 09:16:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:16:46,033 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 9 states. [2019-01-12 09:16:46,886 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2019-01-12 09:16:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:47,093 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-01-12 09:16:47,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 09:16:47,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-01-12 09:16:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:47,103 INFO L225 Difference]: With dead ends: 180 [2019-01-12 09:16:47,106 INFO L226 Difference]: Without dead ends: 178 [2019-01-12 09:16:47,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-01-12 09:16:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-12 09:16:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-01-12 09:16:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-12 09:16:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-01-12 09:16:47,132 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-01-12 09:16:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:47,134 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-01-12 09:16:47,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 09:16:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-01-12 09:16:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 09:16:47,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:47,135 INFO L402 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-01-12 09:16:47,135 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:47,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:47,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-01-12 09:16:47,138 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:47,138 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:47,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:47,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:47,273 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:47,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:47,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:16:47,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:16:47,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:16:47,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:16:47,284 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 7 states. [2019-01-12 09:16:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:48,104 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-01-12 09:16:48,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 09:16:48,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-12 09:16:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:48,106 INFO L225 Difference]: With dead ends: 166 [2019-01-12 09:16:48,106 INFO L226 Difference]: Without dead ends: 131 [2019-01-12 09:16:48,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:16:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-12 09:16:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-01-12 09:16:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-12 09:16:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-01-12 09:16:48,121 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-01-12 09:16:48,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:48,123 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-01-12 09:16:48,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:16:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-01-12 09:16:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:16:48,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:48,125 INFO L402 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-01-12 09:16:48,125 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:48,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:48,125 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-01-12 09:16:48,126 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:48,126 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:48,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:48,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:48,201 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:48,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:48,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:48,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:48,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:48,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:48,213 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 4 states. [2019-01-12 09:16:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:48,373 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2019-01-12 09:16:48,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:48,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-01-12 09:16:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:48,376 INFO L225 Difference]: With dead ends: 133 [2019-01-12 09:16:48,377 INFO L226 Difference]: Without dead ends: 117 [2019-01-12 09:16:48,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-01-12 09:16:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-12 09:16:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2019-01-12 09:16:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-12 09:16:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-01-12 09:16:48,402 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-01-12 09:16:48,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:48,402 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-12 09:16:48,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-01-12 09:16:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:16:48,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:48,408 INFO L402 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-01-12 09:16:48,409 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:48,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:48,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-01-12 09:16:48,409 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:48,409 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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) [2019-01-12 09:16:48,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:48,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:48,526 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:48,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:48,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:16:48,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:16:48,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:16:48,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:16:48,538 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-01-12 09:16:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:48,657 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-01-12 09:16:48,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:16:48,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 09:16:48,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:48,659 INFO L225 Difference]: With dead ends: 96 [2019-01-12 09:16:48,659 INFO L226 Difference]: Without dead ends: 94 [2019-01-12 09:16:48,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-01-12 09:16:48,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-12 09:16:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-01-12 09:16:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-12 09:16:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-01-12 09:16:48,675 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-01-12 09:16:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:48,675 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-12 09:16:48,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:16:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-01-12 09:16:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 09:16:48,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:48,678 INFO L402 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-01-12 09:16:48,678 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:48,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1838896133, now seen corresponding path program 1 times [2019-01-12 09:16:48,679 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:48,679 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:48,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:48,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:48,763 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:48,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:48,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:48,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:48,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:48,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:48,779 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 4 states. [2019-01-12 09:16:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:49,015 INFO L93 Difference]: Finished difference Result 139 states and 176 transitions. [2019-01-12 09:16:49,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:49,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-01-12 09:16:49,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:49,019 INFO L225 Difference]: With dead ends: 139 [2019-01-12 09:16:49,019 INFO L226 Difference]: Without dead ends: 122 [2019-01-12 09:16:49,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-01-12 09:16:49,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-12 09:16:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2019-01-12 09:16:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-12 09:16:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-01-12 09:16:49,039 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 25 [2019-01-12 09:16:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:49,039 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-01-12 09:16:49,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-01-12 09:16:49,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 09:16:49,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:49,042 INFO L402 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-01-12 09:16:49,043 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:49,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:49,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-01-12 09:16:49,043 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:49,044 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:49,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:49,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:49,340 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:16:49,620 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 09:16:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:50,016 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:50,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:50,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:16:50,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:16:50,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:16:50,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:16:50,048 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 7 states. [2019-01-12 09:16:50,623 WARN L181 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 09:16:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:51,578 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-01-12 09:16:51,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:16:51,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-12 09:16:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:51,581 INFO L225 Difference]: With dead ends: 131 [2019-01-12 09:16:51,581 INFO L226 Difference]: Without dead ends: 118 [2019-01-12 09:16:51,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:16:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-12 09:16:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-01-12 09:16:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-12 09:16:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-01-12 09:16:51,595 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-01-12 09:16:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:51,597 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-01-12 09:16:51,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:16:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-01-12 09:16:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 09:16:51,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:51,598 INFO L402 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-01-12 09:16:51,598 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:51,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:51,598 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-01-12 09:16:51,601 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:51,601 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:51,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:51,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:51,794 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:51,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:51,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:16:51,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:16:51,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:16:51,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:16:51,807 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 8 states. [2019-01-12 09:16:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:52,441 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-01-12 09:16:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 09:16:52,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-01-12 09:16:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:52,444 INFO L225 Difference]: With dead ends: 114 [2019-01-12 09:16:52,444 INFO L226 Difference]: Without dead ends: 78 [2019-01-12 09:16:52,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-01-12 09:16:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-12 09:16:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-01-12 09:16:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-12 09:16:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-01-12 09:16:52,456 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-01-12 09:16:52,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:52,456 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-01-12 09:16:52,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:16:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-01-12 09:16:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 09:16:52,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:52,457 INFO L402 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-01-12 09:16:52,457 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:52,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:52,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-01-12 09:16:52,458 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:52,458 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:52,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:52,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:52,576 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:52,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:52,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:16:52,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:16:52,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:16:52,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:16:52,602 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 7 states. [2019-01-12 09:16:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:53,127 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-01-12 09:16:53,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:16:53,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-12 09:16:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:53,129 INFO L225 Difference]: With dead ends: 84 [2019-01-12 09:16:53,129 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 09:16:53,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:16:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 09:16:53,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-12 09:16:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 09:16:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-01-12 09:16:53,141 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-01-12 09:16:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:53,141 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-01-12 09:16:53,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:16:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-01-12 09:16:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:16:53,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:53,144 INFO L402 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-01-12 09:16:53,145 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:53,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:53,146 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-01-12 09:16:53,146 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:53,146 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:53,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:53,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:53,385 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:53,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:53,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:16:53,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:16:53,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:16:53,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:16:53,396 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 6 states. [2019-01-12 09:16:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:53,850 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-01-12 09:16:53,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 09:16:53,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-12 09:16:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:53,852 INFO L225 Difference]: With dead ends: 82 [2019-01-12 09:16:53,852 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 09:16:53,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:16:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 09:16:53,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-12 09:16:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 09:16:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-01-12 09:16:53,863 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-01-12 09:16:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:53,863 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-01-12 09:16:53,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:16:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-01-12 09:16:53,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:16:53,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:53,866 INFO L402 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-01-12 09:16:53,867 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:53,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:53,867 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-01-12 09:16:53,867 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:53,867 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:53,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:53,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:54,111 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 09:16:54,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-01-12 09:16:54,193 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:54,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:54,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 09:16:54,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 09:16:54,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 09:16:54,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:16:54,205 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 9 states. [2019-01-12 09:16:54,971 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-01-12 09:16:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:55,697 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2019-01-12 09:16:55,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 09:16:55,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-01-12 09:16:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:55,703 INFO L225 Difference]: With dead ends: 120 [2019-01-12 09:16:55,703 INFO L226 Difference]: Without dead ends: 109 [2019-01-12 09:16:55,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-01-12 09:16:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-12 09:16:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 74. [2019-01-12 09:16:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 09:16:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2019-01-12 09:16:55,719 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 26 [2019-01-12 09:16:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:55,719 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2019-01-12 09:16:55,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 09:16:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2019-01-12 09:16:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:16:55,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:55,720 INFO L402 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-01-12 09:16:55,720 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:55,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1994202826, now seen corresponding path program 1 times [2019-01-12 09:16:55,723 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:55,723 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:55,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:55,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:55,800 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:55,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:55,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:55,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:55,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:55,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:55,812 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand 4 states. [2019-01-12 09:16:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:55,932 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2019-01-12 09:16:55,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:55,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-01-12 09:16:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:55,934 INFO L225 Difference]: With dead ends: 120 [2019-01-12 09:16:55,934 INFO L226 Difference]: Without dead ends: 103 [2019-01-12 09:16:55,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-01-12 09:16:55,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-12 09:16:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-01-12 09:16:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 09:16:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2019-01-12 09:16:55,952 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 26 [2019-01-12 09:16:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:55,952 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2019-01-12 09:16:55,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2019-01-12 09:16:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:16:55,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:55,955 INFO L402 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-01-12 09:16:55,955 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash 548357897, now seen corresponding path program 1 times [2019-01-12 09:16:55,956 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:55,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:56,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:56,216 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:56,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:56,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:16:56,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:16:56,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:16:56,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:16:56,238 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand 10 states. [2019-01-12 09:16:56,870 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2019-01-12 09:16:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:57,342 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2019-01-12 09:16:57,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 09:16:57,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-01-12 09:16:57,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:57,344 INFO L225 Difference]: With dead ends: 81 [2019-01-12 09:16:57,344 INFO L226 Difference]: Without dead ends: 70 [2019-01-12 09:16:57,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-01-12 09:16:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-12 09:16:57,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-12 09:16:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-12 09:16:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2019-01-12 09:16:57,358 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 27 [2019-01-12 09:16:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:57,358 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2019-01-12 09:16:57,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:16:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2019-01-12 09:16:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:16:57,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:57,359 INFO L402 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-01-12 09:16:57,359 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:57,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2066405290, now seen corresponding path program 1 times [2019-01-12 09:16:57,359 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:57,360 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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-01-12 09:16:57,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:57,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:57,445 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:57,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:57,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:57,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:57,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:57,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:57,457 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand 4 states. [2019-01-12 09:16:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:57,597 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2019-01-12 09:16:57,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:57,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-01-12 09:16:57,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:57,599 INFO L225 Difference]: With dead ends: 107 [2019-01-12 09:16:57,599 INFO L226 Difference]: Without dead ends: 88 [2019-01-12 09:16:57,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-01-12 09:16:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-12 09:16:57,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2019-01-12 09:16:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-12 09:16:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2019-01-12 09:16:57,612 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 27 [2019-01-12 09:16:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:57,612 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2019-01-12 09:16:57,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2019-01-12 09:16:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:16:57,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:57,613 INFO L402 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-01-12 09:16:57,613 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:57,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-01-12 09:16:57,614 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:57,614 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:57,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:57,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:58,050 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:58,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:58,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 09:16:58,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 09:16:58,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 09:16:58,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:16:58,061 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 12 states. [2019-01-12 09:16:58,952 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-01-12 09:16:59,384 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-01-12 09:16:59,654 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-01-12 09:17:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:00,863 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2019-01-12 09:17:00,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-12 09:17:00,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-01-12 09:17:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:00,866 INFO L225 Difference]: With dead ends: 193 [2019-01-12 09:17:00,866 INFO L226 Difference]: Without dead ends: 158 [2019-01-12 09:17:00,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=341, Invalid=1065, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 09:17:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-12 09:17:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2019-01-12 09:17:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-12 09:17:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-01-12 09:17:00,881 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-01-12 09:17:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:00,881 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-01-12 09:17:00,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 09:17:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-01-12 09:17:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 09:17:00,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:00,885 INFO L402 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-01-12 09:17:00,885 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:00,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:00,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-01-12 09:17:00,887 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:00,887 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:00,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:00,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:01,204 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:01,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:01,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:17:01,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:17:01,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:17:01,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:17:01,217 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 10 states. [2019-01-12 09:17:01,894 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-01-12 09:17:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:02,582 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2019-01-12 09:17:02,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 09:17:02,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-01-12 09:17:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:02,583 INFO L225 Difference]: With dead ends: 135 [2019-01-12 09:17:02,583 INFO L226 Difference]: Without dead ends: 111 [2019-01-12 09:17:02,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2019-01-12 09:17:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-12 09:17:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 43. [2019-01-12 09:17:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-12 09:17:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-01-12 09:17:02,597 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 28 [2019-01-12 09:17:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:02,597 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-01-12 09:17:02,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:17:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-01-12 09:17:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 09:17:02,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:02,598 INFO L402 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-01-12 09:17:02,598 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1106626442, now seen corresponding path program 1 times [2019-01-12 09:17:02,598 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:02,598 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:02,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:02,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:02,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-01-12 09:17:02,665 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:02,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:02,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:17:02,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:17:02,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:17:02,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:17:02,676 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 4 states. [2019-01-12 09:17:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:02,786 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-01-12 09:17:02,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:17:02,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-01-12 09:17:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:02,788 INFO L225 Difference]: With dead ends: 67 [2019-01-12 09:17:02,788 INFO L226 Difference]: Without dead ends: 57 [2019-01-12 09:17:02,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-01-12 09:17:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-12 09:17:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-01-12 09:17:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 09:17:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-01-12 09:17:02,801 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2019-01-12 09:17:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:02,802 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-01-12 09:17:02,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:17:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-01-12 09:17:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 09:17:02,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:02,802 INFO L402 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-01-12 09:17:02,803 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:02,803 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-01-12 09:17:02,803 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:02,803 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:02,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:02,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:02,982 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:02,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:02,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:17:02,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:17:02,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:17:02,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:17:02,994 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 6 states. [2019-01-12 09:17:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:03,624 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-01-12 09:17:03,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:17:03,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-01-12 09:17:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:03,626 INFO L225 Difference]: With dead ends: 52 [2019-01-12 09:17:03,626 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 09:17:03,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:17:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 09:17:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 09:17:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 09:17:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-01-12 09:17:03,640 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-01-12 09:17:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:03,640 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-01-12 09:17:03,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:17:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-01-12 09:17:03,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 09:17:03,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:03,641 INFO L402 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-01-12 09:17:03,641 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:03,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:03,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-01-12 09:17:03,642 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:03,642 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:03,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:03,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:03,911 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:03,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:03,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:17:03,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:17:03,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:17:03,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:17:03,923 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 8 states. [2019-01-12 09:17:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:04,485 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-01-12 09:17:04,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 09:17:04,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-01-12 09:17:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:04,486 INFO L225 Difference]: With dead ends: 53 [2019-01-12 09:17:04,486 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 09:17:04,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-01-12 09:17:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 09:17:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-12 09:17:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 09:17:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-12 09:17:04,495 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-01-12 09:17:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:04,496 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-12 09:17:04,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:17:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-12 09:17:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 09:17:04,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:04,496 INFO L402 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-01-12 09:17:04,497 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:04,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-01-12 09:17:04,497 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:04,497 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:04,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:04,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:04,691 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:04,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:04,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:17:04,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:17:04,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:17:04,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:17:04,702 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 7 states. [2019-01-12 09:17:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:05,333 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-01-12 09:17:05,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:17:05,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-01-12 09:17:05,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:05,335 INFO L225 Difference]: With dead ends: 71 [2019-01-12 09:17:05,335 INFO L226 Difference]: Without dead ends: 61 [2019-01-12 09:17:05,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:17:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-12 09:17:05,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2019-01-12 09:17:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-12 09:17:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-01-12 09:17:05,347 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 33 [2019-01-12 09:17:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:05,347 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-01-12 09:17:05,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:17:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-01-12 09:17:05,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 09:17:05,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:05,348 INFO L402 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] [2019-01-12 09:17:05,348 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:05,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:05,349 INFO L82 PathProgramCache]: Analyzing trace with hash -26785796, now seen corresponding path program 1 times [2019-01-12 09:17:05,353 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:05,353 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:05,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:05,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:05,540 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:05,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:05,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:17:05,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:17:05,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:17:05,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:17:05,551 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 8 states. [2019-01-12 09:17:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:06,056 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-01-12 09:17:06,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 09:17:06,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-01-12 09:17:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:06,059 INFO L225 Difference]: With dead ends: 59 [2019-01-12 09:17:06,059 INFO L226 Difference]: Without dead ends: 49 [2019-01-12 09:17:06,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-01-12 09:17:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-12 09:17:06,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2019-01-12 09:17:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 09:17:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-01-12 09:17:06,070 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2019-01-12 09:17:06,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:06,070 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-01-12 09:17:06,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:17:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-01-12 09:17:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 09:17:06,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:06,071 INFO L402 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-01-12 09:17:06,071 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:06,071 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-01-12 09:17:06,071 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:06,072 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:06,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:06,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:06,209 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:06,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:06,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:17:06,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:17:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:17:06,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:17:06,221 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-01-12 09:17:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:06,261 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-01-12 09:17:06,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:17:06,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-12 09:17:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:06,262 INFO L225 Difference]: With dead ends: 39 [2019-01-12 09:17:06,262 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:17:06,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-01-12 09:17:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:17:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:17:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:17:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:17:06,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-01-12 09:17:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:06,266 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:17:06,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:17:06,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:17:06,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:17:06,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:17:06,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:17:06,513 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 70 [2019-01-12 09:17:06,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:17:06,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:17:06,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:17:06,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:17:06,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:17:06,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:17:06,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:17:06,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:17:08,010 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-01-12 09:17:08,658 WARN L181 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 31 [2019-01-12 09:17:09,155 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2019-01-12 09:17:09,518 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 24 [2019-01-12 09:17:09,790 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 16 [2019-01-12 09:17:11,233 WARN L181 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-01-12 09:17:11,452 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-01-12 09:17:12,274 WARN L181 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2019-01-12 09:17:12,486 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-01-12 09:17:12,526 INFO L448 ceAbstractionStarter]: For program point L68-3(lines 68 69) no Hoare annotation was computed. [2019-01-12 09:17:12,526 INFO L448 ceAbstractionStarter]: For program point L68-5(lines 68 84) no Hoare annotation was computed. [2019-01-12 09:17:12,526 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 84) no Hoare annotation was computed. [2019-01-12 09:17:12,527 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-01-12 09:17:12,527 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 37) no Hoare annotation was computed. [2019-01-12 09:17:12,527 INFO L448 ceAbstractionStarter]: For program point L69-2(line 69) no Hoare annotation was computed. [2019-01-12 09:17:12,527 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:17:12,527 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:17:12,528 INFO L451 ceAbstractionStarter]: At program point L86(lines 59 87) the Hoare annotation is: true [2019-01-12 09:17:12,528 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 32) no Hoare annotation was computed. [2019-01-12 09:17:12,528 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2019-01-12 09:17:12,528 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 39) no Hoare annotation was computed. [2019-01-12 09:17:12,528 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-01-12 09:17:12,528 INFO L448 ceAbstractionStarter]: For program point L80-2(lines 80 83) no Hoare annotation was computed. [2019-01-12 09:17:12,528 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2019-01-12 09:17:12,528 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2019-01-12 09:17:12,528 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-01-12 09:17:12,528 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2019-01-12 09:17:12,529 INFO L444 ceAbstractionStarter]: At program point L15-2(lines 15 19) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse0 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (.cse2 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= ULTIMATE.start___fpclassify_float_~x ULTIMATE.start_fmin_float_~x) (not .cse0) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) .cse1 (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)) .cse2) (and (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 .cse0 (= |ULTIMATE.start_isnan_float_#res| (_ bv0 32)) (not .cse2)))) [2019-01-12 09:17:12,529 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2019-01-12 09:17:12,529 INFO L448 ceAbstractionStarter]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2019-01-12 09:17:12,529 INFO L444 ceAbstractionStarter]: At program point L15-6(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (.cse2 (= ULTIMATE.start___fpclassify_float_~x ULTIMATE.start_fmin_float_~y))) (or (and (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse0 (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)) .cse1 .cse2) (and (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse0 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y) (= |ULTIMATE.start_isnan_float_#res| (_ bv0 32)) (not .cse1) .cse2))) [2019-01-12 09:17:12,529 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2019-01-12 09:17:12,529 INFO L448 ceAbstractionStarter]: For program point L15-7(lines 12 33) no Hoare annotation was computed. [2019-01-12 09:17:12,530 INFO L444 ceAbstractionStarter]: At program point L32(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= ULTIMATE.start___fpclassify_float_~x ULTIMATE.start_fmin_float_~x) (or (and (and .cse0 (or (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967294 32)) (_ bv0 32)))) .cse1) (and (not (= (bvadd ULTIMATE.start___fpclassify_float_~w~0 (_ bv2147483648 32)) (_ bv0 32))) (and .cse0 .cse1) (or (not (bvule ULTIMATE.start___fpclassify_float_~w~0 (_ bv2155872255 32))) (not (bvuge ULTIMATE.start___fpclassify_float_~w~0 (_ bv2147483649 32)))) (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967295 32)) (_ bv0 32)) (or (not (bvuge ULTIMATE.start___fpclassify_float_~w~0 (_ bv2155872256 32))) (not (bvule ULTIMATE.start___fpclassify_float_~w~0 (_ bv4286578687 32)))) (not (bvule ULTIMATE.start___fpclassify_float_~w~0 (_ bv2139095039 32))))) (= (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)) ULTIMATE.start_fmin_float_~x) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32))) (and (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= |ULTIMATE.start_isnan_float_#res| (_ bv0 32)) (not .cse1)))) [2019-01-12 09:17:12,530 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:17:12,530 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 12 33) the Hoare annotation is: (let ((.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (.cse3 (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)))) (let ((.cse7 (or (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967294 32)) (_ bv0 32)))) (.cse5 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x))) (.cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse8 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (.cse9 (= |ULTIMATE.start_isnan_float_#res| (_ bv0 32))) (.cse2 (= .cse3 ULTIMATE.start_fmin_float_~y)) (.cse6 (not .cse1)) (.cse4 (= ULTIMATE.start___fpclassify_float_~x ULTIMATE.start_fmin_float_~y))) (or (and (and (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) .cse0 (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)) .cse1 .cse2 (not (fp.eq .cse3 .cse3)) .cse4) (= |ULTIMATE.start___fpclassify_float_#res| (_ bv0 32))) (and (or (and .cse5 (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967293 32)) (_ bv0 32)) .cse0 .cse2 .cse6 .cse4) (and .cse5 .cse0 .cse2 .cse7 .cse6 .cse4)) .cse8 .cse9) (and .cse5 (or (= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) ULTIMATE.start_fmin_float_~y) (= (fp (_ bv0 1) (_ bv0 8) (_ bv0 23)) ULTIMATE.start_fmin_float_~y)) .cse0 .cse2 .cse7 .cse6 .cse4) (and .cse5 (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967295 32)) (_ bv0 32)) .cse0 .cse8 .cse9 .cse2 .cse6 .cse4)))) [2019-01-12 09:17:12,530 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2019-01-12 09:17:12,530 INFO L444 ceAbstractionStarter]: 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 (= |ULTIMATE.start_isnan_float_#res| (_ bv0 32)) .cse0) (and (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)) (not .cse0)))) [2019-01-12 09:17:12,531 INFO L444 ceAbstractionStarter]: At program point L57-1(line 57) the Hoare annotation is: (and (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and .cse0 (= |ULTIMATE.start_isnan_float_#res| (_ bv0 32))) (and (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)) (not .cse0)))) |ULTIMATE.start_main_#t~short11| (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-01-12 09:17:12,531 INFO L444 ceAbstractionStarter]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse3 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (let ((.cse0 (not |ULTIMATE.start_main_#t~short15|)) (.cse1 (not |ULTIMATE.start_main_#t~short11|)) (.cse2 (or (and (= |ULTIMATE.start_isnan_float_#res| (_ bv0 32)) .cse3) (and (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)) (not .cse3))))) (or (and .cse0 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) .cse1 .cse2) (and .cse0 .cse3 .cse1 .cse2)))) [2019-01-12 09:17:12,531 INFO L444 ceAbstractionStarter]: At program point L57-3(line 57) the Hoare annotation is: (and (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and .cse0 (= |ULTIMATE.start_isnan_float_#res| (_ bv0 32))) (and (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)) (not .cse0)))) (not |ULTIMATE.start_main_#t~short15|) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short11|) |ULTIMATE.start_main_#t~short14|) [2019-01-12 09:17:12,531 INFO L444 ceAbstractionStarter]: At program point L57-4(line 57) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)) (not .cse1)) (and (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (= ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse0 (= |ULTIMATE.start_isnan_float_#res| (_ bv0 32)) .cse1 (not (let ((.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)))) (fp.eq .cse2 .cse2)))))) [2019-01-12 09:17:12,531 INFO L444 ceAbstractionStarter]: At program point L57-5(line 57) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short19| (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= |ULTIMATE.start_isnan_float_#res| (_ bv0 32)) (= |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-01-12 09:17:12,532 INFO L444 ceAbstractionStarter]: At program point L57-6(line 57) the Hoare annotation is: (let ((.cse3 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (let ((.cse2 (not .cse3))) (let ((.cse0 (or (and (= |ULTIMATE.start_isnan_float_#res| (_ bv0 32)) .cse3) (and (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)) .cse2)))) (or (and (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (= ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (and (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) .cse0) (not (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)))) (fp.eq .cse1 .cse1)))) (and .cse0 .cse2))))) [2019-01-12 09:17:12,532 INFO L444 ceAbstractionStarter]: At program point L57-7(line 57) the Hoare annotation is: (and (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (= ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (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-01-12 09:17:12,532 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-01-12 09:17:12,532 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-01-12 09:17:12,532 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 77) no Hoare annotation was computed. [2019-01-12 09:17:12,532 INFO L448 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2019-01-12 09:17:12,533 INFO L444 ceAbstractionStarter]: At program point L41-3(lines 35 42) the Hoare annotation is: (let ((.cse4 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (let ((.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))) (.cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0)) (.cse1 (= |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (.cse3 (not .cse4))) (or (and (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse0 (or (= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) ULTIMATE.start_main_~y~0) (= (fp (_ bv0 1) (_ bv0 8) (_ bv0 23)) ULTIMATE.start_main_~y~0)) .cse1 (= .cse2 ULTIMATE.start_fmin_float_~y) .cse3 (= ULTIMATE.start___fpclassify_float_~x ULTIMATE.start_fmin_float_~y)) (and (= |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (and (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2)) (and .cse4 (and .cse0 (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32))))) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0)) (and .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= |ULTIMATE.start_isnan_float_#res| (_ bv0 32)) .cse1 .cse3)))) [2019-01-12 09:17:12,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:17:12,533 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-01-12 09:17:12,533 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 32) no Hoare annotation was computed. [2019-01-12 09:17:12,533 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 32) no Hoare annotation was computed. [2019-01-12 09:17:12,533 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-01-12 09:17:12,533 INFO L448 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-01-12 09:17:12,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:17:12 BoogieIcfgContainer [2019-01-12 09:17:12,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:17:12,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:17:12,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:17:12,570 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:17:12,571 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:42" (3/4) ... [2019-01-12 09:17:12,574 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:17:12,588 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-01-12 09:17:12,588 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-12 09:17:12,589 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:17:12,626 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0bv32 && ~fp.eq~FLOAT(x, x)) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~FLOAT(x, x)) [2019-01-12 09:17:12,626 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(y, y) && \result == 0bv32) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~FLOAT(y, y))) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x) [2019-01-12 09:17:12,626 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!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) && ((\result == 0bv32 && ~fp.eq~FLOAT(x, x)) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~FLOAT(x, x)))) || (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(x, x)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((\result == 0bv32 && ~fp.eq~FLOAT(x, x)) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~FLOAT(x, x)))) [2019-01-12 09:17:12,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp.eq~FLOAT(y, y) && \result == 0bv32) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~FLOAT(y, y))) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && ~fp.eq~FLOAT(x, x)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && aux-!isnan_float(x) && isnan_float(y)-aux [2019-01-12 09:17:12,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((x == x && !~fp.eq~FLOAT(y, y)) && x == x) && y == y) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && ~fp.eq~FLOAT(x, x)) || ((((!~fp.eq~FLOAT(x, x) && y == y) && ~fp.eq~FLOAT(y, y)) && \result == 0bv32) && !~fp.eq~FLOAT(x, x)) [2019-01-12 09:17:12,627 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((x == x && (((y == y && ((~bvadd64(\result, 4294967292bv32) == 0bv32 || ~bvadd64(\result, 4294967293bv32) == 0bv32) || ~bvadd64(\result, 4294967294bv32) == 0bv32)) && ~fp.eq~FLOAT(x, x)) || (((((!(~bvadd64(w, 2147483648bv32) == 0bv32) && y == y && ~fp.eq~FLOAT(x, x)) && (!~bvule32(w, 2155872255bv32) || !~bvuge32(w, 2147483649bv32))) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && (!~bvuge32(w, 2155872256bv32) || !~bvule32(w, 4286578687bv32))) && !~bvule32(w, 2139095039bv32)))) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == x) && !~fp.eq~FLOAT(y, y)) && x == x) && ~bvadd64(\result, 4294967295bv32) == 0bv32) || ((((!~fp.eq~FLOAT(x, x) && y == y) && ~fp.eq~FLOAT(y, y)) && \result == 0bv32) && !~fp.eq~FLOAT(x, x)) [2019-01-12 09:17:12,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!~fp.eq~FLOAT(x, x) && y == y) && (~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == y || ~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23) == y)) && \result == y) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == y) && !~fp.eq~FLOAT(x, x)) && x == y) || ((\result == x && ((!~fp.eq~FLOAT(y, y) && !~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]))) && ~fp.eq~FLOAT(x, x) && y == y && ~bvadd64(\result, 4294967295bv32) == 0bv32) && x == x)) || ((((y == y && ~fp.eq~FLOAT(y, y)) && \result == 0bv32) && \result == y) && !~fp.eq~FLOAT(x, x)) [2019-01-12 09:17:12,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((x == x && !~fp.eq~FLOAT(x, x)) && y == y) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && ~fp.eq~FLOAT(x, x)) && x == y) || (((((!~fp.eq~FLOAT(x, x) && y == y) && ~fp.eq~FLOAT(y, y)) && \result == 0bv32) && !~fp.eq~FLOAT(x, x)) && x == y) [2019-01-12 09:17:12,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && ~fp.eq~FLOAT(y, y)) && \result == y) && res == y) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && !~fp.eq~FLOAT(x, x)) || ((((((((!~fp.eq~FLOAT(y, y) && res == x) && \result == x) && x == x) && !~fp.eq~FLOAT(x, x)) && y == y) && \result == 0bv32) && ~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-01-12 09:17:12,630 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((x == x && y == y) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && ~fp.eq~FLOAT(x, x)) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == y) && !~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]))) && x == y) && \result == 0bv32) || ((((((((!~fp.eq~FLOAT(x, x) && ~bvadd64(\result, 4294967293bv32) == 0bv32) && y == y) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == y) && !~fp.eq~FLOAT(x, x)) && x == y) || (((((!~fp.eq~FLOAT(x, x) && y == y) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == y) && (~bvadd64(\result, 4294967292bv32) == 0bv32 || ~bvadd64(\result, 4294967294bv32) == 0bv32)) && !~fp.eq~FLOAT(x, x)) && x == y)) && ~fp.eq~FLOAT(y, y)) && \result == 0bv32)) || ((((((!~fp.eq~FLOAT(x, x) && (~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == y || ~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23) == y)) && y == y) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == y) && (~bvadd64(\result, 4294967292bv32) == 0bv32 || ~bvadd64(\result, 4294967294bv32) == 0bv32)) && !~fp.eq~FLOAT(x, x)) && x == y)) || (((((((!~fp.eq~FLOAT(x, x) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && y == y) && ~fp.eq~FLOAT(y, y)) && \result == 0bv32) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == y) && !~fp.eq~FLOAT(x, x)) && x == y) [2019-01-12 09:17:12,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((aux-isnan_float(x) && !isnan_float(y)-aux && y == y) && ~fp.eq~FLOAT(y, y)) && \result == 0bv32) && \result == y) && res == y) && !~fp.eq~FLOAT(x, x) [2019-01-12 09:17:12,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(y, y) && res == x) && \result == x) && x == x) && !~fp.eq~FLOAT(x, x)) && y == y && ((\result == 0bv32 && ~fp.eq~FLOAT(x, x)) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~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]))) || (((\result == 0bv32 && ~fp.eq~FLOAT(x, x)) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~FLOAT(x, x))) && !~fp.eq~FLOAT(x, x)) [2019-01-12 09:17:12,632 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!~fp.eq~FLOAT(y, y) && res == x) && \result == x) && x == x) && !~fp.eq~FLOAT(x, x)) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && y == y) && ~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-01-12 09:17:12,689 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:17:12,689 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:17:12,692 INFO L168 Benchmark]: Toolchain (without parser) took 31571.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). Peak memory consumption was 174.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:12,693 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:17:12,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.92 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:12,694 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.88 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:12,694 INFO L168 Benchmark]: Boogie Preprocessor took 121.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:12,694 INFO L168 Benchmark]: RCFGBuilder took 737.85 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: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:12,698 INFO L168 Benchmark]: TraceAbstraction took 30134.77 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.9 MB). Peak memory consumption was 423.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:12,698 INFO L168 Benchmark]: Witness Printer took 119.40 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:12,703 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 400.92 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.88 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 737.85 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: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30134.77 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -12.9 MB). Peak memory consumption was 423.0 MB. Max. memory is 11.5 GB. * Witness Printer took 119.40 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. 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: (((((((!~fp.eq~FLOAT(x, x) && y == y) && (~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == y || ~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23) == y)) && \result == y) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == y) && !~fp.eq~FLOAT(x, x)) && x == y) || ((\result == x && ((!~fp.eq~FLOAT(y, y) && !~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]))) && ~fp.eq~FLOAT(x, x) && y == y && ~bvadd64(\result, 4294967295bv32) == 0bv32) && x == x)) || ((((y == y && ~fp.eq~FLOAT(y, y)) && \result == 0bv32) && \result == y) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((!~fp.eq~FLOAT(y, y) && res == x) && \result == x) && x == x) && !~fp.eq~FLOAT(x, x)) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && y == y) && ~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(y, y) && res == x) && \result == x) && x == x) && !~fp.eq~FLOAT(x, x)) && y == y && ((\result == 0bv32 && ~fp.eq~FLOAT(x, x)) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~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]))) || (((\result == 0bv32 && ~fp.eq~FLOAT(x, x)) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~FLOAT(x, x))) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((x == x && !~fp.eq~FLOAT(x, x)) && y == y) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && ~fp.eq~FLOAT(x, x)) && x == y) || (((((!~fp.eq~FLOAT(x, x) && y == y) && ~fp.eq~FLOAT(y, y)) && \result == 0bv32) && !~fp.eq~FLOAT(x, x)) && x == y) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((aux-isnan_float(x) && !isnan_float(y)-aux && y == y) && ~fp.eq~FLOAT(y, y)) && \result == 0bv32) && \result == y) && res == y) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((((x == x && y == y) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && ~fp.eq~FLOAT(x, x)) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == y) && !~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]))) && x == y) && \result == 0bv32) || ((((((((!~fp.eq~FLOAT(x, x) && ~bvadd64(\result, 4294967293bv32) == 0bv32) && y == y) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == y) && !~fp.eq~FLOAT(x, x)) && x == y) || (((((!~fp.eq~FLOAT(x, x) && y == y) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == y) && (~bvadd64(\result, 4294967292bv32) == 0bv32 || ~bvadd64(\result, 4294967294bv32) == 0bv32)) && !~fp.eq~FLOAT(x, x)) && x == y)) && ~fp.eq~FLOAT(y, y)) && \result == 0bv32)) || ((((((!~fp.eq~FLOAT(x, x) && (~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == y || ~fp~LONGDOUBLE(0bv1, 0bv8, 0bv23) == y)) && y == y) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == y) && (~bvadd64(\result, 4294967292bv32) == 0bv32 || ~bvadd64(\result, 4294967294bv32) == 0bv32)) && !~fp.eq~FLOAT(x, x)) && x == y)) || (((((((!~fp.eq~FLOAT(x, x) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && y == y) && ~fp.eq~FLOAT(y, y)) && \result == 0bv32) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == y) && !~fp.eq~FLOAT(x, x)) && x == y) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((y == y && ~fp.eq~FLOAT(y, y)) && \result == y) && res == y) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && !~fp.eq~FLOAT(x, x)) || ((((((((!~fp.eq~FLOAT(y, y) && res == x) && \result == x) && x == x) && !~fp.eq~FLOAT(x, x)) && y == y) && \result == 0bv32) && ~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: 12]: Loop Invariant Derived loop invariant: (((((x == x && (((y == y && ((~bvadd64(\result, 4294967292bv32) == 0bv32 || ~bvadd64(\result, 4294967293bv32) == 0bv32) || ~bvadd64(\result, 4294967294bv32) == 0bv32)) && ~fp.eq~FLOAT(x, x)) || (((((!(~bvadd64(w, 2147483648bv32) == 0bv32) && y == y && ~fp.eq~FLOAT(x, x)) && (!~bvule32(w, 2155872255bv32) || !~bvuge32(w, 2147483649bv32))) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && (!~bvuge32(w, 2155872256bv32) || !~bvule32(w, 4286578687bv32))) && !~bvule32(w, 2139095039bv32)))) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == x) && !~fp.eq~FLOAT(y, y)) && x == x) && ~bvadd64(\result, 4294967295bv32) == 0bv32) || ((((!~fp.eq~FLOAT(x, x) && y == y) && ~fp.eq~FLOAT(y, y)) && \result == 0bv32) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((~fp.eq~FLOAT(y, y) && \result == 0bv32) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~FLOAT(y, y))) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && ~fp.eq~FLOAT(x, x)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && aux-!isnan_float(x) && isnan_float(y)-aux - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((!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) && ((\result == 0bv32 && ~fp.eq~FLOAT(x, x)) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~FLOAT(x, x)))) || (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(x, x)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((\result == 0bv32 && ~fp.eq~FLOAT(x, x)) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~FLOAT(x, x)))) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((x == x && !~fp.eq~FLOAT(y, y)) && x == x) && y == y) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && ~fp.eq~FLOAT(x, x)) || ((((!~fp.eq~FLOAT(x, x) && y == y) && ~fp.eq~FLOAT(y, y)) && \result == 0bv32) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(y, y) && \result == 0bv32) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~FLOAT(y, y))) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (\result == 0bv32 && ~fp.eq~FLOAT(x, x)) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~FLOAT(x, x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. SAFE Result, 30.0s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 6.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1678 SDtfs, 1884 SDslu, 4730 SDs, 0 SdLazy, 1822 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 782 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 644 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 49 NumberOfFragments, 839 HoareAnnotationTreeSize, 14 FomulaSimplifications, 8210982 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 14 FomulaSimplificationsInter, 10706 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 685 NumberOfCodeBlocks, 685 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 68324 SizeOfPredicates, 161 NumberOfNonLiveVariables, 2006 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...