/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1280_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 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 ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1280_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 8f03b8664db42073daadcd6b28aafc757b6f7be2 ........................................................................................................................................................................................................................................................................................................ 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 ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1280_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 8f03b8664db42073daadcd6b28aafc757b6f7be2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:32:19,228 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:32:19,230 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:32:19,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:32:19,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:32:19,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:32:19,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:32:19,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:32:19,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:32:19,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:32:19,251 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:32:19,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:32:19,253 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:32:19,254 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:32:19,255 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:32:19,256 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:32:19,257 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:32:19,259 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:32:19,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:32:19,263 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:32:19,264 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:32:19,265 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:32:19,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:32:19,268 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:32:19,269 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:32:19,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:32:19,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:32:19,272 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:32:19,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:32:19,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:32:19,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:32:19,275 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:32:19,276 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:32:19,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:32:19,277 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:32:19,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:32:19,278 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:32:19,293 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:32:19,294 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:32:19,295 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:32:19,295 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:32:19,295 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:32:19,296 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:32:19,296 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:32:19,296 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:32:19,296 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:32:19,296 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:32:19,297 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:32:19,297 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:32:19,297 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:32:19,297 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:32:19,297 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:32:19,299 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:32:19,299 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:32:19,299 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:32:19,299 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:32:19,299 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:32:19,300 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:32:19,300 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:32:19,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:32:19,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:32:19,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:32:19,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:32:19,302 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:32:19,302 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:32:19,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:32:19,303 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 -> 8f03b8664db42073daadcd6b28aafc757b6f7be2 [2018-09-20 15:32:19,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:32:19,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:32:19,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:32:19,372 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:32:19,372 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:32:19,373 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1280_true-unreach-call.c [2018-09-20 15:32:19,723 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e486bfd58/d6c9935896394d808603aa4d215c733a/FLAG00faddb64 [2018-09-20 15:32:19,906 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:32:19,906 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1280_true-unreach-call.c [2018-09-20 15:32:19,919 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e486bfd58/d6c9935896394d808603aa4d215c733a/FLAG00faddb64 [2018-09-20 15:32:19,939 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e486bfd58/d6c9935896394d808603aa4d215c733a [2018-09-20 15:32:19,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:32:19,950 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:32:19,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:32:19,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:32:19,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:32:19,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:32:19" (1/1) ... [2018-09-20 15:32:19,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dff9781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:19, skipping insertion in model container [2018-09-20 15:32:19,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:32:19" (1/1) ... [2018-09-20 15:32:19,981 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:32:20,257 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:32:20,277 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:32:20,349 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:32:20,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:20 WrapperNode [2018-09-20 15:32:20,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:32:20,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:32:20,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:32:20,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:32:20,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:20" (1/1) ... [2018-09-20 15:32:20,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:20" (1/1) ... [2018-09-20 15:32:20,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:20" (1/1) ... [2018-09-20 15:32:20,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:20" (1/1) ... [2018-09-20 15:32:20,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:20" (1/1) ... [2018-09-20 15:32:20,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:20" (1/1) ... [2018-09-20 15:32:20,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:20" (1/1) ... [2018-09-20 15:32:20,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:32:20,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:32:20,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:32:20,447 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:32:20,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:20" (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-09-20 15:32:20,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:32:20,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:32:20,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_logf [2018-09-20 15:32:20,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_log10f [2018-09-20 15:32:20,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-09-20 15:32:20,589 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:32:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:32:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_logf [2018-09-20 15:32:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:32:20,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:32:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:32:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:32:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:32:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:32:20,590 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_log10f [2018-09-20 15:32:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-09-20 15:32:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:32:20,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:32:20,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:32:20,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:32:20,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:32:21,559 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:32:21,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:21 BoogieIcfgContainer [2018-09-20 15:32:21,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:32:21,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:32:21,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:32:21,566 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:32:21,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:32:19" (1/3) ... [2018-09-20 15:32:21,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de14e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:21, skipping insertion in model container [2018-09-20 15:32:21,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:20" (2/3) ... [2018-09-20 15:32:21,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de14e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:21, skipping insertion in model container [2018-09-20 15:32:21,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:21" (3/3) ... [2018-09-20 15:32:21,572 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1280_true-unreach-call.c [2018-09-20 15:32:21,582 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:32:21,596 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:32:21,641 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:32:21,642 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:32:21,642 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:32:21,643 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:32:21,643 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:32:21,643 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:32:21,643 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:32:21,643 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:32:21,644 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:32:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2018-09-20 15:32:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-20 15:32:21,674 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:21,675 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:21,678 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:21,684 INFO L82 PathProgramCache]: Analyzing trace with hash -837265325, now seen corresponding path program 1 times [2018-09-20 15:32:21,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:32:21,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:32:21,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:21,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:21,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:21,871 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:21,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:32:21,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:32:21,893 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:32:21,895 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:32:21,898 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 2 states. [2018-09-20 15:32:21,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:21,937 INFO L93 Difference]: Finished difference Result 232 states and 294 transitions. [2018-09-20 15:32:21,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:32:21,939 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-09-20 15:32:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:21,950 INFO L225 Difference]: With dead ends: 232 [2018-09-20 15:32:21,951 INFO L226 Difference]: Without dead ends: 116 [2018-09-20 15:32:21,956 INFO L606 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-09-20 15:32:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-20 15:32:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-09-20 15:32:22,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-20 15:32:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2018-09-20 15:32:22,010 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 17 [2018-09-20 15:32:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:22,013 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2018-09-20 15:32:22,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:32:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2018-09-20 15:32:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-20 15:32:22,014 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:22,017 INFO L376 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-09-20 15:32:22,017 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:22,018 INFO L82 PathProgramCache]: Analyzing trace with hash 822769855, now seen corresponding path program 1 times [2018-09-20 15:32:22,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:32:22,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:32:22,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:22,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:32:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:32:22,174 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:32:22,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:32:22 BoogieIcfgContainer [2018-09-20 15:32:22,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:32:22,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:32:22,273 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:32:22,273 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:32:22,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:21" (3/4) ... [2018-09-20 15:32:22,288 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:32:22,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:32:22,289 INFO L168 Benchmark]: Toolchain (without parser) took 2341.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.9 MB in the beginning and 1.1 GB in the end (delta: -106.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:22,291 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:32:22,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:22,293 INFO L168 Benchmark]: Boogie Preprocessor took 58.21 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:32:22,293 INFO L168 Benchmark]: RCFGBuilder took 1113.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:22,294 INFO L168 Benchmark]: TraceAbstraction took 710.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:22,295 INFO L168 Benchmark]: Witness Printer took 15.88 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-09-20 15:32:22,300 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 435.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.21 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1113.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 710.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Witness Printer took 15.88 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: 167]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 166, overapproximation of someBinaryArithmeticFLOAToperation at line 116, overapproximation of bitwiseAnd at line 115. Possible FailurePath: [L11-L15] static const float ln2_hi_log = 6.9313812256e-01, ln2_lo_log = 9.0580006145e-06, two25_log = 3.355443200e+07, Lg1_log = 6.6666668653e-01, Lg2_log = 4.0000000596e-01, Lg3_log = 2.8571429849e-01, Lg4_log = 2.2222198546e-01, Lg5_log = 1.8183572590e-01, Lg6_log = 1.5313838422e-01, Lg7_log = 1.4798198640e-01; [L17] static const float zero_log = 0.0; [L97-L100] static const float two25_log10 = 3.3554432000e+07, ivln10_log10 = 4.3429449201e-01, log10_2hi_log10 = 3.0102920532e-01, log10_2lo_log10 = 7.9034151668e-07; [L102] static const float zero = 0.0; VAL [\old(ivln10_log10)=6442450946, \old(Lg1_log)=6442450962, \old(Lg2_log)=6442450965, \old(Lg3_log)=6442450945, \old(Lg4_log)=6442450951, \old(Lg5_log)=6442450952, \old(Lg6_log)=6442450961, \old(Lg7_log)=6442450958, \old(ln2_hi_log)=6442450948, \old(ln2_lo_log)=6442450953, \old(log10_2hi_log10)=6442450956, \old(log10_2lo_log10)=6442450960, \old(two25_log)=6442450957, \old(two25_log10)=6442450959, \old(zero)=6442450963, \old(zero_log)=6442450955, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, zero=0, zero_log=0] [L162] float x = 1.0f; VAL [ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L163] CALL, EXPR __ieee754_log10f(x) VAL [\old(x)=1, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, zero=0, zero_log=0] [L105] float y, z; [L106] __int32_t i, k, hx; VAL [\old(x)=1, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L109] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=1, gf_u={6442450964:0}, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L110] FCALL gf_u.value = (x) VAL [\old(x)=1, gf_u={6442450964:0}, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L111] EXPR, FCALL gf_u.word VAL [\old(x)=1, gf_u={6442450964:0}, gf_u.word=6442450944, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L111] (hx) = gf_u.word VAL [\old(x)=1, gf_u={6442450964:0}, gf_u.word=6442450944, hx=-2147483648, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L111] FCALL (hx) = gf_u.word VAL [(hx) = gf_u.word=6442450949, \old(x)=1, gf_u={6442450964:0}, gf_u.word=6442450944, hx=-2147483648, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L112] COND FALSE !(0) VAL [\old(x)=1, hx=-2147483648, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L114] k = 0 VAL [\old(x)=1, hx=-2147483648, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L115] COND TRUE ((hx & 0x7fffffff) == 0) [L116] RET return -two25_log10 / zero; VAL [\old(x)=1, hx=-2147483648, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L163] EXPR __ieee754_log10f(x) VAL [__ieee754_log10f(x)=6442450950, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L163] float res = __ieee754_log10f(x); [L166] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, res=6442450950, res == 0.0f && __signbit_float(res) == 0=0, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L166] COND FALSE, EXPR !(res == 0.0f && __signbit_float(res) == 0) VAL [ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, res=6442450950, res == 0.0f && __signbit_float(res) == 0=0, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] [L166] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L167] __VERIFIER_error() VAL [ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, res=6442450950, two25_log=33554432, two25_log10=33554432, x=1, zero=0, zero_log=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 120 locations, 1 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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.23-40ef509 [2018-09-20 15:32:24,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:32:24,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:32:24,642 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:32:24,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:32:24,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:32:24,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:32:24,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:32:24,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:32:24,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:32:24,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:32:24,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:32:24,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:32:24,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:32:24,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:32:24,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:32:24,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:32:24,660 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:32:24,662 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:32:24,664 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:32:24,665 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:32:24,666 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:32:24,669 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:32:24,670 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:32:24,670 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:32:24,671 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:32:24,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:32:24,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:32:24,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:32:24,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:32:24,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:32:24,678 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:32:24,678 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:32:24,678 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:32:24,679 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:32:24,680 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:32:24,681 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:32:24,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:32:24,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:32:24,699 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:32:24,699 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:32:24,700 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:32:24,700 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:32:24,700 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:32:24,701 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:32:24,701 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:32:24,701 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:32:24,701 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:32:24,701 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:32:24,701 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:32:24,702 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:32:24,702 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:32:24,702 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:32:24,702 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:32:24,702 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:32:24,704 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:32:24,704 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:32:24,704 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:32:24,705 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:32:24,705 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:32:24,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:32:24,705 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:32:24,705 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:32:24,706 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:32:24,706 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:32:24,706 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:32:24,706 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:32:24,706 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:32:24,707 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 -> 8f03b8664db42073daadcd6b28aafc757b6f7be2 [2018-09-20 15:32:24,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:32:24,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:32:24,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:32:24,792 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:32:24,792 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:32:24,794 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1280_true-unreach-call.c [2018-09-20 15:32:25,145 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1267aeadb/be40014c55db4f2596ebdf7bb7df27bb/FLAG3bec329bd [2018-09-20 15:32:25,303 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:32:25,304 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1280_true-unreach-call.c [2018-09-20 15:32:25,316 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1267aeadb/be40014c55db4f2596ebdf7bb7df27bb/FLAG3bec329bd [2018-09-20 15:32:25,332 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1267aeadb/be40014c55db4f2596ebdf7bb7df27bb [2018-09-20 15:32:25,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:32:25,339 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:32:25,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:32:25,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:32:25,347 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:32:25,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:32:25" (1/1) ... [2018-09-20 15:32:25,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5388008b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:25, skipping insertion in model container [2018-09-20 15:32:25,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:32:25" (1/1) ... [2018-09-20 15:32:25,362 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:32:25,657 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:32:25,678 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:32:25,719 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:32:25,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:25 WrapperNode [2018-09-20 15:32:25,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:32:25,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:32:25,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:32:25,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:32:25,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:25" (1/1) ... [2018-09-20 15:32:25,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:25" (1/1) ... [2018-09-20 15:32:25,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:25" (1/1) ... [2018-09-20 15:32:25,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:25" (1/1) ... [2018-09-20 15:32:25,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:25" (1/1) ... [2018-09-20 15:32:25,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:25" (1/1) ... [2018-09-20 15:32:25,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:25" (1/1) ... [2018-09-20 15:32:25,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:32:25,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:32:25,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:32:25,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:32:25,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:25" (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-09-20 15:32:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:32:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:32:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_logf [2018-09-20 15:32:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_log10f [2018-09-20 15:32:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-09-20 15:32:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:32:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:32:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_logf [2018-09-20 15:32:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:32:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-20 15:32:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:32:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:32:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:32:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-20 15:32:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_log10f [2018-09-20 15:32:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-09-20 15:32:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:32:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:32:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:32:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:32:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-20 15:32:28,555 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:28,580 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:29,688 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:29,708 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:40,080 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:40,119 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:41,110 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:41,124 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:43,377 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:43,390 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:43,400 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:32:43,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:43 BoogieIcfgContainer [2018-09-20 15:32:43,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:32:43,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:32:43,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:32:43,406 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:32:43,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:32:25" (1/3) ... [2018-09-20 15:32:43,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb919f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:43, skipping insertion in model container [2018-09-20 15:32:43,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:25" (2/3) ... [2018-09-20 15:32:43,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb919f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:43, skipping insertion in model container [2018-09-20 15:32:43,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:43" (3/3) ... [2018-09-20 15:32:43,412 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1280_true-unreach-call.c [2018-09-20 15:32:43,422 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:32:43,431 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:32:43,486 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:32:43,487 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:32:43,487 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:32:43,487 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:32:43,487 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:32:43,487 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:32:43,488 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:32:43,488 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:32:43,488 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:32:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2018-09-20 15:32:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-20 15:32:43,520 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:43,521 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:43,524 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:43,530 INFO L82 PathProgramCache]: Analyzing trace with hash -837265325, now seen corresponding path program 1 times [2018-09-20 15:32:43,535 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:43,536 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-09-20 15:32:43,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:43,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:43,863 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:43,878 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:43,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:32:43,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:32:43,894 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:32:43,895 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:32:43,897 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 2 states. [2018-09-20 15:32:43,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:43,938 INFO L93 Difference]: Finished difference Result 232 states and 294 transitions. [2018-09-20 15:32:43,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:32:43,940 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-09-20 15:32:43,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:43,954 INFO L225 Difference]: With dead ends: 232 [2018-09-20 15:32:43,955 INFO L226 Difference]: Without dead ends: 116 [2018-09-20 15:32:43,960 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-09-20 15:32:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-20 15:32:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-09-20 15:32:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-20 15:32:44,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2018-09-20 15:32:44,015 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 17 [2018-09-20 15:32:44,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:44,016 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2018-09-20 15:32:44,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:32:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2018-09-20 15:32:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-20 15:32:44,018 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:44,018 INFO L376 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-09-20 15:32:44,018 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:44,019 INFO L82 PathProgramCache]: Analyzing trace with hash 822769855, now seen corresponding path program 1 times [2018-09-20 15:32:44,019 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:44,020 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-09-20 15:32:44,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:44,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:44,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:32:44,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:44,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:44,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:44,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:44,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:44,577 INFO L477 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 29 treesize of output 21 [2018-09-20 15:32:44,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:44,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:44,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:44,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:44,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:44,754 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:44,766 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:44,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 15:32:44,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 15:32:44,769 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 15:32:44,769 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 15:32:44,770 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 8 states. [2018-09-20 15:32:45,217 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-20 15:32:45,466 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-20 15:32:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:48,755 INFO L93 Difference]: Finished difference Result 147 states and 162 transitions. [2018-09-20 15:32:48,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 15:32:48,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-09-20 15:32:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:48,762 INFO L225 Difference]: With dead ends: 147 [2018-09-20 15:32:48,762 INFO L226 Difference]: Without dead ends: 124 [2018-09-20 15:32:48,763 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-20 15:32:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2018-09-20 15:32:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-20 15:32:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2018-09-20 15:32:48,783 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 26 [2018-09-20 15:32:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:48,784 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2018-09-20 15:32:48,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 15:32:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2018-09-20 15:32:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-20 15:32:48,785 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:48,786 INFO L376 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-09-20 15:32:48,786 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:48,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1828421709, now seen corresponding path program 1 times [2018-09-20 15:32:48,787 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:48,787 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-09-20 15:32:48,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:49,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:49,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:32:49,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:49,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:49,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:49,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:49,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:49,167 INFO L477 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 29 treesize of output 21 [2018-09-20 15:32:49,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:49,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:49,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:49,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:49,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:49,261 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:49,282 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:49,282 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 15:32:49,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 15:32:49,283 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 15:32:49,283 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 15:32:49,284 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand 8 states. [2018-09-20 15:32:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:51,585 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2018-09-20 15:32:51,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 15:32:51,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-09-20 15:32:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:51,589 INFO L225 Difference]: With dead ends: 147 [2018-09-20 15:32:51,589 INFO L226 Difference]: Without dead ends: 124 [2018-09-20 15:32:51,590 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-20 15:32:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2018-09-20 15:32:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-20 15:32:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-09-20 15:32:51,603 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 27 [2018-09-20 15:32:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:51,603 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-09-20 15:32:51,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 15:32:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-09-20 15:32:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-20 15:32:51,605 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:51,605 INFO L376 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-09-20 15:32:51,606 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:51,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2101061757, now seen corresponding path program 1 times [2018-09-20 15:32:51,608 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:51,608 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-09-20 15:32:51,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:51,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:51,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:32:51,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:51,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:51,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:51,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:51,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:51,827 INFO L477 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 29 treesize of output 21 [2018-09-20 15:32:51,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:51,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:51,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:51,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:51,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:51,979 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:51,992 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:51,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 15:32:51,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 15:32:51,993 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 15:32:51,994 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 15:32:51,994 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 8 states. [2018-09-20 15:32:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:53,284 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2018-09-20 15:32:53,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 15:32:53,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-09-20 15:32:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:53,288 INFO L225 Difference]: With dead ends: 145 [2018-09-20 15:32:53,288 INFO L226 Difference]: Without dead ends: 122 [2018-09-20 15:32:53,289 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:32:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-20 15:32:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2018-09-20 15:32:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-20 15:32:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2018-09-20 15:32:53,299 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 28 [2018-09-20 15:32:53,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:53,299 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2018-09-20 15:32:53,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 15:32:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2018-09-20 15:32:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-20 15:32:53,301 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:53,302 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:53,302 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1522396444, now seen corresponding path program 1 times [2018-09-20 15:32:53,303 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:53,303 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-09-20 15:32:53,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:53,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:53,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:32:53,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:53,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:53,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:53,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:53,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:53,941 INFO L477 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 29 treesize of output 21 [2018-09-20 15:32:53,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:53,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:53,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:53,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:53,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:54,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 24 [2018-09-20 15:32:54,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-09-20 15:32:54,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:54,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:54,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:54,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-09-20 15:32:54,219 INFO L477 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 45 treesize of output 37 [2018-09-20 15:32:54,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 57 [2018-09-20 15:32:54,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:54,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:54,258 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-09-20 15:32:54,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:67 [2018-09-20 15:32:54,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:32:54,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:32:54,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:54,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:54,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:54,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:32:54,724 INFO L477 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 29 treesize of output 21 [2018-09-20 15:32:54,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:32:54,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:54,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:54,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:54,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:32:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:55,053 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:55,073 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:55,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-20 15:32:55,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-20 15:32:55,075 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-20 15:32:55,075 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:32:55,075 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand 17 states. [2018-09-20 15:32:57,594 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:33:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:05,549 INFO L93 Difference]: Finished difference Result 165 states and 180 transitions. [2018-09-20 15:33:05,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-20 15:33:05,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-09-20 15:33:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:05,555 INFO L225 Difference]: With dead ends: 165 [2018-09-20 15:33:05,555 INFO L226 Difference]: Without dead ends: 141 [2018-09-20 15:33:05,556 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2018-09-20 15:33:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-20 15:33:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-09-20 15:33:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-20 15:33:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2018-09-20 15:33:05,576 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 57 [2018-09-20 15:33:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:05,577 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2018-09-20 15:33:05,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-20 15:33:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2018-09-20 15:33:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-20 15:33:05,581 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:05,581 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:33:05,582 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1557258916, now seen corresponding path program 1 times [2018-09-20 15:33:05,582 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:05,582 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) [2018-09-20 15:33:05,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 15:33:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:06,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:06,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:33:06,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:06,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:06,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:06,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:06,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:33:06,203 INFO L477 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 29 treesize of output 21 [2018-09-20 15:33:06,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:06,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:06,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:06,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:06,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:33:06,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 24 [2018-09-20 15:33:06,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-09-20 15:33:06,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:06,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:06,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:06,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-09-20 15:33:06,482 INFO L477 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 45 treesize of output 37 [2018-09-20 15:33:06,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 57 [2018-09-20 15:33:06,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:06,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:06,609 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-09-20 15:33:06,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:67 [2018-09-20 15:33:07,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:33:07,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:07,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:07,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:07,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:07,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:33:07,172 INFO L477 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 29 treesize of output 21 [2018-09-20 15:33:07,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:07,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:07,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:07,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:07,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:33:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:33:07,464 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:07,478 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:07,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-20 15:33:07,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-20 15:33:07,479 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-20 15:33:07,480 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:33:07,480 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 17 states. [2018-09-20 15:33:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:18,296 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-09-20 15:33:18,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-20 15:33:18,299 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-09-20 15:33:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:18,301 INFO L225 Difference]: With dead ends: 167 [2018-09-20 15:33:18,301 INFO L226 Difference]: Without dead ends: 143 [2018-09-20 15:33:18,302 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2018-09-20 15:33:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-20 15:33:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 130. [2018-09-20 15:33:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-20 15:33:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2018-09-20 15:33:18,316 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 58 [2018-09-20 15:33:18,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:18,317 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2018-09-20 15:33:18,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-20 15:33:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2018-09-20 15:33:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-20 15:33:18,320 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:18,320 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 15:33:18,321 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:18,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1851941528, now seen corresponding path program 1 times [2018-09-20 15:33:18,321 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:18,322 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) [2018-09-20 15:33:18,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 15:33:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:18,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:18,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:33:18,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:18,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:18,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:18,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:18,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:33:18,920 INFO L477 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 29 treesize of output 21 [2018-09-20 15:33:18,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:18,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:18,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:18,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:18,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:33:19,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 24 [2018-09-20 15:33:19,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-09-20 15:33:19,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:19,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:19,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:19,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-09-20 15:33:19,222 INFO L477 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 45 treesize of output 37 [2018-09-20 15:33:19,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 57 [2018-09-20 15:33:19,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:19,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:19,257 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-09-20 15:33:19,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:67 [2018-09-20 15:33:19,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:33:19,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:19,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:19,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:19,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:19,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:33:19,702 INFO L477 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 29 treesize of output 21 [2018-09-20 15:33:19,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:19,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:19,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:19,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:19,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:33:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:33:19,992 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:20,009 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:20,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-20 15:33:20,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-20 15:33:20,011 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-20 15:33:20,011 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:33:20,011 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 17 states. [2018-09-20 15:33:22,617 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-20 15:33:22,972 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-20 15:33:31,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:31,162 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2018-09-20 15:33:31,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-20 15:33:31,163 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-09-20 15:33:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:31,164 INFO L225 Difference]: With dead ends: 165 [2018-09-20 15:33:31,165 INFO L226 Difference]: Without dead ends: 141 [2018-09-20 15:33:31,166 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2018-09-20 15:33:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-20 15:33:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-09-20 15:33:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-20 15:33:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2018-09-20 15:33:31,179 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 59 [2018-09-20 15:33:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:31,180 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2018-09-20 15:33:31,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-20 15:33:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2018-09-20 15:33:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-20 15:33:31,183 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:31,183 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 15:33:31,183 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:31,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2143244499, now seen corresponding path program 1 times [2018-09-20 15:33:31,184 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:31,184 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-09-20 15:33:31,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:31,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:31,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:33:31,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:31,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:31,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:31,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:31,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:33:31,844 INFO L477 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 29 treesize of output 21 [2018-09-20 15:33:31,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:31,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:31,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:31,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:31,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:33:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:33:31,965 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:31,985 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:31,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 15:33:31,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 15:33:31,987 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 15:33:31,987 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 15:33:31,987 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 8 states. [2018-09-20 15:33:33,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:33,755 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2018-09-20 15:33:33,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-20 15:33:33,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-09-20 15:33:33,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:33,759 INFO L225 Difference]: With dead ends: 154 [2018-09-20 15:33:33,759 INFO L226 Difference]: Without dead ends: 106 [2018-09-20 15:33:33,761 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-20 15:33:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-20 15:33:33,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-20 15:33:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-20 15:33:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-09-20 15:33:33,768 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 67 [2018-09-20 15:33:33,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:33,768 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-09-20 15:33:33,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 15:33:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-09-20 15:33:33,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-20 15:33:33,770 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:33,773 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 15:33:33,773 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1606778106, now seen corresponding path program 1 times [2018-09-20 15:33:33,773 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:33,774 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-09-20 15:33:33,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:35,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:35,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:33:35,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:35,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:33:35,184 INFO L477 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 29 treesize of output 21 [2018-09-20 15:33:35,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:35,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:33:35,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 24 [2018-09-20 15:33:35,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-09-20 15:33:35,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:35,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-09-20 15:33:35,407 INFO L477 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 45 treesize of output 37 [2018-09-20 15:33:35,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 57 [2018-09-20 15:33:35,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,437 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-09-20 15:33:35,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:67 [2018-09-20 15:33:35,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:33:35,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:35,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-20 15:33:35,777 INFO L477 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 29 treesize of output 21 [2018-09-20 15:33:35,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:35,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:35,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-20 15:33:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:33:36,615 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:36,643 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:36,644 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-09-20 15:33:36,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-20 15:33:36,644 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-20 15:33:36,645 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:33:36,645 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 19 states. [2018-09-20 15:33:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:53,036 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2018-09-20 15:33:53,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-20 15:33:53,037 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-09-20 15:33:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:53,039 INFO L225 Difference]: With dead ends: 153 [2018-09-20 15:33:53,039 INFO L226 Difference]: Without dead ends: 124 [2018-09-20 15:33:53,040 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=148, Invalid=1258, Unknown=0, NotChecked=0, Total=1406 [2018-09-20 15:33:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-20 15:33:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2018-09-20 15:33:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-20 15:33:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-09-20 15:33:53,049 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 75 [2018-09-20 15:33:53,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:53,049 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-09-20 15:33:53,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-20 15:33:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-09-20 15:33:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-20 15:33:53,051 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:53,051 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 15:33:53,051 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash 73942215, now seen corresponding path program 1 times [2018-09-20 15:33:53,052 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:53,052 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) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-20 15:33:53,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:53,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:53,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:33:53,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:53,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:53,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:53,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:53,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-09-20 15:33:53,863 INFO L477 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 29 treesize of output 21 [2018-09-20 15:33:53,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:53,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:53,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:53,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:53,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:15 [2018-09-20 15:33:54,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 24 [2018-09-20 15:33:54,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-09-20 15:33:54,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:54,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-09-20 15:33:54,206 INFO L477 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 45 treesize of output 37 [2018-09-20 15:33:54,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 57 [2018-09-20 15:33:54,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,365 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-09-20 15:33:54,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:72 [2018-09-20 15:33:54,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-09-20 15:33:54,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-20 15:33:54,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-09-20 15:33:54,881 INFO L477 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 29 treesize of output 21 [2018-09-20 15:33:54,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-20 15:33:54,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:54,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:15 [2018-09-20 15:33:55,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 20 [2018-09-20 15:33:55,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-09-20 15:33:55,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:55,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:55,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:55,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-09-20 15:33:55,461 INFO L477 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 41 treesize of output 33 [2018-09-20 15:33:55,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2018-09-20 15:33:55,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:55,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:55,492 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-09-20 15:33:55,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:60 [2018-09-20 15:34:11,066 WARN L178 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:35:01,775 WARN L178 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:35:58,073 WARN L178 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-09-20 15:35:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:35:58,132 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:35:58,148 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:35:58,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-09-20 15:35:58,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-20 15:35:58,149 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-20 15:35:58,149 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=445, Unknown=40, NotChecked=0, Total=552 [2018-09-20 15:35:58,149 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 24 states. [2018-09-20 15:37:45,737 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:690) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:603) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-09-20 15:37:45,741 INFO L168 Benchmark]: Toolchain (without parser) took 320403.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.7 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). Peak memory consumption was 155.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:37:45,742 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:37:45,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.19 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 935.7 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-09-20 15:37:45,742 INFO L168 Benchmark]: Boogie Preprocessor took 73.33 ms. Allocated memory is still 1.0 GB. Free memory was 935.7 MB in the beginning and 930.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:37:45,743 INFO L168 Benchmark]: RCFGBuilder took 17541.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-09-20 15:37:45,743 INFO L168 Benchmark]: TraceAbstraction took 302337.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.4 MB). Peak memory consumption was 154.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:37:45,745 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 444.19 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 935.7 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.33 ms. Allocated memory is still 1.0 GB. Free memory was 935.7 MB in the beginning and 930.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 17541.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 302337.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.4 MB). Peak memory consumption was 154.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...