./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_0684a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_0684a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6e14d9043cb09b811e844719c56ad84744abca8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_0684a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6e14d9043cb09b811e844719c56ad84744abca8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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)Received EOF on stdin. No stderr output. --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:23:55,619 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:23:55,620 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:23:55,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:23:55,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:23:55,629 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:23:55,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:23:55,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:23:55,632 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:23:55,632 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:23:55,633 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:23:55,633 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:23:55,634 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:23:55,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:23:55,635 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:23:55,636 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:23:55,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:23:55,638 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:23:55,639 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:23:55,640 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:23:55,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:23:55,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:23:55,644 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:23:55,645 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:23:55,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:23:55,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:23:55,646 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:23:55,647 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:23:55,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:23:55,648 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:23:55,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:23:55,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:23:55,649 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:23:55,650 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:23:55,651 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:23:55,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:23:55,651 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 07:23:55,659 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:23:55,659 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:23:55,660 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:23:55,660 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:23:55,660 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:23:55,660 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:23:55,660 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 07:23:55,661 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:23:55,661 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 07:23:55,661 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 07:23:55,661 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:23:55,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:23:55,662 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:23:55,662 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:23:55,662 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:23:55,662 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:23:55,662 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:23:55,662 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:23:55,662 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:23:55,663 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:23:55,663 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:23:55,663 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:23:55,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:23:55,663 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:23:55,663 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:23:55,663 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:23:55,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:23:55,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:23:55,664 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:23:55,664 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:23:55,664 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 07:23:55,664 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:23:55,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:23:55,664 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 07:23:55,665 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan 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 -> Taipan 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 -> b6e14d9043cb09b811e844719c56ad84744abca8 [2018-11-10 07:23:55,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:23:55,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:23:55,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:23:55,703 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:23:55,703 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:23:55,704 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_0684a_true-unreach-call.c [2018-11-10 07:23:55,750 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/data/098bbc338/54a9b402cb044a67ab81afdac3ec23f1/FLAG84c86f418 [2018-11-10 07:23:56,094 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:23:56,095 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/sv-benchmarks/c/float-newlib/float_req_bl_0684a_true-unreach-call.c [2018-11-10 07:23:56,101 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/data/098bbc338/54a9b402cb044a67ab81afdac3ec23f1/FLAG84c86f418 [2018-11-10 07:23:56,113 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/data/098bbc338/54a9b402cb044a67ab81afdac3ec23f1 [2018-11-10 07:23:56,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:23:56,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:23:56,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:23:56,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:23:56,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:23:56,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:23:56" (1/1) ... [2018-11-10 07:23:56,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7249ddee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56, skipping insertion in model container [2018-11-10 07:23:56,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:23:56" (1/1) ... [2018-11-10 07:23:56,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:23:56,154 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:23:56,318 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:23:56,324 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:23:56,362 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:23:56,380 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:23:56,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56 WrapperNode [2018-11-10 07:23:56,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:23:56,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:23:56,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:23:56,382 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:23:56,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56" (1/1) ... [2018-11-10 07:23:56,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56" (1/1) ... [2018-11-10 07:23:56,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:23:56,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:23:56,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:23:56,464 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:23:56,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56" (1/1) ... [2018-11-10 07:23:56,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56" (1/1) ... [2018-11-10 07:23:56,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56" (1/1) ... [2018-11-10 07:23:56,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56" (1/1) ... [2018-11-10 07:23:56,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56" (1/1) ... [2018-11-10 07:23:56,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56" (1/1) ... [2018-11-10 07:23:56,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56" (1/1) ... [2018-11-10 07:23:56,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:23:56,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:23:56,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:23:56,508 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:23:56,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:23:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_atan2f [2018-11-10 07:23:56,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_atan2f [2018-11-10 07:23:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_float [2018-11-10 07:23:56,555 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_float [2018-11-10 07:23:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:23:56,555 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:23:56,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:23:56,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:23:56,556 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2018-11-10 07:23:56,556 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2018-11-10 07:23:56,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:23:56,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:23:56,556 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2018-11-10 07:23:56,556 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2018-11-10 07:23:57,118 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:23:57,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:23:57 BoogieIcfgContainer [2018-11-10 07:23:57,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:23:57,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:23:57,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:23:57,121 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:23:57,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:23:56" (1/3) ... [2018-11-10 07:23:57,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a29ff6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:23:57, skipping insertion in model container [2018-11-10 07:23:57,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:56" (2/3) ... [2018-11-10 07:23:57,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a29ff6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:23:57, skipping insertion in model container [2018-11-10 07:23:57,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:23:57" (3/3) ... [2018-11-10 07:23:57,123 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684a_true-unreach-call.c [2018-11-10 07:23:57,129 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:23:57,135 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:23:57,145 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:23:57,167 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:23:57,167 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:23:57,167 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:23:57,168 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:23:57,168 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:23:57,168 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:23:57,168 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:23:57,168 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:23:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-11-10 07:23:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 07:23:57,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:23:57,188 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:23:57,190 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:23:57,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:23:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1310494682, now seen corresponding path program 1 times [2018-11-10 07:23:57,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:23:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:23:57,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:23:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:23:57,227 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:23:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:23:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:23:57,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:23:57,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:23:57,330 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:23:57,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 07:23:57,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:23:57,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:23:57,343 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 2 states. [2018-11-10 07:23:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:23:57,370 INFO L93 Difference]: Finished difference Result 210 states and 329 transitions. [2018-11-10 07:23:57,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:23:57,371 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-10 07:23:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:23:57,378 INFO L225 Difference]: With dead ends: 210 [2018-11-10 07:23:57,379 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 07:23:57,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:23:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 07:23:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-10 07:23:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-10 07:23:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2018-11-10 07:23:57,416 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 26 [2018-11-10 07:23:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:23:57,416 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2018-11-10 07:23:57,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 07:23:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2018-11-10 07:23:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 07:23:57,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:23:57,418 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:23:57,418 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:23:57,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:23:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash -692369074, now seen corresponding path program 1 times [2018-11-10 07:23:57,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:23:57,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:23:57,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:23:57,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:23:57,419 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:23:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:23:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:23:57,546 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 07:23:57,560 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,561 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,561 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,562 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,563 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,563 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,563 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,566 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,566 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,566 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,566 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,566 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,567 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,568 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,568 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,568 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,568 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,571 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,571 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,571 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,571 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,572 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,572 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,572 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,572 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,572 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,573 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,573 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,573 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,573 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,574 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,574 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,574 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,574 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,574 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,575 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled [2018-11-10 07:23:57,575 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:23:57,586 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10737418265 could not be translated for associated CType ARRAY#_4_~FLOAT# [2018-11-10 07:23:57,587 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10737418246 could not be translated for associated CType ARRAY#_4_~FLOAT# [2018-11-10 07:23:57,587 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10737418258 could not be translated for associated CType ARRAY#_11_~FLOAT# [2018-11-10 07:23:57,587 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10737418273 could not be translated for associated CType ARRAY#_4_~FLOAT# [2018-11-10 07:23:57,588 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10737418251 could not be translated for associated CType ARRAY#_4_~FLOAT# [2018-11-10 07:23:57,588 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 10737418250 could not be translated for associated CType ARRAY#_11_~FLOAT# [2018-11-10 07:23:57,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:23:57 BoogieIcfgContainer [2018-11-10 07:23:57,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:23:57,603 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:23:57,603 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:23:57,603 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:23:57,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:23:57" (3/4) ... [2018-11-10 07:23:57,606 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:23:57,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:23:57,607 INFO L168 Benchmark]: Toolchain (without parser) took 1491.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 961.9 MB in the beginning and 993.8 MB in the end (delta: -31.9 MB). Peak memory consumption was 95.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:23:57,608 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:23:57,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.69 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:23:57,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:23:57,610 INFO L168 Benchmark]: Boogie Preprocessor took 43.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:23:57,610 INFO L168 Benchmark]: RCFGBuilder took 609.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.2 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:23:57,610 INFO L168 Benchmark]: TraceAbstraction took 484.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.8 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:23:57,611 INFO L168 Benchmark]: Witness Printer took 3.59 ms. Allocated memory is still 1.2 GB. Free memory is still 993.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:23:57,613 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.69 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 609.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.2 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 484.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.8 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.59 ms. Allocated memory is still 1.2 GB. Free memory is still 993.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10737418265 could not be translated for associated CType ARRAY#_4_~FLOAT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10737418246 could not be translated for associated CType ARRAY#_4_~FLOAT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10737418258 could not be translated for associated CType ARRAY#_11_~FLOAT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10737418273 could not be translated for associated CType ARRAY#_4_~FLOAT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10737418251 could not be translated for associated CType ARRAY#_4_~FLOAT# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 10737418250 could not be translated for associated CType ARRAY#_11_~FLOAT# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 244]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 243, overapproximation of someUnaryDOUBLEoperation at line 42, overapproximation of bitwiseAnd at line 133, overapproximation of someBinaryArithmeticFLOAToperation at line 135. Possible FailurePath: [L27-L32] CALL static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L27-L32] RET static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L27-L32] RET static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L27-L32] RET static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L27-L32] RET static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L27-L32] RET static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L34-L39] CALL static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L34-L39] RET static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L34-L39] RET static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L34-L39] RET static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L34-L39] RET static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L34-L39] RET static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L41-L45] CALL static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] RET static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] RET static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] RET static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] RET static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] RET static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] RET static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] RET static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] RET static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] RET static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] RET static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] RET static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] RET static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L47-L49] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; [L115-L116] static const float tiny_atan2 = 1.0e-30, zero_atan2 = 0.0, pi_lo_atan2 = -8.7422776573e-08; VAL [\old(aT_atan)=null, \old(aT_atan)=null, \old(atanhi_atan)=null, \old(atanhi_atan)=null, \old(atanlo_atan)=null, \old(atanlo_atan)=null, \old(huge_atan)=10737418270, \old(one_atan)=10737418259, \old(pi)=10737418268, \old(pi_lo_atan2)=10737418257, \old(pi_o_2)=10737418241, \old(pi_o_4)=10737418263, \old(tiny_atan2)=10737418272, \old(zero_atan2)=10737418248, aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L234] float x = __VERIFIER_nondet_float(); [L235] float y = 1.0f / 0.0f; VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418264, zero_atan2=0] [L238] CALL isfinite_float(x) VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L217] __int32_t ix; VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L219] CALL ieee_float_shape_type gf_u; [L219] RET ieee_float_shape_type gf_u; [L220] CALL gf_u.value = (x) [L220] RET gf_u.value = (x) [L221] CALL, EXPR gf_u.word [L221] RET, EXPR gf_u.word [L221] (ix) = gf_u.word [L221] RET (ix) = gf_u.word [L222] COND FALSE !(0) VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L223] ix &= 0x7fffffff [L224] RET return (((ix) < 0x7f800000L)); VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L238] isfinite_float(x) VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, isfinite_float(x)=1, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418264, zero_atan2=0] [L238] COND TRUE isfinite_float(x) [L240] CALL, EXPR __ieee754_atan2f(y, x) VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L119] float z; [L120] __int32_t k, m, hx, hy, ix, iy; VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L123] CALL ieee_float_shape_type gf_u; [L123] RET ieee_float_shape_type gf_u; [L124] CALL gf_u.value = (x) [L124] RET gf_u.value = (x) [L125] CALL, EXPR gf_u.word [L125] RET, EXPR gf_u.word [L125] (hx) = gf_u.word [L125] RET (hx) = gf_u.word [L126] COND FALSE !(0) VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L127] ix = hx & 0x7fffffff VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L129] CALL ieee_float_shape_type gf_u; [L129] RET ieee_float_shape_type gf_u; [L130] CALL gf_u.value = (y) [L130] RET gf_u.value = (y) [L131] CALL, EXPR gf_u.word [L131] RET, EXPR gf_u.word [L131] (hy) = gf_u.word [L131] RET (hy) = gf_u.word [L132] COND FALSE !(0) VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L133] iy = hy & 0x7fffffff VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L134] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L135] RET return x + y; VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L240] EXPR __ieee754_atan2f(y, x) VAL [__ieee754_atan2f(y, x)=10737418267, aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418264, y=10737418262, zero_atan2=0] [L240] float res = __ieee754_atan2f(y, x); [L243] COND TRUE res != pi_o_2 VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=10737418267, tiny_atan2=1/1000000000000000000000000000000, x=10737418264, y=10737418262, zero_atan2=0] [L244] __VERIFIER_error() VAL [aT_atan={10737418243:0}, atanhi_atan={10737418254:0}, atanlo_atan={10737418242:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=10737418267, tiny_atan2=1/1000000000000000000000000000000, x=10737418264, y=10737418262, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 109 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 149 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=109occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 625 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-1dbac8b [2018-11-10 07:23:59,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:23:59,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:23:59,131 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:23:59,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:23:59,132 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:23:59,133 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:23:59,134 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:23:59,135 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:23:59,135 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:23:59,136 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:23:59,136 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:23:59,137 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:23:59,138 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:23:59,139 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:23:59,139 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:23:59,140 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:23:59,141 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:23:59,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:23:59,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:23:59,144 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:23:59,145 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:23:59,147 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:23:59,147 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:23:59,147 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:23:59,148 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:23:59,149 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:23:59,150 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:23:59,150 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:23:59,151 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:23:59,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:23:59,152 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:23:59,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:23:59,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:23:59,153 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:23:59,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:23:59,153 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 07:23:59,164 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:23:59,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:23:59,164 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:23:59,165 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:23:59,165 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:23:59,165 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:23:59,165 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:23:59,165 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:23:59,166 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:23:59,166 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:23:59,166 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:23:59,166 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:23:59,166 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:23:59,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:23:59,167 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:23:59,167 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 07:23:59,167 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 07:23:59,167 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:23:59,167 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:23:59,167 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:23:59,167 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:23:59,168 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:23:59,168 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:23:59,168 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:23:59,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:23:59,168 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:23:59,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:23:59,168 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:23:59,169 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 07:23:59,169 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:23:59,169 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 07:23:59,169 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 07:23:59,169 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan 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 -> Taipan 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 -> b6e14d9043cb09b811e844719c56ad84744abca8 [2018-11-10 07:23:59,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:23:59,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:23:59,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:23:59,213 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:23:59,213 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:23:59,214 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_0684a_true-unreach-call.c [2018-11-10 07:23:59,257 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/data/f68e0c084/b35e3615ef664c85aa1ac8d567ebe724/FLAGba7300874 [2018-11-10 07:23:59,566 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:23:59,567 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/sv-benchmarks/c/float-newlib/float_req_bl_0684a_true-unreach-call.c [2018-11-10 07:23:59,572 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/data/f68e0c084/b35e3615ef664c85aa1ac8d567ebe724/FLAGba7300874 [2018-11-10 07:23:59,581 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/data/f68e0c084/b35e3615ef664c85aa1ac8d567ebe724 [2018-11-10 07:23:59,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:23:59,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:23:59,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:23:59,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:23:59,588 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:23:59,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:23:59" (1/1) ... [2018-11-10 07:23:59,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237d22e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59, skipping insertion in model container [2018-11-10 07:23:59,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:23:59" (1/1) ... [2018-11-10 07:23:59,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:23:59,622 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:23:59,808 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:23:59,815 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:23:59,867 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:23:59,892 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:23:59,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59 WrapperNode [2018-11-10 07:23:59,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:23:59,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:23:59,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:23:59,894 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:23:59,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59" (1/1) ... [2018-11-10 07:23:59,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59" (1/1) ... [2018-11-10 07:23:59,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:23:59,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:23:59,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:23:59,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:23:59,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59" (1/1) ... [2018-11-10 07:23:59,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59" (1/1) ... [2018-11-10 07:23:59,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59" (1/1) ... [2018-11-10 07:23:59,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59" (1/1) ... [2018-11-10 07:23:59,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59" (1/1) ... [2018-11-10 07:24:00,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59" (1/1) ... [2018-11-10 07:24:00,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59" (1/1) ... [2018-11-10 07:24:00,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:24:00,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:24:00,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:24:00,054 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:24:00,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:24:00,100 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_atan2f [2018-11-10 07:24:00,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_atan2f [2018-11-10 07:24:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_float [2018-11-10 07:24:00,101 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_float [2018-11-10 07:24:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:24:00,101 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:24:00,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:24:00,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:24:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2018-11-10 07:24:00,102 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2018-11-10 07:24:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:24:00,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:24:00,102 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2018-11-10 07:24:00,102 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2018-11-10 07:24:01,473 WARN L317 ript$VariableManager]: TermVariabe |qquantified_#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-10 07:24:01,545 WARN L317 ript$VariableManager]: TermVariabe |qquantified_#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-10 07:24:01,692 WARN L317 ript$VariableManager]: TermVariabe |qquantified_#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-10 07:24:01,753 WARN L317 ript$VariableManager]: TermVariabe |qquantified_#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-10 07:24:02,341 WARN L317 ript$VariableManager]: TermVariabe |qquantified_#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-10 07:24:02,375 WARN L317 ript$VariableManager]: TermVariabe |qquantified_#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-10 07:24:07,109 WARN L317 ript$VariableManager]: TermVariabe |qquantified_#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-10 07:24:10,505 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:24:10,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:24:10 BoogieIcfgContainer [2018-11-10 07:24:10,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:24:10,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:24:10,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:24:10,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:24:10,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:23:59" (1/3) ... [2018-11-10 07:24:10,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba93a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:24:10, skipping insertion in model container [2018-11-10 07:24:10,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:23:59" (2/3) ... [2018-11-10 07:24:10,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba93a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:24:10, skipping insertion in model container [2018-11-10 07:24:10,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:24:10" (3/3) ... [2018-11-10 07:24:10,511 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684a_true-unreach-call.c [2018-11-10 07:24:10,516 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:24:10,521 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:24:10,530 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:24:10,548 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:24:10,549 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:24:10,549 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:24:10,549 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:24:10,549 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:24:10,550 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:24:10,550 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:24:10,550 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:24:10,550 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:24:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2018-11-10 07:24:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:24:10,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:24:10,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:24:10,567 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:24:10,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:24:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash 563336594, now seen corresponding path program 1 times [2018-11-10 07:24:10,574 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 07:24:10,574 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-10 07:24:10,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:24:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:24:10,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:24:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:24:10,736 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 07:24:10,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:24:10,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:24:10,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 07:24:10,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:24:10,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:24:10,759 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 2 states. [2018-11-10 07:24:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:24:10,784 INFO L93 Difference]: Finished difference Result 208 states and 327 transitions. [2018-11-10 07:24:10,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:24:10,786 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-10 07:24:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:24:10,793 INFO L225 Difference]: With dead ends: 208 [2018-11-10 07:24:10,793 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 07:24:10,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:24:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 07:24:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-10 07:24:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 07:24:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions. [2018-11-10 07:24:10,833 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 25 [2018-11-10 07:24:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:24:10,834 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 142 transitions. [2018-11-10 07:24:10,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 07:24:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2018-11-10 07:24:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:24:10,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:24:10,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:24:10,835 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:24:10,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:24:10,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1959439350, now seen corresponding path program 1 times [2018-11-10 07:24:10,836 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 07:24:10,837 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-10 07:24:10,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:24:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:24:11,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:24:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:24:11,634 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 07:24:11,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:24:11,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 07:24:11,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 07:24:11,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 07:24:11,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:24:11,645 INFO L87 Difference]: Start difference. First operand 103 states and 142 transitions. Second operand 14 states. [2018-11-10 07:24:12,770 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-10 07:24:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:24:14,671 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-11-10 07:24:14,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 07:24:14,672 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-10 07:24:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:24:14,673 INFO L225 Difference]: With dead ends: 109 [2018-11-10 07:24:14,673 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 07:24:14,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-11-10 07:24:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 07:24:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-10 07:24:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 07:24:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2018-11-10 07:24:14,684 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 28 [2018-11-10 07:24:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:24:14,684 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2018-11-10 07:24:14,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 07:24:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2018-11-10 07:24:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 07:24:14,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:24:14,687 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:24:14,687 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:24:14,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:24:14,687 INFO L82 PathProgramCache]: Analyzing trace with hash 542855615, now seen corresponding path program 1 times [2018-11-10 07:24:14,688 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 07:24:14,688 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-10 07:24:14,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:24:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:24:14,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:24:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:24:14,906 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 07:24:14,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:24:14,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:24:14,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:24:14,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:24:14,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:24:14,916 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand 6 states. [2018-11-10 07:24:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:24:15,587 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2018-11-10 07:24:15,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:24:15,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-11-10 07:24:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:24:15,590 INFO L225 Difference]: With dead ends: 111 [2018-11-10 07:24:15,590 INFO L226 Difference]: Without dead ends: 103 [2018-11-10 07:24:15,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:24:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-10 07:24:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-10 07:24:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 07:24:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 139 transitions. [2018-11-10 07:24:15,599 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 139 transitions. Word has length 33 [2018-11-10 07:24:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:24:15,599 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 139 transitions. [2018-11-10 07:24:15,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:24:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2018-11-10 07:24:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 07:24:15,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:24:15,601 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:24:15,601 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:24:15,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:24:15,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1977104319, now seen corresponding path program 1 times [2018-11-10 07:24:15,602 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 07:24:15,602 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-10 07:24:15,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:24:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:24:15,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:24:15,910 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 07:24:16,139 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 07:24:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:24:16,283 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 07:24:16,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:24:16,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 07:24:16,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:24:16,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:24:16,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:24:16,298 INFO L87 Difference]: Start difference. First operand 103 states and 139 transitions. Second operand 7 states. [2018-11-10 07:24:20,378 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 07:24:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:24:21,921 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2018-11-10 07:24:21,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:24:21,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-10 07:24:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:24:21,923 INFO L225 Difference]: With dead ends: 109 [2018-11-10 07:24:21,923 INFO L226 Difference]: Without dead ends: 101 [2018-11-10 07:24:21,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:24:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-10 07:24:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-10 07:24:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 07:24:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2018-11-10 07:24:21,933 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 33 [2018-11-10 07:24:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:24:21,933 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2018-11-10 07:24:21,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:24:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2018-11-10 07:24:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 07:24:21,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:24:21,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:24:21,934 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:24:21,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:24:21,935 INFO L82 PathProgramCache]: Analyzing trace with hash -147334209, now seen corresponding path program 1 times [2018-11-10 07:24:21,935 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 07:24:21,935 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-10 07:24:21,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:24:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:24:22,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:24:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:24:22,169 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 07:24:22,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:24:22,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 07:24:22,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:24:22,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:24:22,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:24:22,183 INFO L87 Difference]: Start difference. First operand 101 states and 136 transitions. Second operand 7 states. [2018-11-10 07:24:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:24:22,806 INFO L93 Difference]: Finished difference Result 188 states and 260 transitions. [2018-11-10 07:24:22,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:24:22,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-10 07:24:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:24:22,808 INFO L225 Difference]: With dead ends: 188 [2018-11-10 07:24:22,808 INFO L226 Difference]: Without dead ends: 95 [2018-11-10 07:24:22,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:24:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-10 07:24:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-11-10 07:24:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-10 07:24:22,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2018-11-10 07:24:22,819 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 33 [2018-11-10 07:24:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:24:22,819 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2018-11-10 07:24:22,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:24:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2018-11-10 07:24:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 07:24:22,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:24:22,821 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:24:22,821 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:24:22,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:24:22,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2055575221, now seen corresponding path program 1 times [2018-11-10 07:24:22,822 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 07:24:22,822 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-10 07:24:22,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:24:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:24:22,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:24:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:24:23,246 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 07:24:23,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:24:23,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 07:24:23,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 07:24:23,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 07:24:23,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:24:23,261 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand 11 states. [2018-11-10 07:24:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:24:24,173 INFO L93 Difference]: Finished difference Result 120 states and 158 transitions. [2018-11-10 07:24:24,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 07:24:24,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-10 07:24:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:24:24,175 INFO L225 Difference]: With dead ends: 120 [2018-11-10 07:24:24,175 INFO L226 Difference]: Without dead ends: 84 [2018-11-10 07:24:24,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:24:24,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-10 07:24:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-10 07:24:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-10 07:24:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2018-11-10 07:24:24,186 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 34 [2018-11-10 07:24:24,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:24:24,186 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2018-11-10 07:24:24,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 07:24:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2018-11-10 07:24:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 07:24:24,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:24:24,187 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:24:24,187 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:24:24,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:24:24,187 INFO L82 PathProgramCache]: Analyzing trace with hash -630865547, now seen corresponding path program 1 times [2018-11-10 07:24:24,188 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 07:24:24,188 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-10 07:24:24,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:24:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:24:24,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:24:24,696 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 07:24:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:24:24,799 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 07:24:24,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:24:24,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 07:24:24,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:24:24,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:24:24,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:24:24,809 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand 7 states. [2018-11-10 07:24:28,935 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 07:24:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:24:29,684 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2018-11-10 07:24:29,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:24:29,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-10 07:24:29,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:24:29,685 INFO L225 Difference]: With dead ends: 90 [2018-11-10 07:24:29,685 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 07:24:29,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:24:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 07:24:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-10 07:24:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 07:24:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2018-11-10 07:24:29,695 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 35 [2018-11-10 07:24:29,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:24:29,695 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2018-11-10 07:24:29,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:24:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2018-11-10 07:24:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 07:24:29,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:24:29,696 INFO L375 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] [2018-11-10 07:24:29,696 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:24:29,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:24:29,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2111282298, now seen corresponding path program 1 times [2018-11-10 07:24:29,696 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 07:24:29,696 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-10 07:24:29,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:24:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:24:29,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:24:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:24:29,936 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 07:24:29,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:24:29,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 07:24:29,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:24:29,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:24:29,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:24:29,947 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 7 states. [2018-11-10 07:24:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:24:30,237 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2018-11-10 07:24:30,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:24:30,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-10 07:24:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:24:30,238 INFO L225 Difference]: With dead ends: 88 [2018-11-10 07:24:30,238 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 07:24:30,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:24:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 07:24:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-10 07:24:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 07:24:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-11-10 07:24:30,243 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 36 [2018-11-10 07:24:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:24:30,243 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-11-10 07:24:30,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:24:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-11-10 07:24:30,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 07:24:30,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:24:30,244 INFO L375 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] [2018-11-10 07:24:30,244 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:24:30,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:24:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash -664264764, now seen corresponding path program 1 times [2018-11-10 07:24:30,245 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 07:24:30,245 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-10 07:24:30,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:24:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:24:30,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:24:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:24:30,497 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 07:24:30,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:24:30,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 07:24:30,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 07:24:30,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 07:24:30,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:24:30,507 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 9 states. [2018-11-10 07:24:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:24:41,003 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-10 07:24:41,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 07:24:41,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-10 07:24:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:24:41,043 INFO L225 Difference]: With dead ends: 75 [2018-11-10 07:24:41,043 INFO L226 Difference]: Without dead ends: 66 [2018-11-10 07:24:41,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:24:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-10 07:24:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-11-10 07:24:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 07:24:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-11-10 07:24:41,047 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 39 [2018-11-10 07:24:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:24:41,048 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-11-10 07:24:41,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 07:24:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-11-10 07:24:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:24:41,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:24:41,048 INFO L375 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] [2018-11-10 07:24:41,048 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:24:41,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:24:41,049 INFO L82 PathProgramCache]: Analyzing trace with hash -538135019, now seen corresponding path program 1 times [2018-11-10 07:24:41,049 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 07:24:41,049 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/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-11-10 07:24:41,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:24:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:24:41,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:24:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:24:41,305 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 07:24:41,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:24:41,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 07:24:41,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:24:41,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:24:41,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:24:41,316 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 8 states. [2018-11-10 07:24:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:24:50,442 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-11-10 07:24:50,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:24:50,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-10 07:24:50,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:24:50,479 INFO L225 Difference]: With dead ends: 74 [2018-11-10 07:24:50,479 INFO L226 Difference]: Without dead ends: 65 [2018-11-10 07:24:50,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:24:50,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-10 07:24:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-11-10 07:24:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 07:24:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-11-10 07:24:50,484 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 40 [2018-11-10 07:24:50,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:24:50,484 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-10 07:24:50,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:24:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-10 07:24:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:24:50,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:24:50,485 INFO L375 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] [2018-11-10 07:24:50,485 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:24:50,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:24:50,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1269319444, now seen corresponding path program 1 times [2018-11-10 07:24:50,485 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 07:24:50,485 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cffe7ea1-adf2-4ffe-8fe2-64b5f6ca12d4/bin-2019/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-10 07:24:50,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:24:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:24:50,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:24:57,217 WARN L179 SmtUtils]: Spent 6.32 s on a formula simplification. DAG size of input: 139 DAG size of output: 115 [2018-11-10 07:24:57,389 INFO L303 Elim1Store]: Index analysis took 166 ms [2018-11-10 07:24:57,392 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-10 07:24:58,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:24:58,199 INFO L303 Elim1Store]: Index analysis took 789 ms [2018-11-10 07:24:58,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 47 [2018-11-10 07:24:58,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:24:58,644 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:24:58,644 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 07:24:58,647 INFO L303 Elim1Store]: Index analysis took 359 ms [2018-11-10 07:24:58,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2018-11-10 07:24:58,799 INFO L303 Elim1Store]: Index analysis took 150 ms [2018-11-10 07:24:58,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-10 07:24:58,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:25:02,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:25:11,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:25:11,647 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:25:14,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:25:14,120 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 07:25:14,123 INFO L303 Elim1Store]: Index analysis took 3989 ms [2018-11-10 07:25:14,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2018-11-10 07:25:15,014 INFO L303 Elim1Store]: Index analysis took 878 ms [2018-11-10 07:25:15,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 51 [2018-11-10 07:25:15,024 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 07:25:34,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:25:34,972 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 07:25:34,974 INFO L303 Elim1Store]: Index analysis took 589 ms [2018-11-10 07:25:34,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-11-10 07:25:34,975 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 07:25:53,637 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:26:15,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 07:26:33,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-10 07:26:57,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:26:59,682 INFO L303 Elim1Store]: Index analysis took 2546 ms [2018-11-10 07:26:59,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 133 [2018-11-10 07:27:03,828 WARN L179 SmtUtils]: Spent 4.14 s on a formula simplification that was a NOOP. DAG size: 100 [2018-11-10 07:27:03,998 INFO L303 Elim1Store]: Index analysis took 170 ms [2018-11-10 07:27:03,999 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-11-10 07:27:04,338 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:04,882 INFO L303 Elim1Store]: Index analysis took 881 ms [2018-11-10 07:27:04,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-11-10 07:27:05,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:05,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:05,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:06,732 INFO L303 Elim1Store]: Index analysis took 1848 ms [2018-11-10 07:27:06,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-11-10 07:27:07,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:07,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:07,437 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:07,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:07,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:07,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:10,302 INFO L303 Elim1Store]: Index analysis took 3566 ms [2018-11-10 07:27:10,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-11-10 07:27:10,303 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 07:27:13,550 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:27:15,710 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:27:17,293 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:27:20,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:20,632 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:20,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:22,813 INFO L303 Elim1Store]: Index analysis took 2471 ms [2018-11-10 07:27:22,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 129 [2018-11-10 07:27:22,904 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-11-10 07:27:23,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:23,251 INFO L303 Elim1Store]: Index analysis took 346 ms [2018-11-10 07:27:23,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-11-10 07:27:23,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:23,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:23,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:23,981 INFO L303 Elim1Store]: Index analysis took 727 ms [2018-11-10 07:27:23,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-11-10 07:27:24,117 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:24,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:24,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:24,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:24,418 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:24,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:25,429 INFO L303 Elim1Store]: Index analysis took 1446 ms [2018-11-10 07:27:25,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-11-10 07:27:25,431 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 07:27:26,597 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:27:27,370 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:27:28,080 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:27:29,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:29,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:29,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:30,561 INFO L303 Elim1Store]: Index analysis took 1231 ms [2018-11-10 07:27:30,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 137 [2018-11-10 07:27:30,588 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-11-10 07:27:30,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:30,798 INFO L303 Elim1Store]: Index analysis took 209 ms [2018-11-10 07:27:30,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2018-11-10 07:27:30,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:30,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:31,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:31,351 INFO L303 Elim1Store]: Index analysis took 551 ms [2018-11-10 07:27:31,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 83 [2018-11-10 07:27:31,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:31,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:31,595 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:31,641 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:31,705 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:31,760 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,425 INFO L303 Elim1Store]: Index analysis took 1071 ms [2018-11-10 07:27:32,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 107 [2018-11-10 07:27:32,457 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,464 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,486 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,657 INFO L303 Elim1Store]: Index analysis took 227 ms [2018-11-10 07:27:32,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 139 [2018-11-10 07:27:32,829 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,874 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,909 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:32,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:33,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:33,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:33,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:33,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:33,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:33,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:33,307 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:33,362 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:33,421 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:33,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:33,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:34,957 INFO L303 Elim1Store]: Index analysis took 2294 ms [2018-11-10 07:27:34,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 179 [2018-11-10 07:27:35,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,108 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,144 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,480 INFO L303 Elim1Store]: Index analysis took 516 ms [2018-11-10 07:27:35,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 227 [2018-11-10 07:27:35,519 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,558 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,577 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,602 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,615 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,634 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,640 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,646 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,659 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,666 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,672 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:35,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,066 INFO L303 Elim1Store]: Index analysis took 578 ms [2018-11-10 07:27:36,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 283 [2018-11-10 07:27:36,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,154 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,167 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,193 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,264 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,341 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,789 INFO L303 Elim1Store]: Index analysis took 717 ms [2018-11-10 07:27:36,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 347 [2018-11-10 07:27:36,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,865 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,881 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,888 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,902 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,909 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,931 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,946 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:36,994 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,011 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,027 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,044 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,076 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,101 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,117 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,146 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,160 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,689 INFO L303 Elim1Store]: Index analysis took 892 ms [2018-11-10 07:27:37,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 419 [2018-11-10 07:27:37,743 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,749 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,785 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,799 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,818 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,843 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,849 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,856 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,862 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,948 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:37,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,011 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,029 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,042 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,048 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,095 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:27:38,820 INFO L303 Elim1Store]: Index analysis took 1122 ms [2018-11-10 07:27:39,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 20 case distinctions, treesize of input 77 treesize of output 496 [2018-11-10 07:27:39,522 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-11-10 07:27:40,110 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1024 xjuncts. [2018-11-10 07:28:08,774 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:10,564 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:12,482 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:14,221 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:15,909 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:17,672 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:19,234 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:20,876 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:22,538 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:24,163 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:26,281 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:29,399 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:32,791 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 11 xjuncts. [2018-11-10 07:28:36,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 22 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-11-10 07:28:36,510 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 24 variables, input treesize:271, output treesize:503 [2018-11-10 07:28:36,653 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2018-11-10 07:28:36,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-10 07:28:36,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:28:36,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2018-11-10 07:28:36,722 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-11-10 07:28:36,724 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:28:36,736 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-11-10 07:28:36,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:28:36,738 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:28:36,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:28:36,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:107, output treesize:18 [2018-11-10 07:28:36,822 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:36,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:36,832 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:36,834 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:36,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-11-10 07:28:36,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:28:36,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:36,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:36,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 86 [2018-11-10 07:28:36,963 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-10 07:28:36,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-11-10 07:28:36,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 07:28:37,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:28:37,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:28:37,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-10 07:28:37,180 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:126, output treesize:213 [2018-11-10 07:28:37,309 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2018-11-10 07:28:37,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:37,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:37,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:37,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:37,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-11-10 07:28:37,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:28:37,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2018-11-10 07:28:37,410 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-11-10 07:28:37,414 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:28:37,431 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-11-10 07:28:37,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:28:37,435 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:28:37,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:28:37,460 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:18 [2018-11-10 07:28:38,422 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-10 07:28:39,609 WARN L179 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-10 07:28:41,300 WARN L179 SmtUtils]: Spent 752.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-10 07:28:48,824 WARN L179 SmtUtils]: Spent 7.52 s on a formula simplification. DAG size of input: 130 DAG size of output: 102 [2018-11-10 07:28:48,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:48,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,001 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,011 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,117 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,183 INFO L303 Elim1Store]: Index analysis took 357 ms [2018-11-10 07:28:49,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 97 [2018-11-10 07:28:49,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,577 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,676 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,724 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:28:49,725 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 07:28:49,729 INFO L303 Elim1Store]: Index analysis took 477 ms [2018-11-10 07:28:49,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 61 [2018-11-10 07:28:49,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:28:50,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:28:51,190 INFO L303 Elim1Store]: Index analysis took 131 ms [2018-11-10 07:28:51,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 483 treesize of output 350 [2018-11-10 07:28:56,205 WARN L179 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 97 [2018-11-10 07:28:56,268 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 192 [2018-11-10 07:28:56,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 188 treesize of output 187 [2018-11-10 07:28:56,541 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-10 07:28:56,608 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:28:56,668 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 215 [2018-11-10 07:28:56,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 212 treesize of output 205 [2018-11-10 07:28:56,893 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-10 07:28:56,960 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:28:57,532 INFO L303 Elim1Store]: Index analysis took 217 ms [2018-11-10 07:28:57,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 241 treesize of output 241 [2018-11-10 07:29:42,395 WARN L179 SmtUtils]: Spent 44.80 s on a formula simplification. DAG size of input: 461 DAG size of output: 213 [2018-11-10 07:29:42,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 165 [2018-11-10 07:29:42,454 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-10 07:30:04,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 144 [2018-11-10 07:30:04,207 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-10 07:30:14,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 138 [2018-11-10 07:30:14,491 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 104 [2018-11-10 07:30:14,491 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:30:15,602 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 85 [2018-11-10 07:30:15,603 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:30:16,285 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 61 [2018-11-10 07:30:16,286 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:30:16,962 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 84 treesize of output 79 [2018-11-10 07:30:16,962 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-10 07:30:17,840 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2018-11-10 07:30:17,841 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:30:18,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 59 [2018-11-10 07:30:18,699 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-10 07:30:20,271 INFO L267 ElimStorePlain]: Start of recursive call 12: 6 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-10 07:30:38,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 139 [2018-11-10 07:30:38,964 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 105 [2018-11-10 07:30:38,964 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:30:39,964 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 85 treesize of output 80 [2018-11-10 07:30:39,964 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-10 07:30:40,661 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2018-11-10 07:30:40,661 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:30:41,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 108 [2018-11-10 07:30:41,437 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-10 07:30:43,540 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 79 [2018-11-10 07:30:43,541 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:30:43,555 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 80 [2018-11-10 07:30:43,555 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:30:45,367 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2018-11-10 07:30:45,368 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:30:45,379 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2018-11-10 07:30:45,380 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:30:47,862 INFO L267 ElimStorePlain]: Start of recursive call 19: 6 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-10 07:31:25,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 138 [2018-11-10 07:31:25,290 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 105 [2018-11-10 07:31:25,291 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:31:26,192 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 108 treesize of output 103 [2018-11-10 07:31:26,192 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-10 07:31:27,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 83 [2018-11-10 07:31:27,143 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-11-10 07:31:29,485 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 79 [2018-11-10 07:31:29,486 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:31:32,559 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2018-11-10 07:31:32,559 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:31:33,993 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2018-11-10 07:31:33,994 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:31:34,004 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 54 [2018-11-10 07:31:34,005 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:31:35,714 INFO L267 ElimStorePlain]: Start of recursive call 28: 6 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-10 07:32:49,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 138 [2018-11-10 07:32:49,614 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2018-11-10 07:32:49,615 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:32:49,774 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 5 treesize of output 1 [2018-11-10 07:32:49,774 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-10 07:32:50,071 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2018-11-10 07:32:50,071 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:32:50,190 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 07:34:09,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 123 [2018-11-10 07:34:09,404 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2018-11-10 07:34:09,405 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:34:09,664 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2018-11-10 07:34:09,665 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:34:09,861 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 5 treesize of output 1 [2018-11-10 07:34:09,861 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-10 07:34:10,006 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 07:34:10,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 125 [2018-11-10 07:34:10,042 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2018-11-10 07:34:10,043 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:34:10,301 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2018-11-10 07:34:10,301 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:34:10,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 07:34:10,613 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-11-10 07:34:10,831 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-10 07:35:42,359 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2018-11-10 07:35:42,360 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)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:258) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 49 more [2018-11-10 07:35:42,362 INFO L168 Benchmark]: Toolchain (without parser) took 702779.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 949.2 MB in the beginning and 989.6 MB in the end (delta: -40.4 MB). Peak memory consumption was 298.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:35:42,363 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-11-10 07:35:42,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.84 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 927.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:35:42,363 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.57 ms. Allocated memory is still 1.0 GB. Free memory was 927.7 MB in the beginning and 922.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:35:42,363 INFO L168 Benchmark]: Boogie Preprocessor took 102.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 922.4 MB in the beginning and 1.1 GB in the end (delta: -214.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:35:42,363 INFO L168 Benchmark]: RCFGBuilder took 10452.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.8 MB). Peak memory consumption was 95.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:35:42,364 INFO L168 Benchmark]: TraceAbstraction took 691855.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -6.3 MB). Free memory was 1.0 GB in the beginning and 989.6 MB in the end (delta: 51.7 MB). Peak memory consumption was 238.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:35:42,365 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 308.84 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 927.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.57 ms. Allocated memory is still 1.0 GB. Free memory was 927.7 MB in the beginning and 922.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 922.4 MB in the beginning and 1.1 GB in the end (delta: -214.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 10452.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.8 MB). Peak memory consumption was 95.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 691855.32 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -6.3 MB). Free memory was 1.0 GB in the beginning and 989.6 MB in the end (delta: 51.7 MB). Peak memory consumption was 238.2 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)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...