./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/double_req_bl_1251b_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 26bba4d307ba1cab1a3fe043c826d85928a7cf56 ........................................................................................................................................................................................................................................................................................................................................................................................... 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/double_req_bl_1251b_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 26bba4d307ba1cab1a3fe043c826d85928a7cf56 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 17:56:42,159 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 17:56:42,160 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 17:56:42,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 17:56:42,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 17:56:42,176 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 17:56:42,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 17:56:42,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 17:56:42,181 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 17:56:42,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 17:56:42,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 17:56:42,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 17:56:42,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 17:56:42,188 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 17:56:42,190 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 17:56:42,190 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 17:56:42,192 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 17:56:42,194 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 17:56:42,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 17:56:42,201 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 17:56:42,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 17:56:42,203 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 17:56:42,209 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 17:56:42,210 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 17:56:42,211 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 17:56:42,214 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 17:56:42,216 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 17:56:42,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 17:56:42,222 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 17:56:42,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 17:56:42,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 17:56:42,226 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 17:56:42,226 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 17:56:42,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 17:56:42,227 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 17:56:42,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 17:56:42,229 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 17:56:42,244 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 17:56:42,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 17:56:42,245 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 17:56:42,245 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 17:56:42,247 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 17:56:42,247 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 17:56:42,247 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 17:56:42,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 17:56:42,247 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 17:56:42,248 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 17:56:42,248 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 17:56:42,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 17:56:42,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 17:56:42,249 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 17:56:42,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 17:56:42,249 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 17:56:42,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 17:56:42,250 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 17:56:42,250 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 17:56:42,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 17:56:42,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 17:56:42,250 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 17:56:42,251 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 17:56:42,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 17:56:42,252 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 17:56:42,253 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 17:56:42,253 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 17:56:42,253 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 17:56:42,253 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 17:56:42,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 17:56:42,254 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 -> 26bba4d307ba1cab1a3fe043c826d85928a7cf56 [2018-11-28 17:56:42,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 17:56:42,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 17:56:42,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 17:56:42,311 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 17:56:42,311 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 17:56:42,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-11-28 17:56:42,376 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a464cf595/0b911a7472f642eb876b3f04fd0f86ea/FLAGd1e5fc29e [2018-11-28 17:56:42,853 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 17:56:42,854 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-11-28 17:56:42,861 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a464cf595/0b911a7472f642eb876b3f04fd0f86ea/FLAGd1e5fc29e [2018-11-28 17:56:43,223 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a464cf595/0b911a7472f642eb876b3f04fd0f86ea [2018-11-28 17:56:43,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 17:56:43,228 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 17:56:43,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 17:56:43,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 17:56:43,233 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 17:56:43,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:56:43" (1/1) ... [2018-11-28 17:56:43,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43, skipping insertion in model container [2018-11-28 17:56:43,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:56:43" (1/1) ... [2018-11-28 17:56:43,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 17:56:43,273 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 17:56:43,513 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 17:56:43,518 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 17:56:43,549 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 17:56:43,580 INFO L195 MainTranslator]: Completed translation [2018-11-28 17:56:43,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43 WrapperNode [2018-11-28 17:56:43,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 17:56:43,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 17:56:43,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 17:56:43,583 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 17:56:43,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43" (1/1) ... [2018-11-28 17:56:43,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43" (1/1) ... [2018-11-28 17:56:43,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 17:56:43,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 17:56:43,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 17:56:43,614 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 17:56:43,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43" (1/1) ... [2018-11-28 17:56:43,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43" (1/1) ... [2018-11-28 17:56:43,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43" (1/1) ... [2018-11-28 17:56:43,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43" (1/1) ... [2018-11-28 17:56:43,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43" (1/1) ... [2018-11-28 17:56:43,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43" (1/1) ... [2018-11-28 17:56:43,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43" (1/1) ... [2018-11-28 17:56:43,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 17:56:43,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 17:56:43,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 17:56:43,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 17:56:43,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43" (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-11-28 17:56:43,807 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-28 17:56:43,808 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-28 17:56:43,809 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 17:56:43,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 17:56:43,810 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-28 17:56:43,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-28 17:56:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 17:56:43,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 17:56:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-11-28 17:56:43,811 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-11-28 17:56:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-28 17:56:43,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 17:56:43,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 17:56:43,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 17:56:43,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 17:56:43,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 17:56:44,341 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 17:56:44,342 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 17:56:44,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:56:44 BoogieIcfgContainer [2018-11-28 17:56:44,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 17:56:44,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 17:56:44,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 17:56:44,347 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 17:56:44,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:56:43" (1/3) ... [2018-11-28 17:56:44,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf6fb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:56:44, skipping insertion in model container [2018-11-28 17:56:44,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:43" (2/3) ... [2018-11-28 17:56:44,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf6fb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:56:44, skipping insertion in model container [2018-11-28 17:56:44,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:56:44" (3/3) ... [2018-11-28 17:56:44,351 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b_true-unreach-call.c [2018-11-28 17:56:44,361 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 17:56:44,370 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 17:56:44,391 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 17:56:44,425 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 17:56:44,426 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 17:56:44,426 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 17:56:44,426 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 17:56:44,427 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 17:56:44,427 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 17:56:44,427 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 17:56:44,427 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 17:56:44,427 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 17:56:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-28 17:56:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 17:56:44,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:44,459 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-11-28 17:56:44,461 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:44,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:44,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2032926079, now seen corresponding path program 1 times [2018-11-28 17:56:44,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:56:44,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:56:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:56:44,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:44,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:56:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:56:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:56:44,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:56:44,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 17:56:44,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 17:56:44,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 17:56:44,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 17:56:44,677 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-28 17:56:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:56:44,708 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2018-11-28 17:56:44,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 17:56:44,709 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-28 17:56:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:56:44,722 INFO L225 Difference]: With dead ends: 69 [2018-11-28 17:56:44,722 INFO L226 Difference]: Without dead ends: 37 [2018-11-28 17:56:44,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 17:56:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-28 17:56:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-28 17:56:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 17:56:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-28 17:56:44,779 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 27 [2018-11-28 17:56:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:56:44,780 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-28 17:56:44,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 17:56:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-28 17:56:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 17:56:44,783 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:44,783 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-11-28 17:56:44,783 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:44,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:44,784 INFO L82 PathProgramCache]: Analyzing trace with hash 544472172, now seen corresponding path program 1 times [2018-11-28 17:56:44,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:56:44,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:56:44,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:56:44,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:56:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:56:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:56:45,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:56:45,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:56:45,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:56:45,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:56:45,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:45,029 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 4 states. [2018-11-28 17:56:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:56:45,102 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-28 17:56:45,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 17:56:45,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-28 17:56:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:56:45,106 INFO L225 Difference]: With dead ends: 47 [2018-11-28 17:56:45,106 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 17:56:45,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 17:56:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 17:56:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 17:56:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-28 17:56:45,120 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2018-11-28 17:56:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:56:45,120 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-28 17:56:45,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:56:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-28 17:56:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 17:56:45,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:45,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, 1, 1, 1, 1] [2018-11-28 17:56:45,122 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:45,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:45,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2058062536, now seen corresponding path program 1 times [2018-11-28 17:56:45,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:56:45,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:56:45,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:56:45,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:45,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:56:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:56:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:56:45,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:56:45,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:56:45,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:56:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:56:45,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:45,251 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 4 states. [2018-11-28 17:56:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:56:45,323 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-28 17:56:45,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 17:56:45,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-28 17:56:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:56:45,326 INFO L225 Difference]: With dead ends: 51 [2018-11-28 17:56:45,326 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 17:56:45,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 17:56:45,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-28 17:56:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 17:56:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-28 17:56:45,336 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 31 [2018-11-28 17:56:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:56:45,336 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-28 17:56:45,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:56:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-28 17:56:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 17:56:45,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:45,338 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] [2018-11-28 17:56:45,338 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:45,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:45,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2040391255, now seen corresponding path program 1 times [2018-11-28 17:56:45,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 17:56:45,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 17:56:45,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:56:45,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:45,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 17:56:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 17:56:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 17:56:45,445 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 17:56:45,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:56:45 BoogieIcfgContainer [2018-11-28 17:56:45,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 17:56:45,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 17:56:45,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 17:56:45,480 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 17:56:45,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:56:44" (3/4) ... [2018-11-28 17:56:45,484 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 17:56:45,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 17:56:45,485 INFO L168 Benchmark]: Toolchain (without parser) took 2258.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -113.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-28 17:56:45,487 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 17:56:45,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.72 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 17:56:45,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.04 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 17:56:45,489 INFO L168 Benchmark]: Boogie Preprocessor took 122.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -201.5 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 17:56:45,490 INFO L168 Benchmark]: RCFGBuilder took 606.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-11-28 17:56:45,491 INFO L168 Benchmark]: TraceAbstraction took 1136.24 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: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2018-11-28 17:56:45,492 INFO L168 Benchmark]: Witness Printer took 4.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 17:56:45,497 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.72 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.04 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 122.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -201.5 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 606.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1136.24 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: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 78]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 65. Possible FailurePath: [L64] double x = __VERIFIER_nondet_double(); [L65] double y = 0.0 / 0.0; VAL [x=4294967300] [L72] CALL, EXPR isnan_double(x) VAL [\old(x)=4294967300] [L16] return x != x; VAL [\old(x)=4294967300, \result=0, x=4294967300] [L72] RET, EXPR isnan_double(x) VAL [isnan_double(x)=0, x=4294967300] [L72] COND TRUE !isnan_double(x) [L74] CALL, EXPR fmax_double(x, y) VAL [\old(x)=4294967300, \old(y)=4294967302] [L55] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967300] [L27] __uint32_t msw, lsw; VAL [\old(x)=4294967300, x=4294967300] [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967300, lsw=4294967297, msw=2146435073, x=4294967300] [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967300, lsw=4294967297, msw=2146435073, x=4294967300] [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967300, lsw=4294967297, msw=2146435073, x=4294967300] [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; VAL [\old(x)=4294967300, \result=0, lsw=4294967297, msw=2146435073, x=4294967300] [L55] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967300, \old(y)=4294967302, __fpclassify_double(x)=0, x=4294967300, y=4294967302] [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; VAL [\old(x)=4294967300, \old(y)=4294967302, \result=4294967302, x=4294967300, y=4294967302] [L74] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=4294967302, x=4294967300, y=4294967302] [L74] double res = fmax_double(x, y); [L77] COND TRUE res != x VAL [res=4294967302, x=4294967300, y=4294967302] [L78] __VERIFIER_error() VAL [res=4294967302, x=4294967300, y=4294967302] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 139 SDtfs, 0 SDslu, 162 SDs, 0 SdLazy, 21 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 2761 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-91b1670 [2018-11-28 17:56:47,938 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 17:56:47,940 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 17:56:47,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 17:56:47,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 17:56:47,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 17:56:47,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 17:56:47,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 17:56:47,967 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 17:56:47,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 17:56:47,976 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 17:56:47,976 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 17:56:47,978 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 17:56:47,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 17:56:47,982 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 17:56:47,983 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 17:56:47,983 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 17:56:47,990 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 17:56:47,993 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 17:56:47,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 17:56:47,996 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 17:56:47,998 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 17:56:48,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 17:56:48,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 17:56:48,003 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 17:56:48,005 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 17:56:48,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 17:56:48,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 17:56:48,009 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 17:56:48,011 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 17:56:48,011 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 17:56:48,012 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 17:56:48,012 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 17:56:48,012 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 17:56:48,014 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 17:56:48,015 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 17:56:48,015 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-28 17:56:48,038 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 17:56:48,038 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 17:56:48,040 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 17:56:48,040 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 17:56:48,041 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 17:56:48,041 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 17:56:48,041 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 17:56:48,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 17:56:48,041 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 17:56:48,041 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 17:56:48,043 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 17:56:48,043 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 17:56:48,043 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 17:56:48,043 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 17:56:48,043 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 17:56:48,043 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 17:56:48,044 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 17:56:48,044 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 17:56:48,045 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 17:56:48,045 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 17:56:48,045 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 17:56:48,045 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 17:56:48,045 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 17:56:48,046 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 17:56:48,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 17:56:48,046 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 17:56:48,046 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 17:56:48,046 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 17:56:48,046 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 17:56:48,047 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 17:56:48,047 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 17:56:48,047 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-28 17:56:48,047 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 -> 26bba4d307ba1cab1a3fe043c826d85928a7cf56 [2018-11-28 17:56:48,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 17:56:48,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 17:56:48,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 17:56:48,119 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 17:56:48,119 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 17:56:48,121 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-11-28 17:56:48,190 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98d91c880/68db1253f4ab40f6aea9c02fe7be0198/FLAG3b763982d [2018-11-28 17:56:48,695 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 17:56:48,696 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-11-28 17:56:48,704 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98d91c880/68db1253f4ab40f6aea9c02fe7be0198/FLAG3b763982d [2018-11-28 17:56:49,063 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98d91c880/68db1253f4ab40f6aea9c02fe7be0198 [2018-11-28 17:56:49,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 17:56:49,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 17:56:49,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 17:56:49,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 17:56:49,078 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 17:56:49,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:56:49" (1/1) ... [2018-11-28 17:56:49,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a15a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49, skipping insertion in model container [2018-11-28 17:56:49,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:56:49" (1/1) ... [2018-11-28 17:56:49,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 17:56:49,119 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 17:56:49,315 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 17:56:49,321 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 17:56:49,352 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 17:56:49,388 INFO L195 MainTranslator]: Completed translation [2018-11-28 17:56:49,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49 WrapperNode [2018-11-28 17:56:49,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 17:56:49,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 17:56:49,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 17:56:49,390 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 17:56:49,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49" (1/1) ... [2018-11-28 17:56:49,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49" (1/1) ... [2018-11-28 17:56:49,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 17:56:49,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 17:56:49,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 17:56:49,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 17:56:49,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49" (1/1) ... [2018-11-28 17:56:49,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49" (1/1) ... [2018-11-28 17:56:49,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49" (1/1) ... [2018-11-28 17:56:49,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49" (1/1) ... [2018-11-28 17:56:49,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49" (1/1) ... [2018-11-28 17:56:49,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49" (1/1) ... [2018-11-28 17:56:49,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49" (1/1) ... [2018-11-28 17:56:49,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 17:56:49,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 17:56:49,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 17:56:49,468 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 17:56:49,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49" (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-11-28 17:56:49,595 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-28 17:56:49,595 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-28 17:56:49,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-28 17:56:49,595 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 17:56:49,595 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 17:56:49,595 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-28 17:56:49,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-28 17:56:49,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 17:56:49,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 17:56:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-11-28 17:56:49,597 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-11-28 17:56:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 17:56:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-28 17:56:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 17:56:49,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 17:56:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 17:56:49,813 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 17:56:50,129 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 17:56:50,130 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 17:56:50,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:56:50 BoogieIcfgContainer [2018-11-28 17:56:50,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 17:56:50,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 17:56:50,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 17:56:50,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 17:56:50,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:56:49" (1/3) ... [2018-11-28 17:56:50,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae1f14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:56:50, skipping insertion in model container [2018-11-28 17:56:50,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:56:49" (2/3) ... [2018-11-28 17:56:50,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae1f14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:56:50, skipping insertion in model container [2018-11-28 17:56:50,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:56:50" (3/3) ... [2018-11-28 17:56:50,141 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b_true-unreach-call.c [2018-11-28 17:56:50,152 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 17:56:50,161 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 17:56:50,180 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 17:56:50,224 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 17:56:50,225 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 17:56:50,225 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 17:56:50,226 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 17:56:50,228 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 17:56:50,228 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 17:56:50,228 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 17:56:50,228 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 17:56:50,228 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 17:56:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-28 17:56:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 17:56:50,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:50,254 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-11-28 17:56:50,256 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:50,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:50,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1614855583, now seen corresponding path program 1 times [2018-11-28 17:56:50,266 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:56:50,267 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-11-28 17:56:50,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:56:50,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:56:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:56:50,384 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:56:50,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:56:50,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 17:56:50,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 17:56:50,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 17:56:50,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 17:56:50,419 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-28 17:56:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:56:50,451 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2018-11-28 17:56:50,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 17:56:50,453 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-28 17:56:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:56:50,465 INFO L225 Difference]: With dead ends: 64 [2018-11-28 17:56:50,465 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 17:56:50,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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-11-28 17:56:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 17:56:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-28 17:56:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 17:56:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-28 17:56:50,519 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 25 [2018-11-28 17:56:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:56:50,520 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-28 17:56:50,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 17:56:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-28 17:56:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 17:56:50,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:50,522 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-11-28 17:56:50,523 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:50,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash 756047800, now seen corresponding path program 1 times [2018-11-28 17:56:50,524 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:56:50,524 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-11-28 17:56:50,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:56:50,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:56:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:56:50,719 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:56:50,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:56:50,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:56:50,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:56:50,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:56:50,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:50,740 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-11-28 17:56:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:56:50,831 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-28 17:56:50,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 17:56:50,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-28 17:56:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:56:50,835 INFO L225 Difference]: With dead ends: 43 [2018-11-28 17:56:50,835 INFO L226 Difference]: Without dead ends: 37 [2018-11-28 17:56:50,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-28 17:56:50,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-28 17:56:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 17:56:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-28 17:56:50,847 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 26 [2018-11-28 17:56:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:56:50,848 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-28 17:56:50,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:56:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-28 17:56:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 17:56:50,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:50,850 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-11-28 17:56:50,850 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:50,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:50,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1333859716, now seen corresponding path program 1 times [2018-11-28 17:56:50,851 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:56:50,851 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-11-28 17:56:50,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:56:50,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:56:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:56:51,105 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:56:51,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:56:51,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:56:51,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:56:51,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:56:51,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:51,123 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-28 17:56:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:56:51,192 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-28 17:56:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 17:56:51,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-28 17:56:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:56:51,198 INFO L225 Difference]: With dead ends: 46 [2018-11-28 17:56:51,198 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 17:56:51,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 17:56:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-28 17:56:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 17:56:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-28 17:56:51,209 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 27 [2018-11-28 17:56:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:56:51,210 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-28 17:56:51,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:56:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-28 17:56:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 17:56:51,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:51,212 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-11-28 17:56:51,213 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:51,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:51,213 INFO L82 PathProgramCache]: Analyzing trace with hash -868690628, now seen corresponding path program 1 times [2018-11-28 17:56:51,214 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:56:51,214 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-11-28 17:56:51,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:56:51,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:56:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:56:51,395 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:56:51,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:56:51,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:56:51,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:56:51,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:56:51,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:51,415 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-28 17:56:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:56:51,567 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-28 17:56:51,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 17:56:51,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-28 17:56:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:56:51,569 INFO L225 Difference]: With dead ends: 46 [2018-11-28 17:56:51,569 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 17:56:51,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 17:56:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-28 17:56:51,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 17:56:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-28 17:56:51,578 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 28 [2018-11-28 17:56:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:56:51,578 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-28 17:56:51,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:56:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-28 17:56:51,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 17:56:51,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:51,580 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] [2018-11-28 17:56:51,580 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:51,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:51,581 INFO L82 PathProgramCache]: Analyzing trace with hash 931842184, now seen corresponding path program 1 times [2018-11-28 17:56:51,581 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:56:51,581 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-28 17:56:51,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:56:51,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:56:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:56:51,729 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:56:51,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:56:51,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:56:51,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:56:51,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:56:51,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:51,751 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-28 17:56:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:56:51,864 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-28 17:56:51,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 17:56:51,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-28 17:56:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:56:51,866 INFO L225 Difference]: With dead ends: 46 [2018-11-28 17:56:51,866 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 17:56:51,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 17:56:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-28 17:56:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 17:56:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-28 17:56:51,874 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 29 [2018-11-28 17:56:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:56:51,874 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-28 17:56:51,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:56:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-28 17:56:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 17:56:51,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:51,876 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] [2018-11-28 17:56:51,876 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:51,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:51,876 INFO L82 PathProgramCache]: Analyzing trace with hash -875612279, now seen corresponding path program 1 times [2018-11-28 17:56:51,877 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:56:51,877 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-11-28 17:56:51,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:56:51,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:56:52,168 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 17:56:52,170 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 17:56:52,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-28 17:56:52,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-28 17:56:52,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 17:56:52,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-28 17:56:52,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-28 17:56:52,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 17:56:52,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 17:56:52,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 17:56:52,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 17:56:52,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-28 17:56:53,272 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-11-28 17:56:53,515 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2018-11-28 17:56:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 17:56:53,912 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:56:53,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:56:53,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 17:56:53,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 17:56:53,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 17:56:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-28 17:56:53,931 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 12 states. [2018-11-28 17:56:54,827 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 17:56:57,646 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2018-11-28 17:56:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:56:58,576 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-28 17:56:58,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 17:56:58,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-28 17:56:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:56:58,580 INFO L225 Difference]: With dead ends: 54 [2018-11-28 17:56:58,580 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 17:56:58,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-11-28 17:56:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 17:56:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-11-28 17:56:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 17:56:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-28 17:56:58,588 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 29 [2018-11-28 17:56:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:56:58,589 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-28 17:56:58,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 17:56:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-28 17:56:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 17:56:58,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:58,592 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-11-28 17:56:58,592 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:58,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash 771770225, now seen corresponding path program 1 times [2018-11-28 17:56:58,593 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:56:58,593 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-11-28 17:56:58,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:56:58,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:56:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 17:56:58,720 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:56:58,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:56:58,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:56:58,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:56:58,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:56:58,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:58,732 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 4 states. [2018-11-28 17:56:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:56:58,768 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-28 17:56:58,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 17:56:58,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-28 17:56:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:56:58,770 INFO L225 Difference]: With dead ends: 45 [2018-11-28 17:56:58,770 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 17:56:58,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 17:56:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 17:56:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 17:56:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-28 17:56:58,778 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 34 [2018-11-28 17:56:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:56:58,779 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-28 17:56:58,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:56:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-28 17:56:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 17:56:58,781 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:58,781 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-11-28 17:56:58,782 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:58,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:58,782 INFO L82 PathProgramCache]: Analyzing trace with hash 111236229, now seen corresponding path program 1 times [2018-11-28 17:56:58,782 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:56:58,782 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-28 17:56:58,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:56:58,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:56:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 17:56:58,894 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:56:58,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:56:58,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:56:58,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:56:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:56:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:58,910 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 4 states. [2018-11-28 17:56:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:56:58,972 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-28 17:56:58,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 17:56:58,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-28 17:56:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:56:58,974 INFO L225 Difference]: With dead ends: 48 [2018-11-28 17:56:58,974 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 17:56:58,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:56:58,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 17:56:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-28 17:56:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 17:56:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-28 17:56:58,983 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 35 [2018-11-28 17:56:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:56:58,983 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-28 17:56:58,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:56:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-28 17:56:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 17:56:58,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:56:58,986 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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-11-28 17:56:58,986 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:56:58,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:56:58,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1035078318, now seen corresponding path program 1 times [2018-11-28 17:56:58,988 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:56:58,988 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-11-28 17:56:58,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:56:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:56:59,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:56:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 17:56:59,428 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:56:59,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:56:59,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 17:56:59,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 17:56:59,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 17:56:59,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 17:56:59,444 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 8 states. [2018-11-28 17:57:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:57:00,399 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-28 17:57:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 17:57:00,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-11-28 17:57:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:57:00,402 INFO L225 Difference]: With dead ends: 50 [2018-11-28 17:57:00,402 INFO L226 Difference]: Without dead ends: 41 [2018-11-28 17:57:00,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 17:57:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-28 17:57:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-28 17:57:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 17:57:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-28 17:57:00,409 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 36 [2018-11-28 17:57:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:57:00,410 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-28 17:57:00,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 17:57:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-28 17:57:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 17:57:00,412 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:57:00,412 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-11-28 17:57:00,413 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:57:00,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:57:00,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1825331723, now seen corresponding path program 1 times [2018-11-28 17:57:00,414 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:57:00,414 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-11-28 17:57:00,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-28 17:57:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:57:00,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:57:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 17:57:00,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:57:00,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:57:00,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:57:00,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:57:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:57:00,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:57:00,548 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 4 states. [2018-11-28 17:57:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:57:00,585 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-28 17:57:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 17:57:00,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-28 17:57:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:57:00,587 INFO L225 Difference]: With dead ends: 50 [2018-11-28 17:57:00,587 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 17:57:00,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:57:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 17:57:00,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-28 17:57:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 17:57:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-28 17:57:00,595 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 36 [2018-11-28 17:57:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:57:00,596 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-28 17:57:00,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:57:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-28 17:57:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 17:57:00,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:57:00,598 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-11-28 17:57:00,598 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:57:00,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:57:00,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1917067970, now seen corresponding path program 1 times [2018-11-28 17:57:00,600 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:57:00,600 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-11-28 17:57:00,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:57:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:57:00,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:57:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 17:57:01,124 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:57:01,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:57:01,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 17:57:01,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 17:57:01,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 17:57:01,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 17:57:01,143 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 8 states. [2018-11-28 17:57:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:57:05,421 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-28 17:57:05,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 17:57:05,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-28 17:57:05,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:57:05,423 INFO L225 Difference]: With dead ends: 52 [2018-11-28 17:57:05,423 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 17:57:05,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 17:57:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 17:57:05,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-28 17:57:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 17:57:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-28 17:57:05,431 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 37 [2018-11-28 17:57:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:57:05,433 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-28 17:57:05,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 17:57:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-28 17:57:05,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 17:57:05,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:57:05,435 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-11-28 17:57:05,435 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:57:05,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:57:05,435 INFO L82 PathProgramCache]: Analyzing trace with hash -369279351, now seen corresponding path program 1 times [2018-11-28 17:57:05,436 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:57:05,437 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-11-28 17:57:05,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:57:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:57:05,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:57:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 17:57:05,605 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:57:05,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:57:05,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:57:05,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:57:05,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:57:05,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:57:05,618 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 4 states. [2018-11-28 17:57:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:57:05,653 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-28 17:57:05,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 17:57:05,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-28 17:57:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:57:05,655 INFO L225 Difference]: With dead ends: 48 [2018-11-28 17:57:05,655 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 17:57:05,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:57:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 17:57:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-28 17:57:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 17:57:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-28 17:57:05,662 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 37 [2018-11-28 17:57:05,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:57:05,664 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-28 17:57:05,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:57:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-28 17:57:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 17:57:05,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:57:05,666 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-11-28 17:57:05,666 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:57:05,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:57:05,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2118233482, now seen corresponding path program 1 times [2018-11-28 17:57:05,667 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:57:05,667 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-11-28 17:57:05,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:57:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:57:05,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:57:06,511 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 17:57:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 17:57:06,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 17:57:06,939 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 17:57:07,196 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 17:57:07,362 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 17:57:07,486 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 17:57:08,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 17:57:08,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 17:57:08,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:57:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:57:08,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:57:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 17:57:09,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 17:57:09,654 WARN L180 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 17:57:12,210 WARN L180 SmtUtils]: Spent 2.56 s on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 17:57:12,653 WARN L180 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 17:57:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 17:57:13,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-28 17:57:13,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 22 [2018-11-28 17:57:13,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 17:57:13,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 17:57:13,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-11-28 17:57:13,796 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 22 states. [2018-11-28 17:57:17,031 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-11-28 17:57:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:57:17,300 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-28 17:57:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 17:57:17,301 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-11-28 17:57:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:57:17,302 INFO L225 Difference]: With dead ends: 59 [2018-11-28 17:57:17,302 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 17:57:17,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2018-11-28 17:57:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 17:57:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2018-11-28 17:57:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 17:57:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-28 17:57:17,310 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 37 [2018-11-28 17:57:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:57:17,310 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-28 17:57:17,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 17:57:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-28 17:57:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 17:57:17,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:57:17,313 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-11-28 17:57:17,314 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:57:17,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:57:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash 596105266, now seen corresponding path program 1 times [2018-11-28 17:57:17,315 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:57:17,315 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-11-28 17:57:17,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:57:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:57:17,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:57:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 17:57:17,636 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:57:17,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:57:17,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 17:57:17,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 17:57:17,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 17:57:17,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 17:57:17,648 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 8 states. [2018-11-28 17:57:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:57:19,093 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-28 17:57:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 17:57:19,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-28 17:57:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:57:19,096 INFO L225 Difference]: With dead ends: 51 [2018-11-28 17:57:19,096 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 17:57:19,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 17:57:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 17:57:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-28 17:57:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 17:57:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-28 17:57:19,104 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 38 [2018-11-28 17:57:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:57:19,106 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-28 17:57:19,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 17:57:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-28 17:57:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 17:57:19,108 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:57:19,108 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-11-28 17:57:19,108 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:57:19,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:57:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash -296903738, now seen corresponding path program 1 times [2018-11-28 17:57:19,109 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:57:19,109 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-11-28 17:57:19,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:57:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:57:19,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:57:19,284 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 17:57:19,286 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 17:57:19,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-28 17:57:19,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-28 17:57:19,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 17:57:19,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 17:57:19,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-28 17:57:19,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 17:57:19,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 17:57:19,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 17:57:19,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 17:57:19,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-28 17:57:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 17:57:19,692 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:57:19,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:57:19,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 17:57:19,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 17:57:19,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 17:57:19,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 17:57:19,709 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 8 states. [2018-11-28 17:57:20,493 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 17:57:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:57:20,852 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-28 17:57:20,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 17:57:20,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-28 17:57:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:57:20,855 INFO L225 Difference]: With dead ends: 47 [2018-11-28 17:57:20,855 INFO L226 Difference]: Without dead ends: 38 [2018-11-28 17:57:20,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-28 17:57:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-28 17:57:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-28 17:57:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 17:57:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-28 17:57:20,860 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 39 [2018-11-28 17:57:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:57:20,861 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-28 17:57:20,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 17:57:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-28 17:57:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 17:57:20,861 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 17:57:20,862 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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-11-28 17:57:20,862 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 17:57:20,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 17:57:20,862 INFO L82 PathProgramCache]: Analyzing trace with hash -2093855097, now seen corresponding path program 1 times [2018-11-28 17:57:20,862 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 17:57:20,866 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-11-28 17:57:20,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 17:57:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 17:57:20,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 17:57:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 17:57:20,997 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 17:57:21,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 17:57:21,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 17:57:21,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 17:57:21,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 17:57:21,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:57:21,008 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 4 states. [2018-11-28 17:57:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 17:57:21,018 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-28 17:57:21,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 17:57:21,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-28 17:57:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 17:57:21,021 INFO L225 Difference]: With dead ends: 36 [2018-11-28 17:57:21,021 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 17:57:21,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 17:57:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 17:57:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 17:57:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 17:57:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 17:57:21,027 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-11-28 17:57:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 17:57:21,027 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 17:57:21,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 17:57:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 17:57:21,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 17:57:21,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 17:57:21,392 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 17:57:21,474 INFO L451 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 16) the Hoare annotation is: true [2018-11-28 17:57:21,474 INFO L448 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 16) no Hoare annotation was computed. [2018-11-28 17:57:21,474 INFO L448 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 16) no Hoare annotation was computed. [2018-11-28 17:57:21,474 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 34) no Hoare annotation was computed. [2018-11-28 17:57:21,475 INFO L444 ceAbstractionStarter]: At program point L29-2(lines 29 34) the Hoare annotation is: (= |__fpclassify_double_#in~x| __fpclassify_double_~x) [2018-11-28 17:57:21,475 INFO L448 ceAbstractionStarter]: For program point __fpclassify_doubleFINAL(lines 26 51) no Hoare annotation was computed. [2018-11-28 17:57:21,475 INFO L448 ceAbstractionStarter]: For program point L29-3(lines 26 51) no Hoare annotation was computed. [2018-11-28 17:57:21,475 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 50) no Hoare annotation was computed. [2018-11-28 17:57:21,475 INFO L451 ceAbstractionStarter]: At program point __fpclassify_doubleENTRY(lines 26 51) the Hoare annotation is: true [2018-11-28 17:57:21,475 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-11-28 17:57:21,475 INFO L448 ceAbstractionStarter]: For program point __fpclassify_doubleEXIT(lines 26 51) no Hoare annotation was computed. [2018-11-28 17:57:21,475 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 50) no Hoare annotation was computed. [2018-11-28 17:57:21,475 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 17:57:21,475 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-28 17:57:21,475 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 17:57:21,476 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-28 17:57:21,476 INFO L448 ceAbstractionStarter]: For program point L60-2(line 60) no Hoare annotation was computed. [2018-11-28 17:57:21,476 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= fmax_double_~x |fmax_double_#in~x|))) (or (and .cse0 (exists ((v_prenex_24 (_ BitVec 64))) (let ((.cse1 ((_ extract 63 32) v_prenex_24))) (and (not (bvule .cse1 (_ bv2146435071 32))) (= (fp ((_ extract 63 63) v_prenex_24) ((_ extract 62 52) v_prenex_24) ((_ extract 51 0) v_prenex_24)) |fmax_double_#in~x|) (not (= ((_ extract 31 0) v_prenex_24) (_ bv0 32))) (not (bvuge .cse1 (_ bv2147483648 32))))))) (and .cse0 (= fmax_double_~y |fmax_double_#in~y|)))) [2018-11-28 17:57:21,476 INFO L451 ceAbstractionStarter]: At program point fmax_doubleENTRY(lines 53 61) the Hoare annotation is: true [2018-11-28 17:57:21,476 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 57 58) no Hoare annotation was computed. [2018-11-28 17:57:21,476 INFO L444 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (and (= fmax_double_~x |fmax_double_#in~x|) (= fmax_double_~y |fmax_double_#in~y|)) [2018-11-28 17:57:21,476 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 55 56) no Hoare annotation was computed. [2018-11-28 17:57:21,476 INFO L448 ceAbstractionStarter]: For program point fmax_doubleFINAL(lines 53 61) no Hoare annotation was computed. [2018-11-28 17:57:21,476 INFO L448 ceAbstractionStarter]: For program point fmax_doubleEXIT(lines 53 61) no Hoare annotation was computed. [2018-11-28 17:57:21,476 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 17:57:21,477 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 17:57:21,477 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 17:57:21,477 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 17:57:21,477 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 63 84) the Hoare annotation is: true [2018-11-28 17:57:21,477 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 63 84) no Hoare annotation was computed. [2018-11-28 17:57:21,477 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 78) no Hoare annotation was computed. [2018-11-28 17:57:21,477 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-28 17:57:21,477 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 80) no Hoare annotation was computed. [2018-11-28 17:57:21,477 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 63 84) no Hoare annotation was computed. [2018-11-28 17:57:21,478 INFO L444 ceAbstractionStarter]: At program point L74(line 74) the Hoare annotation is: (and (= main_~y~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) (fp.eq main_~x~0 main_~x~0)) [2018-11-28 17:57:21,478 INFO L448 ceAbstractionStarter]: For program point L74-1(line 74) no Hoare annotation was computed. [2018-11-28 17:57:21,478 INFO L444 ceAbstractionStarter]: At program point L72(line 72) the Hoare annotation is: (= main_~y~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) [2018-11-28 17:57:21,478 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 72 81) no Hoare annotation was computed. [2018-11-28 17:57:21,478 INFO L448 ceAbstractionStarter]: For program point L72-3(lines 72 81) no Hoare annotation was computed. [2018-11-28 17:57:21,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:57:21 BoogieIcfgContainer [2018-11-28 17:57:21,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 17:57:21,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 17:57:21,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 17:57:21,493 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 17:57:21,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:56:50" (3/4) ... [2018-11-28 17:57:21,497 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 17:57:21,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-11-28 17:57:21,505 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2018-11-28 17:57:21,506 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 17:57:21,506 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmax_double [2018-11-28 17:57:21,506 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 17:57:21,514 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-28 17:57:21,514 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 17:57:21,514 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 17:57:21,544 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-28 17:57:21,574 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 17:57:21,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 17:57:21,580 INFO L168 Benchmark]: Toolchain (without parser) took 32511.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 259.5 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -244.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-28 17:57:21,582 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-11-28 17:57:21,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.46 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-11-28 17:57:21,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.97 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 17:57:21,584 INFO L168 Benchmark]: Boogie Preprocessor took 43.09 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 17:57:21,586 INFO L168 Benchmark]: RCFGBuilder took 663.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-28 17:57:21,590 INFO L168 Benchmark]: TraceAbstraction took 31360.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -105.0 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-28 17:57:21,591 INFO L168 Benchmark]: Witness Printer took 86.85 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-28 17:57:21,599 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 318.46 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 34.97 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.09 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 663.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31360.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -105.0 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Witness Printer took 86.85 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 78]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. SAFE Result, 31.2s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 16.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 572 SDtfs, 229 SDslu, 1537 SDs, 0 SdLazy, 849 SolverSat, 8 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 637 GetRequests, 538 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 41 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 18 PreInvPairs, 23 NumberOfFragments, 71 HoareAnnotationTreeSize, 18 FomulaSimplifications, 53 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 569 NumberOfCodeBlocks, 569 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 588 ConstructedInterpolants, 63 QuantifiedInterpolants, 100392 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1670 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 66/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...