./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 2e94e6aa 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-2e94e6a [2018-12-31 04:06:37,642 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:06:37,644 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:06:37,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:06:37,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:06:37,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:06:37,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:06:37,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:06:37,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:06:37,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:06:37,664 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:06:37,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:06:37,665 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:06:37,666 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:06:37,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:06:37,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:06:37,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:06:37,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:06:37,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:06:37,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:06:37,675 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:06:37,677 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:06:37,683 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:06:37,683 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:06:37,684 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:06:37,685 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:06:37,685 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:06:37,686 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:06:37,689 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:06:37,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:06:37,690 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:06:37,691 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:06:37,691 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:06:37,691 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:06:37,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:06:37,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:06:37,695 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:06:37,725 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:06:37,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:06:37,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:06:37,727 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:06:37,727 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:06:37,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:06:37,729 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:06:37,729 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:06:37,729 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:06:37,729 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:06:37,729 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:06:37,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:06:37,730 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:06:37,730 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:06:37,730 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:06:37,730 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:06:37,730 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:06:37,731 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:06:37,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:06:37,732 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:06:37,732 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:06:37,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:06:37,732 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:06:37,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:06:37,733 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:06:37,733 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:06:37,733 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:06:37,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:06:37,734 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 [2018-12-31 04:06:37,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:06:37,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:06:37,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:06:37,810 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:06:37,811 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:06:37,811 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-12-31 04:06:37,874 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17adbf6cf/3cc557a252d84425acbeb49e1f0e225c/FLAG387b37ce4 [2018-12-31 04:06:38,363 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:06:38,364 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-12-31 04:06:38,371 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17adbf6cf/3cc557a252d84425acbeb49e1f0e225c/FLAG387b37ce4 [2018-12-31 04:06:38,716 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17adbf6cf/3cc557a252d84425acbeb49e1f0e225c [2018-12-31 04:06:38,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:06:38,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:06:38,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:38,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:06:38,728 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:06:38,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:38" (1/1) ... [2018-12-31 04:06:38,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dbefa8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38, skipping insertion in model container [2018-12-31 04:06:38,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:38" (1/1) ... [2018-12-31 04:06:38,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:06:38,766 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:06:39,016 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:39,022 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:06:39,072 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:39,110 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:06:39,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:39 WrapperNode [2018-12-31 04:06:39,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:39,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:39,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:06:39,113 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:06:39,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:39" (1/1) ... [2018-12-31 04:06:39,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:39" (1/1) ... [2018-12-31 04:06:39,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:39,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:06:39,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:06:39,187 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:06:39,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:39" (1/1) ... [2018-12-31 04:06:39,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:39" (1/1) ... [2018-12-31 04:06:39,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:39" (1/1) ... [2018-12-31 04:06:39,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:39" (1/1) ... [2018-12-31 04:06:39,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:39" (1/1) ... [2018-12-31 04:06:39,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:39" (1/1) ... [2018-12-31 04:06:39,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:39" (1/1) ... [2018-12-31 04:06:39,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:06:39,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:06:39,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:06:39,316 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:06:39,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:39" (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 [2018-12-31 04:06:39,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:06:39,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 04:06:39,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:06:39,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:06:39,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:06:39,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:06:40,063 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:06:40,063 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-12-31 04:06:40,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:40 BoogieIcfgContainer [2018-12-31 04:06:40,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:06:40,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:06:40,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:06:40,068 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:06:40,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:06:38" (1/3) ... [2018-12-31 04:06:40,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73393aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:40, skipping insertion in model container [2018-12-31 04:06:40,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:39" (2/3) ... [2018-12-31 04:06:40,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73393aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:40, skipping insertion in model container [2018-12-31 04:06:40,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:40" (3/3) ... [2018-12-31 04:06:40,072 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231_true-unreach-call.c [2018-12-31 04:06:40,081 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:06:40,088 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-31 04:06:40,106 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-31 04:06:40,139 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:06:40,140 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:06:40,140 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:06:40,140 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:06:40,141 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:06:40,141 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:06:40,141 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:06:40,141 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:06:40,141 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:06:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-31 04:06:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:06:40,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:40,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:40,170 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2018-12-31 04:06:40,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:40,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:40,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:40,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:40,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:40,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:40,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:40,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:40,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:40,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:40,400 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2018-12-31 04:06:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:40,614 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2018-12-31 04:06:40,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:06:40,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-31 04:06:40,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:40,626 INFO L225 Difference]: With dead ends: 90 [2018-12-31 04:06:40,626 INFO L226 Difference]: Without dead ends: 50 [2018-12-31 04:06:40,629 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 [2018-12-31 04:06:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-31 04:06:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2018-12-31 04:06:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 04:06:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2018-12-31 04:06:40,667 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2018-12-31 04:06:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:40,667 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2018-12-31 04:06:40,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2018-12-31 04:06:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 04:06:40,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:40,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:40,669 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:40,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:40,669 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2018-12-31 04:06:40,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:40,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:40,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:40,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:40,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:40,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:40,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:40,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:40,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:40,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:40,764 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2018-12-31 04:06:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:41,011 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2018-12-31 04:06:41,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:41,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-31 04:06:41,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:41,015 INFO L225 Difference]: With dead ends: 77 [2018-12-31 04:06:41,015 INFO L226 Difference]: Without dead ends: 64 [2018-12-31 04:06:41,018 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 [2018-12-31 04:06:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-31 04:06:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2018-12-31 04:06:41,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-31 04:06:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2018-12-31 04:06:41,035 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2018-12-31 04:06:41,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:41,037 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2018-12-31 04:06:41,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2018-12-31 04:06:41,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 04:06:41,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:41,041 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] [2018-12-31 04:06:41,041 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:41,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:41,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2018-12-31 04:06:41,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:41,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:41,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:41,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:41,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:41,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:41,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:06:41,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:06:41,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:06:41,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:06:41,135 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2018-12-31 04:06:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:41,193 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2018-12-31 04:06:41,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:06:41,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-31 04:06:41,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:41,195 INFO L225 Difference]: With dead ends: 50 [2018-12-31 04:06:41,196 INFO L226 Difference]: Without dead ends: 48 [2018-12-31 04:06:41,196 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 [2018-12-31 04:06:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-31 04:06:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-31 04:06:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-31 04:06:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2018-12-31 04:06:41,210 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2018-12-31 04:06:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:41,210 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2018-12-31 04:06:41,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:06:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2018-12-31 04:06:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 04:06:41,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:41,213 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] [2018-12-31 04:06:41,214 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:41,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:41,214 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2018-12-31 04:06:41,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:41,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:41,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:41,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:41,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:06:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:06:41,326 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 04:06:41,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:06:41 BoogieIcfgContainer [2018-12-31 04:06:41,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:06:41,365 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:06:41,365 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:06:41,365 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:06:41,366 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:40" (3/4) ... [2018-12-31 04:06:41,371 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 04:06:41,371 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:06:41,372 INFO L168 Benchmark]: Toolchain (without parser) took 2650.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -95.8 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:41,374 INFO L168 Benchmark]: CDTParser took 0.15 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. [2018-12-31 04:06:41,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.95 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:41,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.33 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. [2018-12-31 04:06:41,376 INFO L168 Benchmark]: Boogie Preprocessor took 128.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:41,377 INFO L168 Benchmark]: RCFGBuilder took 748.38 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.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:41,378 INFO L168 Benchmark]: TraceAbstraction took 1300.25 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: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:41,379 INFO L168 Benchmark]: Witness Printer took 5.64 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. [2018-12-31 04:06:41,387 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.15 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 387.95 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.33 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 128.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 748.38 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.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1300.25 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: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.64 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.2s 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.2s 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-2e94e6a [2018-12-31 04:06:43,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:06:43,827 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:06:43,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:06:43,840 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:06:43,841 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:06:43,843 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:06:43,845 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:06:43,847 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:06:43,848 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:06:43,849 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:06:43,849 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:06:43,851 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:06:43,852 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:06:43,853 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:06:43,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:06:43,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:06:43,857 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:06:43,859 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:06:43,861 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:06:43,862 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:06:43,863 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:06:43,866 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:06:43,866 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:06:43,866 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:06:43,867 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:06:43,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:06:43,869 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:06:43,870 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:06:43,872 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:06:43,872 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:06:43,872 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:06:43,873 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:06:43,873 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:06:43,874 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:06:43,875 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:06:43,875 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 04:06:43,891 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:06:43,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:06:43,893 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:06:43,893 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:06:43,893 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:06:43,894 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:06:43,894 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:06:43,894 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:06:43,894 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:06:43,894 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:06:43,894 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:06:43,895 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:06:43,895 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 04:06:43,895 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 04:06:43,895 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:06:43,895 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:06:43,895 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:06:43,897 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:06:43,897 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:06:43,898 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:06:43,898 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:06:43,898 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:06:43,898 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:06:43,899 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:06:43,899 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:06:43,899 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:06:43,899 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 04:06:43,899 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:06:43,899 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 04:06:43,899 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 04:06:43,900 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 [2018-12-31 04:06:43,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:06:43,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:06:43,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:06:43,956 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:06:43,956 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:06:43,957 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-12-31 04:06:44,016 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c03f037/4b3cc29a139d47cda5a9b1cfc0a5936b/FLAGf7f9ead4f [2018-12-31 04:06:44,484 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:06:44,485 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-12-31 04:06:44,492 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c03f037/4b3cc29a139d47cda5a9b1cfc0a5936b/FLAGf7f9ead4f [2018-12-31 04:06:44,852 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c03f037/4b3cc29a139d47cda5a9b1cfc0a5936b [2018-12-31 04:06:44,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:06:44,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:06:44,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:44,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:06:44,868 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:06:44,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5080a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44, skipping insertion in model container [2018-12-31 04:06:44,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:06:44,911 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:06:45,112 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:45,120 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:06:45,172 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:45,213 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:06:45,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:45 WrapperNode [2018-12-31 04:06:45,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:45,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:45,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:06:45,215 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:06:45,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:45" (1/1) ... [2018-12-31 04:06:45,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:45" (1/1) ... [2018-12-31 04:06:45,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:45,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:06:45,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:06:45,274 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:06:45,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:45" (1/1) ... [2018-12-31 04:06:45,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:45" (1/1) ... [2018-12-31 04:06:45,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:45" (1/1) ... [2018-12-31 04:06:45,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:45" (1/1) ... [2018-12-31 04:06:45,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:45" (1/1) ... [2018-12-31 04:06:45,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:45" (1/1) ... [2018-12-31 04:06:45,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:45" (1/1) ... [2018-12-31 04:06:45,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:06:45,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:06:45,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:06:45,395 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:06:45,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:45" (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 [2018-12-31 04:06:45,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:06:45,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 04:06:45,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:06:45,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:06:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-12-31 04:06:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:06:46,040 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 04:06:46,132 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 04:06:46,269 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:06:46,269 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-12-31 04:06:46,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:46 BoogieIcfgContainer [2018-12-31 04:06:46,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:06:46,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:06:46,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:06:46,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:06:46,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:06:44" (1/3) ... [2018-12-31 04:06:46,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553cf42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:46, skipping insertion in model container [2018-12-31 04:06:46,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:45" (2/3) ... [2018-12-31 04:06:46,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553cf42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:46, skipping insertion in model container [2018-12-31 04:06:46,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:46" (3/3) ... [2018-12-31 04:06:46,278 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231_true-unreach-call.c [2018-12-31 04:06:46,288 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:06:46,297 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-31 04:06:46,315 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-31 04:06:46,348 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:06:46,349 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:06:46,349 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:06:46,349 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:06:46,349 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:06:46,350 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:06:46,350 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:06:46,350 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:06:46,350 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:06:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-31 04:06:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:06:46,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:46,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:46,381 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:46,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:46,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2018-12-31 04:06:46,391 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:46,392 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) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:46,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:46,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:46,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:46,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:46,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:06:46,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:06:46,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:06:46,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:06:46,525 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2018-12-31 04:06:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:46,546 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2018-12-31 04:06:46,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:06:46,547 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 04:06:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:46,559 INFO L225 Difference]: With dead ends: 82 [2018-12-31 04:06:46,560 INFO L226 Difference]: Without dead ends: 43 [2018-12-31 04:06:46,563 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 [2018-12-31 04:06:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-31 04:06:46,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-31 04:06:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-31 04:06:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2018-12-31 04:06:46,599 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2018-12-31 04:06:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:46,600 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-12-31 04:06:46,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:06:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2018-12-31 04:06:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 04:06:46,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:46,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:46,601 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:46,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:46,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2018-12-31 04:06:46,603 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:46,603 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) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:46,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:46,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:46,760 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:46,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:46,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:46,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:46,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:46,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:46,778 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2018-12-31 04:06:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:47,039 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2018-12-31 04:06:47,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:06:47,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-31 04:06:47,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:47,041 INFO L225 Difference]: With dead ends: 82 [2018-12-31 04:06:47,042 INFO L226 Difference]: Without dead ends: 50 [2018-12-31 04:06:47,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:47,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-31 04:06:47,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2018-12-31 04:06:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 04:06:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2018-12-31 04:06:47,052 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2018-12-31 04:06:47,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:47,052 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2018-12-31 04:06:47,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2018-12-31 04:06:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 04:06:47,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:47,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:47,054 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:47,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:47,055 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2018-12-31 04:06:47,055 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:47,056 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 [2018-12-31 04:06:47,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:47,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:47,225 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:47,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:47,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:47,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:47,239 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2018-12-31 04:06:47,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:47,356 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2018-12-31 04:06:47,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:47,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-31 04:06:47,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:47,358 INFO L225 Difference]: With dead ends: 77 [2018-12-31 04:06:47,359 INFO L226 Difference]: Without dead ends: 64 [2018-12-31 04:06:47,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-31 04:06:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2018-12-31 04:06:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-31 04:06:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2018-12-31 04:06:47,367 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2018-12-31 04:06:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:47,368 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2018-12-31 04:06:47,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2018-12-31 04:06:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 04:06:47,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:47,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:47,370 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:47,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash -674173253, now seen corresponding path program 1 times [2018-12-31 04:06:47,371 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:47,371 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 [2018-12-31 04:06:47,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:47,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:47,520 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:47,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:47,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:47,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:47,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:47,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:47,535 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2018-12-31 04:06:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:47,740 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2018-12-31 04:06:47,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:47,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-31 04:06:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:47,742 INFO L225 Difference]: With dead ends: 79 [2018-12-31 04:06:47,742 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 04:06:47,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 04:06:47,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2018-12-31 04:06:47,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-31 04:06:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2018-12-31 04:06:47,753 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2018-12-31 04:06:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:47,754 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2018-12-31 04:06:47,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2018-12-31 04:06:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 04:06:47,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:47,757 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] [2018-12-31 04:06:47,757 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1345927737, now seen corresponding path program 1 times [2018-12-31 04:06:47,759 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:47,759 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) [2018-12-31 04:06:47,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:47,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:47,970 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:47,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:47,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:47,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:47,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:47,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:47,985 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2018-12-31 04:06:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:48,142 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2018-12-31 04:06:48,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:48,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-31 04:06:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:48,146 INFO L225 Difference]: With dead ends: 79 [2018-12-31 04:06:48,146 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 04:06:48,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 04:06:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2018-12-31 04:06:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-31 04:06:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2018-12-31 04:06:48,159 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 20 [2018-12-31 04:06:48,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:48,160 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2018-12-31 04:06:48,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2018-12-31 04:06:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 04:06:48,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:48,161 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] [2018-12-31 04:06:48,162 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:48,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:48,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2018-12-31 04:06:48,162 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:48,163 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 [2018-12-31 04:06:48,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:48,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:48,476 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 04:06:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:48,622 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:48,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:48,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 04:06:48,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:06:48,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:06:48,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:06:48,636 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 7 states. [2018-12-31 04:06:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:49,650 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2018-12-31 04:06:49,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 04:06:49,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-31 04:06:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:49,653 INFO L225 Difference]: With dead ends: 149 [2018-12-31 04:06:49,653 INFO L226 Difference]: Without dead ends: 140 [2018-12-31 04:06:49,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-31 04:06:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-31 04:06:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2018-12-31 04:06:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-31 04:06:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2018-12-31 04:06:49,673 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2018-12-31 04:06:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:49,674 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2018-12-31 04:06:49,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:06:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2018-12-31 04:06:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 04:06:49,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:49,677 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] [2018-12-31 04:06:49,677 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:49,678 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2018-12-31 04:06:49,678 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:49,678 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 [2018-12-31 04:06:49,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:49,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:49,998 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 04:06:50,288 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 04:06:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:50,422 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:50,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:50,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 04:06:50,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 04:06:50,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 04:06:50,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:06:50,441 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 9 states. [2018-12-31 04:06:51,306 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-12-31 04:06:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:51,505 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2018-12-31 04:06:51,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 04:06:51,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-31 04:06:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:51,516 INFO L225 Difference]: With dead ends: 180 [2018-12-31 04:06:51,516 INFO L226 Difference]: Without dead ends: 178 [2018-12-31 04:06:51,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-12-31 04:06:51,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-31 04:06:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2018-12-31 04:06:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-31 04:06:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2018-12-31 04:06:51,543 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2018-12-31 04:06:51,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:51,543 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2018-12-31 04:06:51,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 04:06:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2018-12-31 04:06:51,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 04:06:51,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:51,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, 1] [2018-12-31 04:06:51,546 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:51,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:51,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2018-12-31 04:06:51,546 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:51,548 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) [2018-12-31 04:06:51,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:51,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:51,696 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:51,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:51,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 04:06:51,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:06:51,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:06:51,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:06:51,708 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 7 states. [2018-12-31 04:06:52,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:52,538 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2018-12-31 04:06:52,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 04:06:52,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-31 04:06:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:52,540 INFO L225 Difference]: With dead ends: 166 [2018-12-31 04:06:52,540 INFO L226 Difference]: Without dead ends: 131 [2018-12-31 04:06:52,541 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 [2018-12-31 04:06:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-31 04:06:52,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2018-12-31 04:06:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-31 04:06:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2018-12-31 04:06:52,575 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2018-12-31 04:06:52,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:52,575 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2018-12-31 04:06:52,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:06:52,576 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2018-12-31 04:06:52,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 04:06:52,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:52,577 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] [2018-12-31 04:06:52,577 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:52,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:52,577 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2018-12-31 04:06:52,580 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:52,580 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 [2018-12-31 04:06:52,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:52,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:52,664 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:52,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:52,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:52,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:52,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:52,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:52,675 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 4 states. [2018-12-31 04:06:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:52,772 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2018-12-31 04:06:52,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:52,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-12-31 04:06:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:52,785 INFO L225 Difference]: With dead ends: 133 [2018-12-31 04:06:52,785 INFO L226 Difference]: Without dead ends: 117 [2018-12-31 04:06:52,785 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 [2018-12-31 04:06:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-31 04:06:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2018-12-31 04:06:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-31 04:06:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-12-31 04:06:52,823 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2018-12-31 04:06:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:52,823 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-12-31 04:06:52,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2018-12-31 04:06:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 04:06:52,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:52,832 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] [2018-12-31 04:06:52,832 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:52,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2018-12-31 04:06:52,833 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:52,834 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) [2018-12-31 04:06:52,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:52,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:52,898 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:52,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:52,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:06:52,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:06:52,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:06:52,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:06:52,911 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2018-12-31 04:06:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:53,025 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2018-12-31 04:06:53,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:06:53,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 04:06:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:53,028 INFO L225 Difference]: With dead ends: 96 [2018-12-31 04:06:53,028 INFO L226 Difference]: Without dead ends: 94 [2018-12-31 04:06:53,028 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 [2018-12-31 04:06:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-31 04:06:53,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-12-31 04:06:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-31 04:06:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-12-31 04:06:53,043 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2018-12-31 04:06:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:53,043 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-12-31 04:06:53,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:06:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2018-12-31 04:06:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 04:06:53,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:53,047 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] [2018-12-31 04:06:53,047 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:53,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:53,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1838896133, now seen corresponding path program 1 times [2018-12-31 04:06:53,049 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:53,049 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 [2018-12-31 04:06:53,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:53,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:53,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:53,127 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:53,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:53,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:53,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:53,140 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 4 states. [2018-12-31 04:06:53,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:53,343 INFO L93 Difference]: Finished difference Result 139 states and 176 transitions. [2018-12-31 04:06:53,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:53,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-31 04:06:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:53,346 INFO L225 Difference]: With dead ends: 139 [2018-12-31 04:06:53,346 INFO L226 Difference]: Without dead ends: 122 [2018-12-31 04:06:53,346 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 [2018-12-31 04:06:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-31 04:06:53,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2018-12-31 04:06:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-31 04:06:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-12-31 04:06:53,363 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 25 [2018-12-31 04:06:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:53,363 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-12-31 04:06:53,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2018-12-31 04:06:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 04:06:53,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:53,364 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] [2018-12-31 04:06:53,365 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:53,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:53,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2018-12-31 04:06:53,368 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:53,368 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 [2018-12-31 04:06:53,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:53,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:53,649 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 04:06:53,831 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 04:06:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:53,883 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:53,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:53,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 04:06:53,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:06:53,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:06:53,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:06:53,894 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 7 states. [2018-12-31 04:06:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:54,845 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2018-12-31 04:06:54,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 04:06:54,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-31 04:06:54,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:54,847 INFO L225 Difference]: With dead ends: 131 [2018-12-31 04:06:54,847 INFO L226 Difference]: Without dead ends: 118 [2018-12-31 04:06:54,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-31 04:06:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-31 04:06:54,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2018-12-31 04:06:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-31 04:06:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2018-12-31 04:06:54,864 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2018-12-31 04:06:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:54,864 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2018-12-31 04:06:54,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:06:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2018-12-31 04:06:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 04:06:54,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:54,865 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] [2018-12-31 04:06:54,868 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:54,868 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2018-12-31 04:06:54,869 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:54,869 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 [2018-12-31 04:06:54,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:54,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:55,049 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:55,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:55,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 04:06:55,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 04:06:55,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 04:06:55,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:06:55,061 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 8 states. [2018-12-31 04:06:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:55,915 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2018-12-31 04:06:55,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 04:06:55,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-12-31 04:06:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:55,916 INFO L225 Difference]: With dead ends: 114 [2018-12-31 04:06:55,916 INFO L226 Difference]: Without dead ends: 78 [2018-12-31 04:06:55,917 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 [2018-12-31 04:06:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-31 04:06:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-12-31 04:06:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-31 04:06:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2018-12-31 04:06:55,928 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2018-12-31 04:06:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:55,928 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2018-12-31 04:06:55,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 04:06:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2018-12-31 04:06:55,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 04:06:55,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:55,929 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] [2018-12-31 04:06:55,929 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:55,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:55,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2018-12-31 04:06:55,930 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:55,930 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 [2018-12-31 04:06:55,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:55,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:56,057 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:56,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:56,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 04:06:56,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:06:56,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:06:56,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:06:56,076 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 7 states. [2018-12-31 04:06:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:56,553 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-12-31 04:06:56,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 04:06:56,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-31 04:06:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:56,555 INFO L225 Difference]: With dead ends: 84 [2018-12-31 04:06:56,555 INFO L226 Difference]: Without dead ends: 74 [2018-12-31 04:06:56,555 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 [2018-12-31 04:06:56,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-31 04:06:56,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-31 04:06:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-31 04:06:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2018-12-31 04:06:56,566 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2018-12-31 04:06:56,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:56,568 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2018-12-31 04:06:56,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:06:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-12-31 04:06:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 04:06:56,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:56,569 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] [2018-12-31 04:06:56,569 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:56,569 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2018-12-31 04:06:56,570 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:56,570 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 [2018-12-31 04:06:56,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:56,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:56,716 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:56,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:56,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 04:06:56,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 04:06:56,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 04:06:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:06:56,727 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 6 states. [2018-12-31 04:06:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:57,151 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2018-12-31 04:06:57,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 04:06:57,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-31 04:06:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:57,154 INFO L225 Difference]: With dead ends: 82 [2018-12-31 04:06:57,154 INFO L226 Difference]: Without dead ends: 74 [2018-12-31 04:06:57,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-31 04:06:57,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-31 04:06:57,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-31 04:06:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-31 04:06:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2018-12-31 04:06:57,165 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2018-12-31 04:06:57,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:57,165 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2018-12-31 04:06:57,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 04:06:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2018-12-31 04:06:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 04:06:57,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:57,168 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] [2018-12-31 04:06:57,168 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:57,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:57,168 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2018-12-31 04:06:57,170 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:57,170 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 [2018-12-31 04:06:57,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:57,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:57,522 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:57,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:57,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 04:06:57,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 04:06:57,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 04:06:57,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:06:57,533 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 9 states. [2018-12-31 04:06:58,247 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-12-31 04:06:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:58,878 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2018-12-31 04:06:58,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 04:06:58,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-12-31 04:06:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:58,882 INFO L225 Difference]: With dead ends: 120 [2018-12-31 04:06:58,883 INFO L226 Difference]: Without dead ends: 109 [2018-12-31 04:06:58,883 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 [2018-12-31 04:06:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-31 04:06:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 74. [2018-12-31 04:06:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-31 04:06:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2018-12-31 04:06:58,900 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 26 [2018-12-31 04:06:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:58,900 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2018-12-31 04:06:58,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 04:06:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2018-12-31 04:06:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 04:06:58,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:58,901 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] [2018-12-31 04:06:58,902 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1994202826, now seen corresponding path program 1 times [2018-12-31 04:06:58,902 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:58,903 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 [2018-12-31 04:06:58,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:58,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:58,983 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:58,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:58,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:58,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:58,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:58,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:58,994 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand 4 states. [2018-12-31 04:06:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:59,100 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2018-12-31 04:06:59,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:59,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-12-31 04:06:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:59,102 INFO L225 Difference]: With dead ends: 120 [2018-12-31 04:06:59,102 INFO L226 Difference]: Without dead ends: 103 [2018-12-31 04:06:59,104 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 [2018-12-31 04:06:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-31 04:06:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2018-12-31 04:06:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-31 04:06:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2018-12-31 04:06:59,121 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 26 [2018-12-31 04:06:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:59,121 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2018-12-31 04:06:59,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2018-12-31 04:06:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 04:06:59,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:59,122 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] [2018-12-31 04:06:59,125 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:59,125 INFO L82 PathProgramCache]: Analyzing trace with hash 548357897, now seen corresponding path program 1 times [2018-12-31 04:06:59,126 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:59,126 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) [2018-12-31 04:06:59,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:59,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:59,432 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:59,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:59,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 04:06:59,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 04:06:59,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 04:06:59,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 04:06:59,444 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand 10 states. [2018-12-31 04:07:00,192 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-12-31 04:07:00,349 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-12-31 04:07:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:00,748 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-12-31 04:07:00,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 04:07:00,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-12-31 04:07:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:00,749 INFO L225 Difference]: With dead ends: 81 [2018-12-31 04:07:00,749 INFO L226 Difference]: Without dead ends: 70 [2018-12-31 04:07:00,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-31 04:07:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-31 04:07:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-31 04:07:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-31 04:07:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2018-12-31 04:07:00,760 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 27 [2018-12-31 04:07:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:00,760 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2018-12-31 04:07:00,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 04:07:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2018-12-31 04:07:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 04:07:00,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:07:00,761 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] [2018-12-31 04:07:00,761 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:07:00,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:07:00,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2066405290, now seen corresponding path program 1 times [2018-12-31 04:07:00,762 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:07:00,762 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 [2018-12-31 04:07:00,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:07:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:00,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:00,835 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:00,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:00,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:07:00,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:07:00,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:07:00,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:07:00,847 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand 4 states. [2018-12-31 04:07:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:00,958 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2018-12-31 04:07:00,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:07:00,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-31 04:07:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:00,960 INFO L225 Difference]: With dead ends: 107 [2018-12-31 04:07:00,960 INFO L226 Difference]: Without dead ends: 88 [2018-12-31 04:07:00,961 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 [2018-12-31 04:07:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-31 04:07:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2018-12-31 04:07:00,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-31 04:07:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-12-31 04:07:00,975 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 27 [2018-12-31 04:07:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:00,975 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2018-12-31 04:07:00,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:07:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-12-31 04:07:00,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 04:07:00,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:07:00,978 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] [2018-12-31 04:07:00,978 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:07:00,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:07:00,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2018-12-31 04:07:00,980 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:07:00,980 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 [2018-12-31 04:07:00,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:07:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:01,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:01,447 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:01,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:01,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 04:07:01,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 04:07:01,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 04:07:01,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-31 04:07:01,459 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 12 states. [2018-12-31 04:07:02,751 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2018-12-31 04:07:03,003 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-31 04:07:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:04,343 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2018-12-31 04:07:04,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-31 04:07:04,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-12-31 04:07:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:04,345 INFO L225 Difference]: With dead ends: 193 [2018-12-31 04:07:04,345 INFO L226 Difference]: Without dead ends: 158 [2018-12-31 04:07:04,347 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 [2018-12-31 04:07:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-31 04:07:04,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2018-12-31 04:07:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-31 04:07:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-12-31 04:07:04,359 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2018-12-31 04:07:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:04,359 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-12-31 04:07:04,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 04:07:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-12-31 04:07:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 04:07:04,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:07:04,360 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] [2018-12-31 04:07:04,360 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:07:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:07:04,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2018-12-31 04:07:04,360 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:07:04,360 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 [2018-12-31 04:07:04,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:07:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:04,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:04,671 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:04,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:04,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 04:07:04,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 04:07:04,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 04:07:04,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-31 04:07:04,682 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 10 states. [2018-12-31 04:07:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:05,976 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2018-12-31 04:07:05,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 04:07:05,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-12-31 04:07:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:05,978 INFO L225 Difference]: With dead ends: 135 [2018-12-31 04:07:05,978 INFO L226 Difference]: Without dead ends: 111 [2018-12-31 04:07:05,979 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 [2018-12-31 04:07:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-31 04:07:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 43. [2018-12-31 04:07:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-31 04:07:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-12-31 04:07:05,995 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 28 [2018-12-31 04:07:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:05,996 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-12-31 04:07:05,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 04:07:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-12-31 04:07:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 04:07:05,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:07:05,997 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] [2018-12-31 04:07:05,997 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:07:05,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:07:05,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1106626442, now seen corresponding path program 1 times [2018-12-31 04:07:05,997 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:07:05,998 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 [2018-12-31 04:07:06,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:07:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:06,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:06,087 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:06,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:06,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:07:06,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:07:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:07:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:07:06,098 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 4 states. [2018-12-31 04:07:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:06,206 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-12-31 04:07:06,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:07:06,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-12-31 04:07:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:06,209 INFO L225 Difference]: With dead ends: 67 [2018-12-31 04:07:06,209 INFO L226 Difference]: Without dead ends: 57 [2018-12-31 04:07:06,209 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 [2018-12-31 04:07:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-31 04:07:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2018-12-31 04:07:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 04:07:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-12-31 04:07:06,224 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2018-12-31 04:07:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:06,224 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-31 04:07:06,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:07:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-12-31 04:07:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 04:07:06,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:07:06,227 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] [2018-12-31 04:07:06,227 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:07:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:07:06,229 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2018-12-31 04:07:06,229 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:07:06,229 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) [2018-12-31 04:07:06,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2018-12-31 04:07:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:06,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:06,453 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:06,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:06,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 04:07:06,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 04:07:06,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 04:07:06,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:07:06,464 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 6 states. [2018-12-31 04:07:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:07,093 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-12-31 04:07:07,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 04:07:07,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-12-31 04:07:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:07,094 INFO L225 Difference]: With dead ends: 52 [2018-12-31 04:07:07,094 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 04:07:07,095 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 [2018-12-31 04:07:07,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 04:07:07,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-31 04:07:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 04:07:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-12-31 04:07:07,105 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2018-12-31 04:07:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:07,105 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-12-31 04:07:07,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 04:07:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-12-31 04:07:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 04:07:07,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:07:07,106 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] [2018-12-31 04:07:07,106 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:07:07,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:07:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2018-12-31 04:07:07,107 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:07:07,107 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 [2018-12-31 04:07:07,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:07:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:07,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:07,313 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:07,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:07,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 04:07:07,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 04:07:07,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 04:07:07,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:07:07,324 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 8 states. [2018-12-31 04:07:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:07,865 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-12-31 04:07:07,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 04:07:07,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-12-31 04:07:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:07,866 INFO L225 Difference]: With dead ends: 53 [2018-12-31 04:07:07,866 INFO L226 Difference]: Without dead ends: 39 [2018-12-31 04:07:07,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-31 04:07:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-31 04:07:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-31 04:07:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 04:07:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-12-31 04:07:07,877 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2018-12-31 04:07:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:07,877 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-31 04:07:07,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 04:07:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-12-31 04:07:07,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 04:07:07,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:07:07,878 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] [2018-12-31 04:07:07,878 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:07:07,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:07:07,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2018-12-31 04:07:07,879 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:07:07,879 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 [2018-12-31 04:07:07,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:07:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:07,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:08,154 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:08,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:08,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 04:07:08,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:07:08,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:07:08,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:07:08,165 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 7 states. [2018-12-31 04:07:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:08,744 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-12-31 04:07:08,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 04:07:08,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-12-31 04:07:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:08,746 INFO L225 Difference]: With dead ends: 71 [2018-12-31 04:07:08,746 INFO L226 Difference]: Without dead ends: 61 [2018-12-31 04:07:08,747 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 [2018-12-31 04:07:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-31 04:07:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2018-12-31 04:07:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-31 04:07:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-12-31 04:07:08,761 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 33 [2018-12-31 04:07:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:08,761 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-12-31 04:07:08,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:07:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-12-31 04:07:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 04:07:08,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:07:08,765 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] [2018-12-31 04:07:08,765 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:07:08,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:07:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash -26785796, now seen corresponding path program 1 times [2018-12-31 04:07:08,766 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:07:08,766 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) [2018-12-31 04:07:08,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2018-12-31 04:07:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:08,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:08,996 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:09,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:09,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 04:07:09,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 04:07:09,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 04:07:09,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:07:09,007 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 8 states. [2018-12-31 04:07:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:09,516 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-12-31 04:07:09,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 04:07:09,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-12-31 04:07:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:09,518 INFO L225 Difference]: With dead ends: 59 [2018-12-31 04:07:09,519 INFO L226 Difference]: Without dead ends: 49 [2018-12-31 04:07:09,519 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 [2018-12-31 04:07:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-31 04:07:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2018-12-31 04:07:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-31 04:07:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-12-31 04:07:09,529 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2018-12-31 04:07:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:09,529 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-12-31 04:07:09,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 04:07:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-12-31 04:07:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 04:07:09,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:07:09,530 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] [2018-12-31 04:07:09,530 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:07:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:07:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2018-12-31 04:07:09,531 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:07:09,531 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 [2018-12-31 04:07:09,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:07:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:07:09,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:07:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:07:09,611 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:07:09,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:07:09,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:07:09,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:07:09,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:07:09,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:07:09,622 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2018-12-31 04:07:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:07:09,661 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-12-31 04:07:09,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:07:09,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-31 04:07:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:07:09,663 INFO L225 Difference]: With dead ends: 39 [2018-12-31 04:07:09,664 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 04:07:09,664 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 [2018-12-31 04:07:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 04:07:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 04:07:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 04:07:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 04:07:09,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-12-31 04:07:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:07:09,665 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 04:07:09,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:07:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 04:07:09,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 04:07:09,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 04:07:09,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:07:09,975 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 70 [2018-12-31 04:07:09,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:07:09,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:07:09,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:07:10,093 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 63 [2018-12-31 04:07:10,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:07:10,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:07:10,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:07:10,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:07:10,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 04:07:12,408 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2018-12-31 04:07:12,915 WARN L181 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 31 [2018-12-31 04:07:13,399 WARN L181 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2018-12-31 04:07:13,774 WARN L181 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 24 [2018-12-31 04:07:14,071 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 16 [2018-12-31 04:07:16,752 WARN L181 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-12-31 04:07:17,619 WARN L181 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2018-12-31 04:07:18,439 WARN L181 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2018-12-31 04:07:18,633 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2018-12-31 04:07:18,673 INFO L448 ceAbstractionStarter]: For program point L68-3(lines 68 69) no Hoare annotation was computed. [2018-12-31 04:07:18,674 INFO L448 ceAbstractionStarter]: For program point L68-5(lines 68 84) no Hoare annotation was computed. [2018-12-31 04:07:18,674 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 84) no Hoare annotation was computed. [2018-12-31 04:07:18,674 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-12-31 04:07:18,674 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 37) no Hoare annotation was computed. [2018-12-31 04:07:18,674 INFO L448 ceAbstractionStarter]: For program point L69-2(line 69) no Hoare annotation was computed. [2018-12-31 04:07:18,674 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 04:07:18,674 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 04:07:18,674 INFO L451 ceAbstractionStarter]: At program point L86(lines 59 87) the Hoare annotation is: true [2018-12-31 04:07:18,674 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 32) no Hoare annotation was computed. [2018-12-31 04:07:18,677 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2018-12-31 04:07:18,678 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2018-12-31 04:07:18,678 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 39) no Hoare annotation was computed. [2018-12-31 04:07:18,678 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-12-31 04:07:18,678 INFO L448 ceAbstractionStarter]: For program point L80-2(lines 80 83) no Hoare annotation was computed. [2018-12-31 04:07:18,678 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2018-12-31 04:07:18,678 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2018-12-31 04:07:18,678 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-12-31 04:07:18,678 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2018-12-31 04:07:18,679 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)))) [2018-12-31 04:07:18,679 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2018-12-31 04:07:18,679 INFO L448 ceAbstractionStarter]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2018-12-31 04:07:18,679 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))) [2018-12-31 04:07:18,679 INFO L448 ceAbstractionStarter]: For program point L15-7(lines 12 33) no Hoare annotation was computed. [2018-12-31 04:07:18,685 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)))) [2018-12-31 04:07:18,685 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 04:07:18,685 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)))) [2018-12-31 04:07:18,685 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)))) [2018-12-31 04:07:18,686 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))) [2018-12-31 04:07:18,686 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)))) [2018-12-31 04:07:18,686 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|) [2018-12-31 04:07:18,686 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)))))) [2018-12-31 04:07:18,686 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))) [2018-12-31 04:07:18,686 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))))) [2018-12-31 04:07:18,687 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)))) [2018-12-31 04:07:18,687 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-12-31 04:07:18,687 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-12-31 04:07:18,687 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 77) no Hoare annotation was computed. [2018-12-31 04:07:18,687 INFO L448 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2018-12-31 04:07:18,687 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2018-12-31 04:07:18,687 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)))) [2018-12-31 04:07:18,691 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 04:07:18,691 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-12-31 04:07:18,691 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 32) no Hoare annotation was computed. [2018-12-31 04:07:18,691 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 32) no Hoare annotation was computed. [2018-12-31 04:07:18,691 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-12-31 04:07:18,691 INFO L448 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2018-12-31 04:07:18,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:07:18 BoogieIcfgContainer [2018-12-31 04:07:18,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:07:18,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:07:18,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:07:18,739 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:07:18,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:46" (3/4) ... [2018-12-31 04:07:18,745 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 04:07:18,761 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-12-31 04:07:18,762 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 04:07:18,762 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 04:07:18,804 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)) [2018-12-31 04:07:18,805 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) [2018-12-31 04:07:18,808 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)))) [2018-12-31 04:07:18,808 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 [2018-12-31 04:07:18,809 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)) [2018-12-31 04:07:18,809 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)) [2018-12-31 04:07:18,809 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)) [2018-12-31 04:07:18,809 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) [2018-12-31 04:07:18,810 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]))) [2018-12-31 04:07:18,810 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) [2018-12-31 04:07:18,810 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) [2018-12-31 04:07:18,811 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)) [2018-12-31 04:07:18,811 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])) [2018-12-31 04:07:18,858 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:07:18,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:07:18,860 INFO L168 Benchmark]: Toolchain (without parser) took 34003.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -208.5 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2018-12-31 04:07:18,861 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. [2018-12-31 04:07:18,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.38 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:07:18,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.87 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:07:18,863 INFO L168 Benchmark]: Boogie Preprocessor took 120.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-12-31 04:07:18,863 INFO L168 Benchmark]: RCFGBuilder took 875.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-12-31 04:07:18,864 INFO L168 Benchmark]: TraceAbstraction took 32467.30 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 202.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.2 MB). Peak memory consumption was 440.1 MB. Max. memory is 11.5 GB. [2018-12-31 04:07:18,867 INFO L168 Benchmark]: Witness Printer took 120.83 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 11.5 GB. [2018-12-31 04:07:18,871 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 354.38 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 58.87 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 120.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 875.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32467.30 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 202.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.2 MB). Peak memory consumption was 440.1 MB. Max. memory is 11.5 GB. * Witness Printer took 120.83 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 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, 32.3s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 16.3s AutomataDifference, 0.0s DeadEndRemovalTime, 9.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1678 SDtfs, 1884 SDslu, 4730 SDs, 0 SdLazy, 1822 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 782 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 10.1s 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.6s HoareSimplificationTime, 14 FomulaSimplificationsInter, 10706 FormulaSimplificationTreeSizeReductionInter, 8.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 685 NumberOfCodeBlocks, 685 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 68324 SizeOfPredicates, 161 NumberOfNonLiveVariables, 1979 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...